(35steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
nsub
inj
exteq
nsub
surj
1
1
1
1
1
1
1
1
1
1.
k
:
2.
f
:
k
inj
k
3.
f
k
k
4. Inj(
k
;
k
;
f
)
5.
b
:
k
6.
(
a
:
k
.
f
(
a
) =
b
)
f
k
inj
{
y
:
k
|
y
=
b
}
By:
f
k
{
y
:
k
|
y
=
b
} Asserted THEN Analyze
Generated subgoals:
1
f
k
{
y
:
k
|
y
=
b
}
4
steps
2
7.
f
k
{
y
:
k
|
y
=
b
}
Inj(
k
; {
y
:
k
|
y
=
b
};
f
)
2
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(35steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc