proposition: Lemma mkAnd_CVoid_rt : forall r, mkAnd r CVoid = CVoid.
proof: Proof. case => [ | | | s | r1 | l1 | l1 | l1 | r1 ]//=. by case: r1. 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)