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

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

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


Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc