proposition: Lemma Forall_has_literal_NEG : forall m l, Forall (has_literal m) (List.map NEG l) <-> Forall (has_form m) l.
proof: Proof. induction l. - simpl. rewrite !Forall_rew. tauto. - simpl. rewrite Forall_rew. symmetry. rewrite Forall_rew. tauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause