Nuprl - Proof: iter perm cycles uniform 1 1 1 2 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. 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{

i}(u) = u

By:	Rewrite by Thm* x:A, f:(AA), i,j,k:. k = ij f{i}{j}(x) = f{k}(x) A Using:[i:= h(u) \| j:= m \| f:= f \| k:= i \| x:= u \| A:= k] ...a

Generated subgoal:

1 f{h(u)}{m}(u) = u
2 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