(5steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Iteration of a bijection is a bijection.
At:
compose
iter
bijection
A
:Type,
f
:(
A
A
). Bij(
A
;
A
;
f
)
(
i
:
. Bij(
A
;
A
;
f
{
i
}))
By:
Auto
Generated subgoal:
1
1.
A
: Type
2.
f
:
A
A
3. Bij(
A
;
A
;
f
)
4.
i
:
Bij(
A
;
A
;
f
{
i
})
4
steps
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:Type, f:(A
A). Bij(A; A; f) 
(i:
. Bij(A; A; f{
i})) A:Type, f:(AA). Bij(A; A; f) (i:. Bij(A; A; f{i}))A
Bij(A; A; f{i})
