proposition: Lemma CPlus_undup : forall l, CPlus (undup l) =i CPlus l.
proof: Proof. move => l u. rewrite ! CPlus_has. apply/hasP/hasP. - case => x h1 h2. exists x => //. by rewrite -mem_undup. - case => x h1 h2. exists x => //. by rewrite mem_undup. 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)