hol
arithmetic
4
Sections
HOLlib
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Theorem
Name
Thm*
n
:
. 0<
n
(
m
:
. pre(
m
)
pre(
n
)
m
n
)
[inv_pre_less_eq]
cites the following:
Thm*
all
Thm*
(
n
:hnum. implies(lt(0,
n
),all(
m
:hnum. equal(le(pre(
m
),pre(
n
)),le(
m
,
n
)))))
[hinv_pre_less_eq]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
hol
arithmetic
4
Sections
HOLlib
Doc