hol
prim
rec
Sections
HOLlib
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Theorem
Name
Thm*
m
,
n
:
.
m
<
n
+1
m
=
n
m
<
n
[less_thm]
cites the following:
Thm*
all(
m
:hnum. all(
n
:hnum. equal(lt(
m
,suc(
n
)),or(equal(
m
,
n
),lt(
m
,
n
)))))
[hless_thm]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
hol
prim
rec
Sections
HOLlib
Doc
m,n:
. m<n+1 
m = n 
m<n
m:hnum. all(n:hnum. equal(lt(m,suc(n)),or(equal(m,n),lt(m,n)))))m,n:. m<n+1 m = n m<nm:hnum. all(n:hnum. equal(lt(m,suc(n)),or(equal(m,n),lt(m,n)))))