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

At: l before-iff 2 1 1 2 1
1. T: Type
2. L: T List
3. u: T
4. v: T List
5. x,y:T. x before y v (L1,L2,L3:T List. v = (L1 @ [x] @ L2 @ [y] @ L3))
6. x: T
7. y: T
8. x before y v
9. x before y v (L1,L2,L3:T List. v = (L1 @ [x] @ L2 @ [y] @ L3))
10. L1: T List
11. L2,L3:T List. v = (L1 @ [x] @ L2 @ [y] @ L3)
L2,L3:T List. [u / v] = ([u / L1] @ [x] @ L2 @ [y] @ L3)
By: RepeatFor 2 (ParallelOp -1)
Generated subgoal:

111. L2: T List
12. L3: T List
13. v = (L1 @ [x] @ L2 @ [y] @ L3)
[u / v] = ([u / L1] @ [x] @ L2 @ [y] @ L3)		1 step

About:
listconsconsniluniverseequalallexists

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