proposition: Lemma freeUnPt2 k1 k2 v f : valid (f \+ pts k2 v) -> free (f \+ pts k2 v) k1 = if k1 == k2 then f else free f k1 \+ pts k2 v.
proof: Proof. by rewrite !(joinC _ (pts k2 v)); apply: freePtUn2. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)