PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Search Doc
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: less mod
  n,k:. k<n  nmod(k;n) = k
By: RewriteOfThm Thm* all(n:hnum. all(k:hnum. implies(lt(k,n),equal(mod(k,n),k))))
(SimpsetC [`hol_to_nuprl`;`bequal`])

Generated subgoals:

None

About:
assertless_thanapplyequalimpliesall
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Search Doc