Nuprl - Proof: l member decomp2 2 2

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

1. T: Type
2. x,y:T. Dec(x = y)
3. s: T List
4. u: T
5. v: T List
6. z:T. (z v) (s1,s2:T List. v = (s1 @ [z / s2]) & (z s1))
7. z: T
8. (z [u / v])
9. z = u

s1,s2:T List. [u / v] = (s1 @ [z / s2]) & (z s1)

By: InstHyp [z] -4

Generated subgoals:

1 (z v) 1 step

2 10. s1,s2:T List. v = (s1 @ [z / s2]) & (z s1)
s1,s2:T List. [u / v] = (s1 @ [z / s2]) & (z s1) 3 steps

About:

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

1	`(z v)`	1 step

2	10. `s1,s2:T List. v = (s1 @ [z / s2]) & (z s1)` `s1,s2:T List. [u / v] = (s1 @ [z / s2]) & (z s1)`	3 steps