(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
1.
k
:
2.
f
:
k
k
3. Inj(
k
;
k
;
f
)
4.
u
:
k
i
:
.
f
{
i
}(
u
) =
u
By:
i
,
j
:
.
i
<
j
&
f
{
j
}(
u
) =
f
{
i
}(
u
)
k
Asserted
Generated subgoals:
1
i
,
j
:
.
i
<
j
&
f
{
j
}(
u
) =
f
{
i
}(
u
)
6
steps
2
5.
i
,
j
:
.
i
<
j
&
f
{
j
}(
u
) =
f
{
i
}(
u
)
i
:
.
f
{
i
}(
u
) =
u
4
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