proposition: Lemma check_annot_find_lit : forall hm a u b (FL: find_lit a u = Some b) (WF: wf_units_lit u hm), wf_pset hm (Annot.deps b).
proof: Proof. intros. unfold find_lit in FL. destruct a. - apply WF in FL; auto. tauto. - apply neg_bool_some in FL. apply WF in FL ; auto. tauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause