proposition: Lemma IntMapForall_Forall : forall {A: Type} (P Q: A -> Prop) m, (forall x, P x -> Q x) -> IntMapForall P m -> IntMapForall Q m.
proof: Proof. repeat intro. apply H0 in H1. auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause