proposition: Lemma In_condPt k v : C k -> (k, v) \In pts k v.
proof: Proof. by split; [rewrite validPt | exists Unit; rewrite unitR]. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)