Nuprl - Proof: compose iter inj cycles 1 1 1 1 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 1 1 1 1 1

1. k :

2. f :

k

k
3. Inj(

k;

k; f)
4. u :

k
5. x :

(k+1)
6. y :

(k+1)
7. x

y
8. f{

x}(u) = f{

y}(u)
9. x<y

i,j:

(k+1). i<j & f{

i}(u) = f{

j}(u)

By:	Witness: x \| y ...

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