proposition: Lemma SetoidPermutation_from_Permutation {A} (e: relation A) `{!Reflexive e} (a b: list A): Permutation a b → SetoidPermutation e a b.
proof: Proof. intro. apply SetoidPermutation_stronger with eq. intros. subst. reflexivity. apply SetoidPermutation_eq. assumption. Qed.
imports: Coq.Unicode.Utf8 Coq.Setoids.Setoid CoRN.stdlib_omissions.List Coq.Sorting.Permutation Coq.Setoids.Setoid Coq.Classes.Morphisms