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

At: assert l bexists 2 2 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. i: (||v||+1)
8. P(v[(i-1)])
9. i = 0
i:||v||. P(v[i])
By: Obvious
Generated subgoals:

None

About:
listboolassertintnatural_numberaddsubtractfunctionuniverseequalallexists

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