proposition: Lemma map_map : forall { A B C } (f: A -> B) (g: B -> C), forall seq, List.map g (List.map f seq) = List.map (fun x => g (f x)) seq.
proof: Proof. intros; induction seq; simpl; f_equal; trivial. 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