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

Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 5 Sections HOLlib Doc