proposition: Lemma lAcc: forall (E F:bregexp) (X:seq (bregexp*bregexp*bword)), Acc (gpred_list (Prod (set_pair_der E F) bT)) (sup sim3) X.
proof: Proof. move => E F X. apply (guard 100). move => X'. apply: wf_sup. - by apply: sim_dec3. - by apply: Set_of_der_compat. - by apply: set_pair_der_finite. Defined.
imports: Coq(RelationClasses) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype) mathcomp(bigop path) RegLang(languages) RegexpBrzozowski(glue gfinset regexp finite_der)