proposition: Lemma neg_bool_some : forall o b, neg_bool o = Some b -> o = Some (Annot.map negb b).
proof: Proof. destruct o ; simpl ; try congruence. intros. inv H. rewrite Annot.map_map. rewrite Annot.map_id. reflexivity. apply negb_involutive. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause