PrintForm Definitions Lemmas hol arithmetic 5 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: not num eq
  m,n:. m = n  m+1n  n+1m
By: RewriteOfThm
Thm* all
Thm* (m:hnum. all
Thm* (m:hnum. (n:hnum. equal(not(equal(m,n)),or(le(suc(m),n),le(suc(n),m)))))
(SimpsetC [`hol_to_nuprl`;`bequal`])

Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 5 Sections HOLlib Doc