proposition: Lemma in_CAnd_nil : forall u, (u \in CAnd [::]).
proof: Proof. by move => u; rewrite CAnd_all /=. Qed.
imports: Coq(RelationClasses Setoid Morphisms) HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype) mathcomp(bigop path) RegLang(languages) RegexpBrzozowski(glue regexp finite_der equiv)