---

Step * of Lemma bs_tree_delete_wf

∀[E:Type]. ∀[cmp:comparison(E)]. ∀[x:E]. ∀[tr:ordered_bs_tree(E;cmp)].
  (bs_tree_delete(cmp;x;tr) ∈ ordered_bs_tree(E;cmp))
BY
{ (Auto THEN D -1 THEN MemTypeCD THEN Auto) }

1
.....set predicate..... 
1. E : Type
2. cmp : comparison(E)
3. x : E
4. tr : bs_tree(E)
5. bs_tree_ordered(E;cmp;tr)
⊢ bs_tree_ordered(E;cmp;bs_tree_delete(cmp;x;tr))

---

Latex:

---

Latex:
\mforall{}[E:Type].  \mforall{}[cmp:comparison(E)].  \mforall{}[x:E].  \mforall{}[tr:ordered\_bs\_tree(E;cmp)].
    (bs\_tree\_delete(cmp;x;tr)  \mmember{}  ordered\_bs\_tree(E;cmp))


By

---

Latex:
(Auto  THEN  D  -1  THEN  MemTypeCD  THEN  Auto)

---

Home Index