(12steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
compose
iter
surjection
1
2
1
1
1
1.
A
: Type
2.
f
:
A
A
3. Surj(
A
;
A
;
f
)
4.
i
:
5. 0<
i
6.
b
:
A
7.
a
:
A
8.
f
{
i
-1}(
a
) =
b
9.
u
:
A
10.
f
(
u
) =
a
a
:
A
.
f
{
i
}(
a
) =
b
By:
Witness:
u
THEN Rewrite8 by
f
(
u
) =
a
A
Generated subgoal:
1
11.
f
{
i
-1}(
f
(
u
)) =
b
f
{
i
}(
u
) =
b
3
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(12steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
A
i-1}(a) = b
a:A. f{
A
