Section Perm.
Variable A : Type.
Hypothesis eq_dec : forall x y:A, {x=y} + {~ x=y}.
Notation permutation := (permutation _ eq_dec).
Notation list_contents := (list_contents _ eq_dec).
(** we can use [multiplicity] to define [In] and [NoDup]. *)
(** When used with [eq], this permutation notion is equivalent to the one defined in [List.v]. *)
(** Permutation for short lists. *)

Lemma permut_length_1:
forall a b, permutation (a :: nil) (b :: nil)  -> a=b.