proposition: Lemma cmpb_neg : forall (s t:bool), cmpb t s = CompOpp (cmpb s t).
proof: Proof. by case => [] [] /=. 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)