---

Step * of Lemma lg-contains_weakening

∀[T:Type]. ∀g1,g2:LabeledGraph(T).  g1 ⊆ g2 supposing g1 = g2 ∈ LabeledGraph(T)
BY
{ (Unfold `lg-contains` 0
   THEN Auto
   THEN InstConcl [⌈lg-nil()⌉;⌈lg-nil()⌉]⋅
   THEN Auto
   THEN RWW "lg-append-nil lg-nil-append" 0
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}g1,g2:LabeledGraph(T).    g1  \msubseteq{}  g2  supposing  g1  =  g2


By

---

Latex:
(Unfold  `lg-contains`  0
  THEN  Auto
  THEN  InstConcl  [\mkleeneopen{}lg-nil()\mkleeneclose{};\mkleeneopen{}lg-nil()\mkleeneclose{}]\mcdot{}
  THEN  Auto
  THEN  RWW  "lg-append-nil  lg-nil-append"  0
  THEN  Auto)

---

Home Index