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