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