proposition: Lemma valid_undef : valid (@undef U) = false.
proof: Proof. by rewrite (negbTE valid_undefN). Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq bigop fintype finset) pcm(options axioms prelude seqperm pred seqext)