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

  m,n:. 0<n  (m = pre(n m+1 = n  )

By: RewriteOfThm
Thm* all
Thm* (m:hnum. all
Thm* (m:hnum. (n:hnum. implies
Thm* (m:hnum. (n:hnum. (lt(0,n)
Thm* (m:hnum. (n:hnum. ,equal(equal(m,pre(n)),equal(suc(m),n)))))
(SimpsetC [`hol_to_nuprl`;`bequal`])


Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc