---

Step * of Lemma cons-bag_wf

∀[T:Type]. ∀[x:T]. ∀[b:bag(T)].  (x.b ∈ bag(T))
BY
{ (Auto
   THEN BagD (-1)
   THEN (EqTypeCD THENA Auto)
   THEN Unfold `cons-bag` 0
   THEN Auto
   THEN (BLemma `permutation-cons` THENA Auto)
   THEN InstConcl [⌜[]⌝; ⌜bs⌝]⋅
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[x:T].  \mforall{}[b:bag(T)].    (x.b  \mmember{}  bag(T))


By

---

Latex:
(Auto
  THEN  BagD  (-1)
  THEN  (EqTypeCD  THENA  Auto)
  THEN  Unfold  `cons-bag`  0
  THEN  Auto
  THEN  (BLemma  `permutation-cons`  THENA  Auto)
  THEN  InstConcl  [\mkleeneopen{}[]\mkleeneclose{};  \mkleeneopen{}bs\mkleeneclose{}]\mcdot{}
  THEN  Auto)

---

Home Index