proposition: Lemma valid_omapUnPt a k v f : [&& C k, valid f & k \notin dom f] -> valid (omap a f \+ pts k v).
proof: Proof. by move=>H; rewrite joinC; apply: valid_omapPtUn. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)