---

Step * of Lemma bm_exists_wf

∀[T,Key:Type]. ∀[m:binary-map(T;Key)]. ∀[p:T ⟶ 𝔹].  (bm_exists(m;p) ∈ 𝔹)
BY
{ (Auto
   THEN (InstLemma `binary_map_ind_wf_simple` [⌜T⌝;⌜Key⌝]⋅ THENA Auto)
   THEN Unfold `bm_exists` 0
   THEN BHyp -1 
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T,Key:Type].  \mforall{}[m:binary-map(T;Key)].  \mforall{}[p:T  {}\mrightarrow{}  \mBbbB{}].    (bm\_exists(m;p)  \mmember{}  \mBbbB{})


By

---

Latex:
(Auto
  THEN  (InstLemma  `binary\_map\_ind\_wf\_simple`  [\mkleeneopen{}T\mkleeneclose{};\mkleeneopen{}Key\mkleeneclose{}]\mcdot{}  THENA  Auto)
  THEN  Unfold  `bm\_exists`  0
  THEN  BHyp  -1 
  THEN  Auto)

---

Home Index