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

At: append one one

T:Type, x,z,y,w:T List. ||x|| = ||z|| ||y|| = ||w|| (x @ y) = (z @ w) x = z & y = w

By:
Auto
THEN
FwdThru Thm* equal_appends [-1]
THEN
ExRepD
THEN
Subst (e = nil) -1


Generated subgoals:

11. T: Type
2. x: T List
3. z: T List
4. y: T List
5. w: T List
6. ||x|| = ||z|| ||y|| = ||w||
7. (x @ y) = (z @ w)
8. e: T List
9. x = (z @ e) & w = (e @ y) z = (x @ e) & y = (e @ w)
e = nil
3 steps
 
21. T: Type
2. x: T List
3. z: T List
4. y: T List
5. w: T List
6. ||x|| = ||z|| ||y|| = ||w||
7. (x @ y) = (z @ w)
8. e: T List
9. x = (z @ nil) & w = (nil @ y) z = (x @ nil) & y = (nil @ w)
x = z & y = w
1 step

About:
listnilintuniverseequalimpliesandorallexists

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