---

Step * of Lemma bm_unionWith_wf

∀[T,Key:Type]. ∀[compare:bm_compare(Key)]. ∀[m1,m2:binary-map(T;Key)]. ∀[f:T ─→ T ─→ T].
  (bm_unionWith(compare;f;m1;m2) ∈ binary-map(T;Key))
BY
{ ProveWfLemma }

---

Latex:


\mforall{}[T,Key:Type].  \mforall{}[compare:bm\_compare(Key)].  \mforall{}[m1,m2:binary-map(T;Key)].  \mforall{}[f:T  {}\mrightarrow{}  T  {}\mrightarrow{}  T].
    (bm\_unionWith(compare;f;m1;m2)  \mmember{}  binary-map(T;Key))


By

ProveWfLemma

---

Home Index