Fixpoint elements' (x: tree) (base: list key) : list key :=
  match x with
  | EE => base
  | T _ t1 k t2 => elements' t1 (cons k (elements' t2 base))
 end.

Lemma delmin_eq: forall s x (v: searchtree None None s), choose' s = Some x -> delete'_min s = Some (x, delete x s).