proposition: Lemma mkAnd_dup : forall r1 r2, wf_re r1 -> wf_re r2 -> mkAnd (mkAnd r1 r2) r2 = mkAnd r1 r2.
proof: Proof. move => r1 r2 h1 h2. by rewrite (mkAndC r1 r2) mkAndAC ?mkAnd_id. 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)