proposition: Lemma partition_Partition_simple : forall TValue f, Proper (E.eq ==> eq ==> eq) f -> forall (m: t TValue), Partition m (fst (partition f m)) (snd (partition f m)).
proof: Proof. intros. eapply partition_Partition; eauto. 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