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

k
8. h(u) | (

i:

k. h(i))

m:

. (

u:

k. h(u)) = h(u)

m

By:	Rewrite-1 by Thm* a,b:. a \| b (c:. b = ac) ...w

Generated subgoal:

1 9. c:. ( i:k. h(i)) = h(u)c
m:. ( u:k. h(u)) = h(u)m
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