proposition: Lemma remove_o : forall m x y, find y (remove x m) = if eq_dec x y then None else find y m.
proof: Proof. intros; destruct (eq_dec x y); auto with map. Qed.
imports: Bool DecidableType DecidableTypeEx OrderedType Morphisms FMapInterface