proposition: Lemma merge_spec1mn (f:key->option elt->option elt'->option elt'') : Proper (K.eq==>Logic.eq==>Logic.eq==>Logic.eq) f -> (forall x, f x None None = None) -> forall (m: t elt)(m': t elt') x, find x (merge f m m') = f x (find x m) (find x m').
proof: Proof. intros Hf Hf' m m' x. now destruct (merge_spec1n Hf' m m' x) as (y,(->,->)). Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)