---

Step * of Lemma tl_sublist

No Annotations
∀[T:Type]. ∀a:T. ∀L1,L2:T List.  ([a / L1] ⊆ L2 ⇒ L1 ⊆ L2)
BY
{ (Intros
   THEN (Using [`L2',⌜[a / L1]⌝] (BLemma `sublist_transitivity`)⋅ THEN Auto)
   THEN BLemma `sublist_tl`
   THEN Reduce 0
   THEN Auto) }

---

Latex:

---

Latex:
No  Annotations
\mforall{}[T:Type].  \mforall{}a:T.  \mforall{}L1,L2:T  List.    ([a  /  L1]  \msubseteq{}  L2  {}\mRightarrow{}  L1  \msubseteq{}  L2)


By

---

Latex:
(Intros
  THEN  (Using  [`L2',\mkleeneopen{}[a  /  L1]\mkleeneclose{}]  (BLemma  `sublist\_transitivity`)\mcdot{}  THEN  Auto)
  THEN  BLemma  `sublist\_tl`
  THEN  Reduce  0
  THEN  Auto)

---

Home Index