Nuprl - Proof: l before-iff 2 1 1

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

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 = u & (y v) x before y v

L1,L2,L3:T List. [u / v] = (L1 @ [x] @ L2 @ [y] @ L3)

By: Analyze -1

Generated subgoals:

1 8. x = u
9. (y v)
L1,L2,L3:T List. [u / v] = (L1 @ [x] @ L2 @ [y] @ L3) 2 steps

2 8. x before y v
L1,L2,L3:T List. [u / v] = (L1 @ [x] @ L2 @ [y] @ L3) 3 steps

About:

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

1	8. `x = u` 9. `(y v)` `L1,L2,L3:T List. [u / v] = (L1 @ [x] @ L2 @ [y] @ L3)`	2 steps

2	8. `x before y v` `L1,L2,L3:T List. [u / v] = (L1 @ [x] @ L2 @ [y] @ L3)`	3 steps