Step
*
1
of Lemma
member-bs_tree_delete-implies
1. [E] : Type
2. cmp : comparison(E)
3. x : E
⊢ ∀z:E. (z ∈ bs_tree_delete(cmp;x;bst_null()) 
⇒ z ∈ bst_null())
BY
{ (RepUR ``bs_tree_delete member_bs_tree`` 0 THEN Auto) }
Latex:
Latex:
1.  [E]  :  Type
2.  cmp  :  comparison(E)
3.  x  :  E
\mvdash{}  \mforall{}z:E.  (z  \mmember{}  bs\_tree\_delete(cmp;x;bst\_null())  {}\mRightarrow{}  z  \mmember{}  bst\_null())
By
Latex:
(RepUR  ``bs\_tree\_delete  member\_bs\_tree``  0  THEN  Auto)
Home
Index