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

  m,n:m<n & m = n  n<m

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


Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc