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