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

At: l before decomp 1 2 1
1. T: Type
2. L: T List
3. u: T
4. v: T List
5. x,y:T. [x; y] v (A,B:T List. v = (A @ B) & (x A) & (y B))
6. x: T
7. y: T
8. x = u & [y] v
A,B:T List. [u / v] = (A @ B) & (x A) & (y B)
By:
InstConcl [[u];v]
THEN
Reduce 0
Generated subgoals:

18. x = u
9. [y] v
(x [u])		1 step
 
28. x = u
9. [y] v
(y v)		1 step

About:
listconsconsniluniverseequalimpliesandallexists

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