proposition: Lemma CAnd_catC : forall l1 l2, CAnd (l1++l2) =i CAnd (l2++l1).
proof: Proof. move => l1 l2 u. rewrite !CAnd_cat. by rewrite andbC. 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)