Nuprl - Proof: iter perm cycles uniform 1 1 1 2 1 1

(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 2 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
7. i :

8. u :

k
9. m :

10. i = h(u)

m

f{

h(u)}{

m}(u) = u

By:	BackThru: Thm* f:(AA), u:A. f(u) = u (i:. f{i}(u) = u) ...w

Generated subgoal:

1 f{h(u)}(u) = u
1 step

About:

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(14steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc