---

Step * 1 2 of Lemma bag-induction


1. [T] : Type
2. [P] : bag(T) ⟶ ℙ
3. ∀x:T. P[[x]]
4. ∀bs:bag({b:bag(T)| P[b]} ). P[bag-union(bs)]
5. b : bag(T)
⊢ P[bag-union(bag-map(λx.[x];b))]
BY
{ (BHyp 4 THEN Auto) }

---

Latex:

---

Latex:

1.  [T]  :  Type
2.  [P]  :  bag(T)  {}\mrightarrow{}  \mBbbP{}
3.  \mforall{}x:T.  P[[x]]
4.  \mforall{}bs:bag(\{b:bag(T)|  P[b]\}  ).  P[bag-union(bs)]
5.  b  :  bag(T)
\mvdash{}  P[bag-union(bag-map(\mlambda{}x.[x];b))]


By

---

Latex:
(BHyp  4  THEN  Auto)

---

Home Index