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

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. k :

2. f :

k
3. Inj(

k; f)
4. u :

k
5. x :

(k+1)
6. y :

(k+1)
7. x

y
8. f{

x}(u) = f{

y}(u)

i,j:

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

i}(u) = f{

j}(u)

By:	Decide: x<y ...w

Generated subgoals:

1 9. x<y
i,j:(k+1). i<j & f{i}(u) = f{j}(u)
1 step

2 9. x<y
i,j:(k+1). i<j & f{i}(u) = f{j}(u)
1 step

About:

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

1	9. x<y i,j:(k+1). i<j & f{i}(u) = f{j}(u)	1 step
2	9. x<y i,j:(k+1). i<j & f{i}(u) = f{j}(u)	1 step