(5steps 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
bijection
1
1
2
1.
A
: Type
2.
f
:
A
A
3. Inj(
A
;
A
;
f
)
4. Surj(
A
;
A
;
f
)
5.
i
:
Surj(
A
;
A
;
f
{
i
})
By:
BackThru:
Thm*
Surj(
A
;
A
;
f
)
(
i
:
. Surj(
A
;
A
;
f
{
i
}))
Generated subgoals:
None
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(5steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
A
Surj(A; A; f{
i})
(
i:
