---

Step * of Lemma remove-repeats-l_contains

∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[L1,L2:T List].  ||remove-repeats(eq;L1)|| ≤ ||remove-repeats(eq;L2)|| supposing L1 ⊆ L2
BY
{ (Auto
   THEN BLemma `l_contains-no_repeats-length`
   THEN Auto
   THEN ParallelLast
   THEN (RWO "l_all_iff" (-1) THENA Auto)
   THEN (RWO "l_all_iff" 0 THENA Auto)
   THEN ParallelLast
   THEN (RWO "member-remove-repeats" 0 THEN Auto)⋅) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[eq:EqDecider(T)].  \mforall{}[L1,L2:T  List].
    ||remove-repeats(eq;L1)||  \mleq{}  ||remove-repeats(eq;L2)||  supposing  L1  \msubseteq{}  L2


By

---

Latex:
(Auto
  THEN  BLemma  `l\_contains-no\_repeats-length`
  THEN  Auto
  THEN  ParallelLast
  THEN  (RWO  "l\_all\_iff"  (-1)  THENA  Auto)
  THEN  (RWO  "l\_all\_iff"  0  THENA  Auto)
  THEN  ParallelLast
  THEN  (RWO  "member-remove-repeats"  0  THEN  Auto)\mcdot{})

---

Home Index