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