(14steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
iter
perm
cycles
uniform
1
1
1
1.
k
:
2.
f
:
k
k
3. Inj(
k
;
k
;
f
)
4.
u
:
k
.
i
:
.
f
{
i
}(
u
) =
u
5.
h
:
k
6.
u
:
k
.
f
{
h
(
u
)}(
u
) =
u
i
:
.
u
:
k
.
f
{
i
}(
u
) =
u
By:
SimilarTo:
i
:
.
u
:
k
.
m
:
.
i
=
h
(
u
)
m
...
Generated subgoals:
1
i
:
.
u
:
k
.
m
:
.
i
=
h
(
u
)
m
6
steps
2
7.
i
:
8.
u
:
k
9.
m
:
.
i
=
h
(
u
)
m
f
{
i
}(
u
) =
u
4
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(14steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc