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

At: assert l bexists 2 2 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([u / v][i])
9. i = 0
i:||v||. P(v[i])
By: RWO Thm* a:T, as:T List, i:. 0 < i i||as|| [a / as][i] = as[(i-1)] -2
Generated subgoal:

18. P(v[(i-1)])
9. i = 0
i:||v||. P(v[i])		1 step

About:
listconsboolassertintnatural_numberaddsubtractless_than
functionuniverseequalimpliesall
exists

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