proposition: Lemma Forall_map : forall A B (f : A -> B) (P : B -> Prop) ls, Forall (fun x => P (f x)) ls -> Forall P (map f ls).
proof: Proof. induction 1; simpl; auto. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)