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 mod
  n:. 0<n  (k:. nmod(nmod(k;n);n) = nmod(k;n))
By: RewriteOfThm
Thm* all
Thm* (n:hnum. implies(lt(0,n),all(k:hnum. equal(mod(mod(k,n),n),mod(k,n)))))
(SimpsetC [`hol_to_nuprl`;`bequal`])

Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc