proposition: Lemma take_map {A B n} (f : A -> B) ls : take n (map f ls) = map f (take n ls).
proof: Proof. revert n; induction ls; drop_take_t. 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