PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: mod eq 0
  n:. 0<n  (k:. nmod(kn;n) = 0)
By: RewriteOfThm
Thm* all(n:hnum. implies(lt(0,n),all(k:hnum. equal(mod(mult(k,n),n),0))))
(SimpsetC [`hol_to_nuprl`;`bequal`])

Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc