proposition: Lemma inversePt k v : C k -> inverse (pts k v) = pts v k.
proof: Proof. by move=>C''; rewrite /inverse umfoldlPt unitL C''. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)