proposition: Lemma ssim1_ok : forall r s, ssim1 r s -> r =i s.
proof: Proof. rewrite /ssim1 => r s. case: (@ssublr_ok r s). rewrite /sub_mem => h1 h2. case/andP. move/h1 => hl; move/h2 => hr x. apply/idP/idP. - by apply: hl. by apply: hr. Qed.
imports: Coq(RelationClasses Setoid Morphisms Permutation) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype) mathcomp(bigop path) RegLang(languages) RegexpBrzozowski(regexp finite_der equiv)