proposition: Lemma mkNot_id : forall r , wf_re r -> mkNot (mkNot r) == 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)