PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sub less eq add

  m,x:mx  (n:. nnsub(x;m)n  xm+n)

By: RewriteOfThm
Thm* all
Thm* (m:hnum. all
Thm* (m:hnum. (p:hnum. implies
Thm* (m:hnum. (p:hnum. (le(m,p)
Thm* (m:hnum. (p:hnum. ,all(n:hnum. equal(le(sub(p,m),n),le(p,add(m,n)))))))
(SimpsetC [`hol_to_nuprl`;`bequal`])


Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc