proposition: Lemma Forall_app : forall A (P : A -> Prop) ls1, Forall P ls1 -> forall ls2, Forall P ls2 -> Forall P (ls1 ++ ls2).
proof: Proof. induction 1; simpl; intuition. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)