Nuprl - Proof: sublist append iff 1 1 1 2

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

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. A': T List
13. B': T List
14. v = (A' @ B')
15. A' v1
16. B' B

[u / A'] [u1 / v1]

By: RWO Thm* x1,x2:T, L1,L2:T List. [x1 / L1] [x2 / L2] x1 = x2 & L1 L2 [x1 / L1] L2 0 THEN OrLeft

Generated subgoals:

None

About:

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