proposition: Lemma bindings_empty : bindings (@empty elt) = nil.
proof: Proof. rewrite <-bindings_Empty; apply empty_1. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)