PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: div mult

  n,r:r<n  (q:. ndiv(qn+r;n) = q)

By: RewriteOfThm
Thm* all
Thm* (n:hnum. all
Thm* (n:hnum. (r:hnum. implies
Thm* (n:hnum. (r:hnum. (lt(r,n)
Thm* (n:hnum. (r:hnum. ,all(q:hnum. equal(div(add(mult(q,n),r),n),q)))))
(SimpsetC [`hol_to_nuprl`;`bequal`])


Generated subgoals:

None

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

PrintForm Definitions Lemmas hol arithmetic 4 Sections HOLlib Doc