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