proposition: Lemma foldright_compose : forall {TInf TOutf TAcc} (g : TOutf -> TAcc -> TAcc) (f : TInf -> TOutf) (seq : list TInf) (init : TAcc), List.fold_right (compose g f) init seq = List.fold_right g init (List.map f seq).
proof: Proof. intros; induction seq; simpl; [ | rewrite IHseq ]; reflexivity. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Lists.List Coq.Lists.SetoidList Coq.Bool.Bool Fiat.Common Fiat.Common.List.Operations Fiat.Common.Equality Fiat.Common.List.FlattenList Fiat.Common.LogicFacts