proposition: Lemma ssim1_congr_Not : forall a b, ssim1 a b -> ssim1 (Not a) (Not b).
proof: Proof. rewrite /ssim1 => a b; case/andP => h1 h2. by rewrite ssublNot ssubrNot h1 h2. 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)