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

At: sublist append iff 1 2
1. T: Type
2. C: T List
3. u: T
4. v: T List
5. A,B:T List. v A @ B (A',B':T List. v = (A' @ B') & A' A & B' B)
6. A: T List
7. u1: T
8. v1: T List
9. B:T List. [u / v] v1 @ B (A',B':T List. [u / v] = (A' @ B') & A' v1 & B' B)
10. B: T List
11. A',B':T List. [u / v] = (A' @ B') & A' [u1 / v1] & B' B
u = u1 & v v1 @ B [u / v] v1 @ B
By:
ExRepD
THEN
Analyze -5
THEN
All Reduce
Generated subgoals:

111. B': T List
12. [u / v] = B'
13. nil [u1 / v1]
14. B' B
u = u1 & v v1 @ B [u / v] v1 @ B		1 step
 
211. u2: T
12. v2: T List
13. B': T List
14. [u / v] = [u2 / (v2 @ B')]
15. [u2 / v2] [u1 / v1]
16. B' B
u = u1 & v v1 @ B [u / v] v1 @ B		6 steps

About:
listconsuniverseequalandorallexists

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