hol arithmetic 4 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
TheoremName
Thm* n:. 0<n  (k:. nmod(kn;n) = 0)[mod_eq_0]
cites the following:
Thm* all(n:hnum. implies(lt(0,n),all(k:hnum. equal(mod(mult(k,n),n),0))))[hmod_eq_0]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
hol arithmetic 4 Sections HOLlib Doc