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

At: sublist append iff 1 1 1
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. u = u1
12. v v1 @ B
A',B':T List. [u / v] = (A' @ B') & A' [u1 / v1] & B' B
By:
RW (HypC 5) -1
THEN
ExRepD
THEN
InstConcl [[u / A'];B']
THEN
Reduce 0
Generated subgoals:

112. A': T List
13. B': T List
14. v = (A' @ B')
15. A' v1
16. B' B
[u / v] = [u / (A' @ B')]		1 step
 
212. A': T List
13. B': T List
14. v = (A' @ B')
15. A' v1
16. B' B
[u / A'] [u1 / v1]		1 step

About:
listconsuniverseequalandallexists

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