proposition: Lemma Forall_Forall : forall {T:Type} (P Q:T -> Prop) l, (forall x, P x -> Q x) -> List.Forall P l -> List.Forall Q l.
proof: Proof. intros. induction H0. constructor. constructor ; auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause