Def ndiv(m;n) == if n=0 then 0 else m  n fi 

is mentioned by

Thm* n:. 0<n  ndiv(0;n) = 0	[zero_div]
Thm* n,r:. r<n  (q:. ndiv(qn+r;n) = q)	[div_mult]
Thm* n,k,q:. (r:. k = qn+r   & r<n)  ndiv(k;n) = q	[ndiv_unique]
Thm* n:. 0<n  (k:. ndiv(k;n)k)	[div_less_eq]

In prior sections: hol arithmetic 1

Try larger context: HOLlib IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html