proposition: Lemma fold_1 : forall m (A : Type) (i : A) (f : key -> elt -> A -> A), fold f m i = fold_left (fun a p => f (fst p) (snd p) a) (elements m) i.
proof: Proof. intros m; apply Raw.fold_1. Qed.
imports: SetoidList Bool OrderedType OrdersLists RelationPairs Orders RelationClasses