proposition: Lemma SetEq_trans_iff_2: forall {A: Type} (seq1 seq2 seq2': list A), SetEq seq2 seq2' -> (SetEq seq1 seq2 <-> SetEq seq1 seq2').
proof: Proof. intuition; seteq_equivalence. Qed.
imports: Coq.Lists.List Coq.Bool.Bool Coq.Structures.OrderedType Coq.Classes.Morphisms Coq.Setoids.Setoid Fiat.Common.Coq__8_4__8_5__Compat