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

m:

. i = h(u)

m

By:	Witness: u:k. h(u) ...

Generated subgoals:

1 7. x :
8. y :
xy
1 step

2 7. u : k
m:. ( u:k. h(u)) = h(u)m
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