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

Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 3 Sections HOLlib Doc