---

Step * 2 of Lemma nil_interleaving2


1. [T] : Type
2. L1 : T List
3. L : T List
4. L = L1 ∈ (T List)
⊢ disjoint_sublists(T;L1;[];L)
BY
{ ((WeakSubstFor L 0⋅ THEN Auto)
   THEN Unfold `disjoint_sublists` 0
   THEN Reduce 0
   THEN InstConcl [λi.i;λi.i]⋅
   THEN Reduce 0
   THEN Auto) }

---

Latex:

---

Latex:

1.  [T]  :  Type
2.  L1  :  T  List
3.  L  :  T  List
4.  L  =  L1
\mvdash{}  disjoint\_sublists(T;L1;[];L)


By

---

Latex:
((WeakSubstFor  L  0\mcdot{}  THEN  Auto)
  THEN  Unfold  `disjoint\_sublists`  0
  THEN  Reduce  0
  THEN  InstConcl  [\mlambda{}i.i;\mlambda{}i.i]\mcdot{}
  THEN  Reduce  0
  THEN  Auto)

---

Home Index