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

At: paren order1 3 1 1
1. T: Type
2. s: (T+T) List
3. t: T
4. i:T, s1,s2:(T+T) List. s = (s1 @ [inl(i)] @ s2) (inr(i) s2)
5. paren(T;s)
6. i: T
7. s1: (T+T) List
8. s2: (T+T) List
9. ([inl(t)] @ s @ [inr(t)]) = (s1 @ [inl(i)] @ s2)
10. e: (T+T) List
11. [inl(t)] = (s1 @ e)
12. ([inl(i)] @ s2) = (e @ s @ [inr(t)])
13. s1 = nil
14. e = [inl(t)]
(inr(i) s2)
By:
HypSubst -1 -3
THEN
Reduce -3
THEN
SplitCons -3
THEN
HypSubst -1 0
Generated subgoal:

112. s1 = nil
13. e = [inl(t)]
14. inl(i) = inl(t) T+T
15. s2 = (s @ [inr(t)])
(inr(i) s @ [inr(t)])		1 step

About:
listconsnilunioninlinruniverseequalimpliesall

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