(13steps 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
inj
cycles
1
1.
k
:
2.
f
:
k
inj
k
3.
u
:
k
i
:
.
f
{
i
}(
u
) =
u
By:
Analyze-2
Generated subgoal:
1
2.
f
:
k
k
3. Inj(
k
;
k
;
f
)
4.
u
:
k
i
:
.
f
{
i
}(
u
) =
u
11
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 inj
k
k
i:
. f{
i}(u) = u
k inj k
k
i:. f{i}(u) = uk
k
k; k; f)
k
i:. f{i}(u) = u
