proposition: Lemma Tab1P q : q \in (Tab x).1 <-> connect (srel (size x).+1 (x++z)) (nfa2_s M,ord1) (q,inord (size x).+1).
proof: Proof. by rewrite /Tab inE runL /= -[ord1]inord_val. Qed.
imports: Coq(Lia) mathcomp(all_ssreflect) RegLang(misc setoid_leq languages dfa myhill_nerode two_way)