(13steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
A finite permutation always cycles back on each argument.
At:
compose
iter
inj
cycles
k
:
,
f
:(
k
inj
k
),
u
:
k
.
i
:
.
f
{
i
}(
u
) =
u
By:
Auto
Generated subgoal:
1
1.
k
:
2.
f
:
k
inj
k
3.
u
:
k
i
:
.
f
{
i
}(
u
) =
u
12
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(13steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
k:
, f:(k inj
k), u:k. 
i:
. f{
i}(u) = u k:, f:(k inj k), u:k. i:. f{i}(u) = u
k inj k
k
i:. f{i}(u) = u
