PrintForm
Definitions
Lemmas
hol
arithmetic
4
Sections
HOLlib
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
less
suc
eq
cor
m
,
n
:
.
m
<
n
&
m
+1 =
n
m
+1<
n
By:
RewriteOfThm
Thm*
all
Thm*
(
m
:hnum. all
Thm* (
m
:hnum.
(
n
:hnum. implies
Thm* (
m
:hnum. (
n
:hnum.
(and(lt(
m
,
n
),not(equal(suc(
m
),
n
)))
Thm* (
m
:hnum. (
n
:hnum.
,lt(suc(
m
),
n
))))
(SimpsetC [`hol_to_nuprl`;`bequal`])
Generated subgoals:
None
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
PrintForm
Definitions
Lemmas
hol
arithmetic
4
Sections
HOLlib
Doc