---

Step * of Lemma l_disjoint_intersection_implies

∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[a,b:T List].  l_disjoint(T;a;b) supposing l_disjoint(T;a;l_intersection(eq;a;b))
BY
{ (Auto
   THEN All (Unfold `l_disjoint`)⋅
   THEN RepeatFor 2 (ParallelLast)
   THEN Auto
   THEN RWO "member-intersection" 0
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[eq:EqDecider(T)].  \mforall{}[a,b:T  List].
    l\_disjoint(T;a;b)  supposing  l\_disjoint(T;a;l\_intersection(eq;a;b))


By

---

Latex:
(Auto
  THEN  All  (Unfold  `l\_disjoint`)\mcdot{}
  THEN  RepeatFor  2  (ParallelLast)
  THEN  Auto
  THEN  RWO  "member-intersection"  0
  THEN  Auto)

---

Home Index