Nuprl - Proof: assert l bexists 1

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

At: assert l bexists 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. P(u) (xv.P(x))

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

By: (Analyze -1) THENL [(InstConcl [0]) THEN (Reduce 0);Id]

Generated subgoal:

1 7. (xv.P(x))
i:(||v||+1). P([u / v][i]) 2 steps

About:

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