proposition: Lemma bindings_in_iff m x : In x m <-> exists e, InA eq_key_elt (x,e) (bindings m).
proof: Proof. unfold In; split; intros (e,H); exists e; now apply bindings_spec1. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)