proposition: Lemma valid_undefN : ~~ valid (@undef U).
proof: Proof. by case: U=>V [b][u]. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq bigop fintype finset) pcm(options axioms prelude seqperm pred seqext)