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
add
1
m
,
n
:
.
n
<
m
(
x
:
.
m
=
n
+
x
+1
)
By:
RewriteOfThm
Thm*
all
Thm*
(
m
:hnum. all
Thm* (
m
:hnum.
(
n
:hnum. implies
Thm* (
m
:hnum. (
n
:hnum.
(lt(
n
,
m
)
Thm* (
m
:hnum. (
n
:hnum.
,exists(
p
:hnum. equal(
m
,add(
n
,add(
p
,1)))))))
(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