proposition: Lemma hmap_order_dom : forall m m', hmap_order m m' -> order_dom m m'.
proof: Proof. unfold hmap_order, order_dom. intros. intro. destruct (IntMap.get' i m) eqn:EQ; try congruence. apply H in EQ. congruence. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause