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

At: paren order1 2 1 2
1. T: Type
2. s1: (T+T) List
3. s2: (T+T) List
4. i:T, s1@0,s2:(T+T) List. s1 = (s1@0 @ [inl(i)] @ s2) (inr(i) s2)
5. i:T, s1,s2@0:(T+T) List. s2 = (s1 @ [inl(i)] @ s2@0) (inr(i) s2@0)
6. paren(T;s1)
7. paren(T;s2)
8. i: T
9. s1@0: (T+T) List
10. s2@0: (T+T) List
11. (s1 @ s2) = (s1@0 @ [inl(i)] @ s2@0)
12. e: (T+T) List
13. s1 = (s1@0 @ e)
14. ([inl(i)] @ s2@0) = (e @ s2)
15. e1: (T+T) List
16. e = ([inl(i)] @ e1) & s2@0 = (e1 @ s2)
(inr(i) s2@0)
By: InstHyp [i;s1@0;e1] 4
Generated subgoals:

116. e = ([inl(i)] @ e1)
17. s2@0 = (e1 @ s2)
s1 = (s1@0 @ [inl(i)] @ e1)		1 step
 
216. e = ([inl(i)] @ e1)
17. s2@0 = (e1 @ s2)
18. (inr(i) e1)
(inr(i) s2@0)		2 steps

About:
listconsnilunioninlinruniverseequalimpliesandall

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