proposition: Lemma fold_Equal_simpl : forall {TValue TAcc} {eqA: TAcc -> TAcc -> Prop} {m1 m2: t TValue} {f} {init: TAcc}, Equal m1 m2 -> Equivalence eqA -> Proper (E.eq ==> eq ==> eqA ==> eqA) f -> transpose_neqkey eqA f -> eqA (fold f m1 init) (fold f m2 init).
proof: Proof. intros. apply fold_Equal; assumption. Qed.
imports: Coq.FSets.FMapInterface Coq.FSets.FMapFacts Coq.Program.Program Coq.Structures.OrderedTypeEx Fiat.Common Fiat.Common.SetEq Fiat.Common.SetEqProperties Fiat.Common.List.ListFacts Fiat.Common.List.ListMorphisms Fiat.Common.LogicFacts Fiat.Common.SetoidClassInstances