proposition: Lemma join_undef (x : U) : x \+ undef = undef.
proof: Proof. by rewrite joinC undef_join. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq bigop fintype finset) pcm(options axioms prelude seqperm pred seqext)