proposition: Lemma fold_rec_nodep : forall {A}(P : A -> Type)(f : key -> elt -> A -> A)(i:A) m, P i -> (forall k e a, MapsTo k e m -> P a -> P (f k e a)) -> P (fold f m i).
proof: Proof. intros. eapply fold_rec_bis; auto. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)