proposition: Lemma IntMapForallEmpty : forall {A: Type} {P: A -> Prop}, IntMapForall P (IntMap.empty A).
proof: Proof. unfold IntMapForall. intros. rewrite empty_o in H. congruence. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause