proposition: Lemma eval_pset_union : forall m s1 s2, LitSet.wf s1 -> LitSet.wf s2 -> (eval_pset m (LitSet.union s1 s2) <-> (eval_pset m s1 /\ eval_pset m s2)).
proof: Proof. intros. unfold eval_pset. split ; intros. - split ; intros. apply H1;auto. rewrite <- LitSet.lift_has_bool_union;auto. apply H1; auto. rewrite <- LitSet.lift_has_bool_union;auto. - rewrite <- LitSet.lift_has_bool_union in H3 by assumption. intuition. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause