proposition: Lemma IntMapForall_mono : forall {A: Type} (F:hmap -> A -> Prop) (m m' : hmap) (cl : IntMap.ptrie A) (FMono : forall x, F m x -> F m' x), hmap_order m m' -> IntMapForall (F m) cl -> IntMapForall (F m') cl.
proof: Proof. unfold IntMapForall. intros. apply H0 in H1. apply FMono ; auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause