---

Step * of Lemma bag-no-repeats-supertype

∀[T,S:Type]. ∀[bs:bag(S)].  bag-no-repeats(T;bs) supposing strong-subtype(S;T) ∧ bag-no-repeats(S;bs)
BY
{ xxx(Unfold `bag-no-repeats` 0 THEN Auto THEN D 0 THEN ParallelLast THEN Auto)xxx }

---

Latex:

---

Latex:
\mforall{}[T,S:Type].  \mforall{}[bs:bag(S)].
    bag-no-repeats(T;bs)  supposing  strong-subtype(S;T)  \mwedge{}  bag-no-repeats(S;bs)


By

---

Latex:
xxx(Unfold  `bag-no-repeats`  0  THEN  Auto  THEN  D  0  THEN  ParallelLast  THEN  Auto)xxx

---

Home Index