proposition: Lemma mkPlus_congr : forall r1 r2 r3 r4, r1 == r2 -> r3 == r4 -> mkPlus r1 r3 == mkPlus r2 r4.
proof: Proof. move => r1 r2 r3 r4 h1 h2. by rewrite (eqP h1) (eqP h2). 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)