proposition: Lemma umallPt k v : P k v -> um_all (pts k v : U).
proof: Proof. by move=>X k1 v1 /InPt [[->->]]. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)