proposition: Lemma Forall_removeb : forall [A: Type] (P : A -> Prop) (R: A-> bool) l, Forall P l -> Forall P (removeb R l).
proof: Proof. intros. induction H. - constructor. - simpl. destruct (R x); auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause