proposition: Lemma umallPtE k v : C k -> um_all (pts k v : U) -> P k v.
proof: Proof. by move/(In_condPt v)=>C'; apply. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)