Nuprl - Proof: compose iter inj cycles 1 1 2 1 1 1

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

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: compose iter inj cycles 1 1 2 1 1 1

1. k :

2. f :

k

k
3. Inj(

k;

k; f)
4. u :

k
5. i :

6. j :

7. i<j
8. f{

j}(u) = f{

i}(u)
9. f{

i}(f{

j-i}(u)) = f{

i}(u)
10. f{

j-i}(u) = u

i:

. f{

i}(u) = u

By:	Witness: j-i ...

Generated subgoals:

None

About:

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

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