Notation Inf := (lelistA ltA).Notation Sort := (sort ltA).

(* Specifications: *)
Lemma eqlist_eq : forall (xs ys : list A), eqlistA (@eq _) xs ys -> xs = ys.
Lemma Sort_InA_eq : forall xs ys, Sort xs -> Sort ys -> (forall a, InA (@eq _) a xs <-> InA (@eq _) a ys) -> xs = ys.
Lemma Sort_In_eq : forall xs ys, Sort xs -> Sort ys -> (forall a, In a xs <-> In a ys) -> xs = ys.