Nuprl - Proof: iter via intseg shift rw 1 2 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: iter via intseg shift rw 1 2 1 1

1. A : Type
2. f : A

A
3. u : A
4. a :

5. b : {a+1...}
6.

c:{a..b

}, e:({a..c

}

A), k:

.
6. (Iter(f;u) i:{a..c

}. e(i)) = (Iter(f;u) j:{a+k..c+k

}. e(j-k))
7. e : {a..b

}

A
8. k :

f(Iter(f;u) i:{a..b-1

}. e(i)) = f(Iter(f;u) j:{a+k..b+k-1

}. e(j-k))

By:

Analyze

Generated subgoal:

1 (Iter(f;u) i:{a..b-1}. e(i)) = (Iter(f;u) j:{a+k..b+k-1}. e(j-k))
1 step

About:

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