proposition: Lemma not_in_empty x : ~In x (@empty elt).
proof: Proof. intros (e,H). revert H. apply empty_mapsto_iff. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)