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

Generated subgoals:

None

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

PrintForm Definitions Lemmas hol prim rec Sections HOLlib Doc