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