---

Step * of Lemma bag-partitions_wf

∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[bs:bag(T)].  (bag-partitions(eq;bs) ∈ bag(bag(T) × bag(T))) supposing valueall-type(T)
BY
{ ProveWfLemma }

1
1. T : Type
2. valueall-type(T)
3. eq : EqDecider(T)
4. bs : bag(T)
⊢ proddeq(bag-deq(eq);bag-deq(eq)) ∈ EqDecider(bag(T) × bag(T))

---

Latex:

---

Latex:
\mforall{}[T:Type]
    \mforall{}[eq:EqDecider(T)].  \mforall{}[bs:bag(T)].    (bag-partitions(eq;bs)  \mmember{}  bag(bag(T)  \mtimes{}  bag(T))) 
    supposing  valueall-type(T)


By

---

Latex:
ProveWfLemma

---

Home Index