proposition: Lemma impl_pol_iff : forall pol p q, (p <-> q) -> impl_pol pol p q.
proof: Proof. unfold impl_pol. destruct pol; tauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause