PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: inv pre less
  m:. 0<m  (n:. pre(m)<pre(n)  m<n)
By: RewriteOfThm
Thm* all
Thm* (m:hnum. implies(lt(0,m),all(n:hnum. equal(lt(pre(m),pre(n)),lt(m,n)))))
(SimpsetC [`hol_to_nuprl`;`bequal`])

Generated subgoals:

None

About:
assertnatural_numberless_thanapplyimpliesall
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc