(22steps total)
PrintForm
Definitions
Lemmas
mb
nat
Sections
MarkB
generic
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
disjoint
increasing
onto
m
,
n
,
k
:
,
f
:(
n
m
),
g
:(
k
m
).
increasing(
f
;
n
)
increasing(
g
;
k
)
(
i
:
m
. (
j
:
n
.
i
=
f
(
j
))
(
j
:
k
.
i
=
g
(
j
)))
(
j1
:
n
,
j2
:
k
.
f
(
j1
) =
g
(
j2
))
m
=
n
+
k
By:
Auto
Generated subgoal:
1
1.
m
:
2.
n
:
3.
k
:
4.
f
:
n
m
5.
g
:
k
m
6. increasing(
f
;
n
)
7. increasing(
g
;
k
)
8.
i
:
m
. (
j
:
n
.
i
=
f
(
j
))
(
j
:
k
.
i
=
g
(
j
))
9.
j1
:
n
,
j2
:
k
.
f
(
j1
) =
g
(
j2
)
m
=
n
+
k
21
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(22steps total)
PrintForm
Definitions
Lemmas
mb
nat
Sections
MarkB
generic
Doc