proposition: Lemma InA_R_InA {A} {R : relation A} {_ : @Transitive A R} ls x y (HR : R y x) : InA R x ls -> InA R y ls.
proof: Proof. induction ls. { intro H'; inversion H'. } { intro H'; (inversion H'; [ left | right ]); subst; clear H'; auto with nocore. etransitivity; eassumption. } Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Lists.List Coq.Lists.SetoidList Coq.Bool.Bool Fiat.Common Fiat.Common.List.Operations Fiat.Common.Equality Fiat.Common.List.FlattenList Fiat.Common.LogicFacts