proposition: Lemma rPlus_congr : forall l c1 c2, similar c1 c2 -> similar (rPlus c1 l) (rPlus c2 l).
proof: Proof. elim => [ | hd tl hi] //= c1 c2 heq. apply similar_congr_Plus; last reflexivity. by apply: hi. Qed.
imports: Coq(RelationClasses Setoid Morphisms Permutation) Coq(SetoidList Mergesort Orders) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype) mathcomp(bigop path) RegLang(languages) RegexpBrzozowski(glue gfinset regexp)