Nuprl - Proof: assert l bexists 1 1

(9steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc

At: assert l bexists 1 1

1. T: Type
2. L: T List
3. u: T
4. v: T List
5. P:(T). (xv.P(x)) (i:||v||. P(v[i]))
6. P: T
7. (xv.P(x))

i:(||v||+1). P([u / v][i])

By: InstHyp [P] -3 THEN ThinTrivial THEN ExRepD

Generated subgoal:

1 8. (xv.P(x)) (i:||v||. P(v[i]))
9. i: ||v||
10. P(v[i])
i:(||v||+1). P([u / v][i]) 1 step

About:

(9steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc