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