Scheme lelistA_ind' := Induction for lelistA Sort Prop.Scheme sort_ind'    := Induction for sort Sort Prop.Scheme eqlistA_ind' := Induction for eqlistA Sort Prop.

(* Specifications: *)
Theorem lelistA_unique : forall (x : A) (xs : list A) (p q : lelistA R x xs), p = q.
Theorem sort_unique : forall (xs : list A) (p q : sort R xs), p = q.
Theorem eqlistA_unique : forall (xs ys : list A) (p q : eqlistA R xs ys), p = q.
Theorem lelistA_unique : forall (x : A) (xs : list A) (p q : lelistA R x xs), p = q.
Theorem sort_unique : forall (xs : list A) (p q : sort R xs), p = q.
Theorem eqlistA_unique : forall (xs ys : list A) (p q : eqlistA R xs ys), p = q.