hol
arithmetic
4
Sections
HOLlib
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Theorem
Name
Thm*
n
:
. 0<
n
(
k
:
. ndiv(
k
;
n
)
k
)
[div_less_eq]
cites the following:
Thm*
all(
n
:hnum. implies(lt(0,
n
),all(
k
:hnum. le(div(
k
,
n
),
k
))))
[hdiv_less_eq]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
hol
arithmetic
4
Sections
HOLlib
Doc
n:
. 0<n 
(k:. ndiv(k;n)
k)
n:hnum. implies(lt(0,n),all(k:hnum. le(div(k,n),k))))n:. 0<n (k:. ndiv(k;n)k)n:hnum. implies(lt(0,n),all(k:hnum. le(div(k,n),k))))