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

(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. 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

m:

. (

u:

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

m

By:	Inst: Thm* a,b:, e:({a..b}), i:{a..b}. e(i) \| ( i:{a..b}. e(i)) Using:[0 \| k \| e(u):= h(u) \| u]

Generated subgoal:

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