Nuprl - Proof: assert l bexists 2

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

At: assert l bexists 2

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. i: (||v||+1)
8. P([u / v][i])

P(u) (xv.P(x))

By: (CaseNat 0 `i') THENL [OrLeft;OrRight]

Generated subgoals:

1 9. i = 0
P(u) 1 step

2 9. i = 0
(xv.P(x)) 3 steps

About:

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