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

  m,n,x:mn  (x+1)m(x+1)n

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


Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 5 Sections HOLlib Doc