proposition: Lemma CAnd_all : forall l u, (u \in CAnd l) = all (fun c => u \in c) l.
proof: Proof. elim => [ | hd tl hi] //= u. - rewrite CAnd_cons. by rewrite hi. 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)