proposition: Lemma mkAnd_CAll_rt : forall r, mkAnd r (CNot CVoid) = r.
proof: Proof. case => //. by case. 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)