---

Step * 2 of Lemma member-bs_tree_delete-implies


1. [E] : Type
2. cmp : comparison(E)
3. x : E
⊢ ∀value,z:E.  (z ∈ bs_tree_delete(cmp;x;bst_leaf(value)) ⇒ z ∈ bst_leaf(value))
BY
{ (Intro THEN RepUR ``bs_tree_delete member_bs_tree`` 0 THEN AutoSplit) }

---

Latex:

---

Latex:

1.  [E]  :  Type
2.  cmp  :  comparison(E)
3.  x  :  E
\mvdash{}  \mforall{}value,z:E.    (z  \mmember{}  bs\_tree\_delete(cmp;x;bst\_leaf(value))  {}\mRightarrow{}  z  \mmember{}  bst\_leaf(value))


By

---

Latex:
(Intro  THEN  RepUR  ``bs\_tree\_delete  member\_bs\_tree``  0  THEN  AutoSplit)

---

Home Index