proposition: Lemma list_eq_rect (P: list A → list A → Type) (Pnil: P nil nil) (Pcons: forall a b, R a b → forall x y, list_eq x y → P x y → P (a :: x) (b :: y)): forall x y, list_eq x y → P x y.
proof: Proof. induction x; destruct y; simpl; intuition. Qed.
imports: Coq.Lists.List Coq.Unicode.Utf8 Coq.Setoids.Setoid Coq.Sorting.Permutation Coq.Setoids.Setoid Coq.Classes.Morphisms CoRN.stdlib_omissions.Pair