proposition: Lemma validUnPtI v1 k f : valid (f \+ pts k v1) -> [&& C k, valid f & k \notin dom f].
proof: Proof. by rewrite validUnPt. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)