hol
arithmetic
4
Sections
HOLlib
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Theorem
Name
Thm*
k
:
. nmod(
k
;0+1) = 0
[mod_one]
cites the following:
Thm*
all(
k
:hnum. equal(mod(
k
,suc(0)),0))
[hmod_one]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
hol
arithmetic
4
Sections
HOLlib
Doc
k:
. nmod(k;0+1) = 0
k:hnum. equal(mod(k,suc(0)),0))k:. nmod(k;0+1) = 0k:hnum. equal(mod(k,suc(0)),0))