proposition: Lemma foldkeys_Empty m i : Empty m -> eqA (foldkeys m i) i.
proof: Proof. now apply fold_Empty. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)