hol
arithmetic
5
Sections
HOLlib
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Theorem
Name
Thm*
n
:
. odd(
n
)
(
m
:
.
n
= 2
m
+1
)
[odd_exists]
cites the following:
Thm*
all(
n
:hnum. equal(odd(
n
),exists(
m
:hnum. equal(
n
,suc(mult(2,
m
))))))
[hodd_exists]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
hol
arithmetic
5
Sections
HOLlib
Doc