proposition: Lemma umfoldrUnPt a k v z0 d f : valid (f \+ pts k v) -> all (ord^~ k) (dom f) -> um_foldr a z0 d (f \+ pts k v) = um_foldr a (a k v z0) d f.
proof: Proof. by move=>W H; rewrite /um_foldr W (validL W) assocsUnPt // -cats1 foldr_cat. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)