hol
arithmetic
5
Sections
HOLlib
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Theorem
Name
Thm*
m
,
n
:
.
m
n
n
+1
m
[not_leq]
cites the following:
Thm*
all(
m
:hnum. all(
n
:hnum. equal(not(le(
m
,
n
)),le(suc(
n
),
m
))))
[hnot_leq]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
hol
arithmetic
5
Sections
HOLlib
Doc
m,n:
. 
m
n 
n+1m
m:hnum. all(n:hnum. equal(not(le(m,n)),le(suc(n),m))))m,n:. mn n+1mm:hnum. all(n:hnum. equal(not(le(m,n)),le(suc(n),m))))