proposition: Lemma lift_pred : forall {A: Type} (P Q : A -> Prop) (PQ : forall x, P x -> Q x) e, lift P e -> lift Q e.
proof: Proof. unfold lift. auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause