proposition: Lemma sim_incl_InA : forall x l1 l2, InA l1 x -> sim_incl l1 l2 -> InA l2 x.
proof: Proof. move => x l1 l2. elim : l1 => [ | hd tl] //=. case: (sim_incl tl l2) => //=. case: (eqA_dec x hd) => //=. - move => heq _ _ hIn. by rewrite (InA_eq l2 heq). - move => _ h hIn _. by apply: h. Qed.
imports: Coq(RelationClasses Setoid Morphisms SetoidList Mergesort Permutation) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype) mathcomp(bigop path) RegexpBrzozowski(glue)