proposition: Lemma combine_map_l {A A' B} (g : A -> A') ls ls' : List.combine (List.map g ls) ls' = List.map (fun x : A * B => (g (fst x), snd x)) (List.combine ls ls').
proof: Proof. revert ls'; induction ls as [|l ls IHls]; intros [|l' ls']; simpl; f_equal. eauto with nocore. 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