---

Step * of Lemma bag-no-repeats-implies-disjoint

∀[T:Type]. ∀[as,bs:bag(T)].  bag-disjoint(T;as;bs) supposing bag-no-repeats(T;as + bs)
BY
{ (Auto
   THEN RepUR ``bag-disjoint`` 0
   THEN Auto
   THEN (D 0 THENA Auto)
   THEN RepD
   THEN RWO "bag-append-no-repeats<" (-4)
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[as,bs:bag(T)].    bag-disjoint(T;as;bs)  supposing  bag-no-repeats(T;as  +  bs)


By

---

Latex:
(Auto
  THEN  RepUR  ``bag-disjoint``  0
  THEN  Auto
  THEN  (D  0  THENA  Auto)
  THEN  RepD
  THEN  RWO  "bag-append-no-repeats<"  (-4)
  THEN  Auto)

---

Home Index