proposition: Lemma umUndefPtE (k : K) (v : V) : ((undef : union_map_eqType K V) == k \\-> v) = false.
proof: Proof. by rewrite eq_sym umPtUndefE. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)