proposition: Lemma fold_right_map : forall {A B} f seq, @List.fold_right (list B) A (fun b a => f b :: a) [] seq = List.map f seq.
proof: Proof. intros; induction seq; simpl; try rewrite IHseq; reflexivity. 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