proposition: Lemma eval_ifP a p z0 f : eval a p f z0 = eval (fun r k v => if p (k, v) then a r k v else r) predT f z0.
proof: Proof. by rewrite /eval umfilt_predT oev_dom_umfilt oev_umfiltA. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)