(** * Permutations modulo p. *)
Fixpoint permmod (p : nat) (l1 : Zlist) {struct l1} :
Zlist -> Prop :=
fun l2 : Zlist =>
match l1 with
| Nil => l2 = Nil Z
| Cons x t =>
exists y : Z, inlist Z y l2 /\ Mod x y p /\ permmod p t (zdrop y l2)
end.

Lemma permmod_trans1 :
forall (n p : nat) (l0 l1 l2 : Zlist),
length Z l0 = n ->
length Z l1 = n ->
length Z l2 = n -> permmod p l0 l1 -> permmod p l1 l2 -> permmod p l0 l2.