(* This program is free software; you can redistribute it and/or      *)
(* modify it under the terms of the GNU Lesser General Public License *)
(* as published by the Free Software Foundation; either version 2.1   *)
(* of the License, or (at your option) any later version.             *)
(*                                                                    *)
(* This program is distributed in the hope that it will be useful,    *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of     *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the      *)
(* GNU General Public License for more details.                       *)
(*                                                                    *)
(* You should have received a copy of the GNU Lesser General Public   *)
(* License along with this program; if not, write to the Free         *)
(* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA *)
(* 02110-1301 USA                                                     *)
(** fermat. Fermat's little theorem.  @author Martijn Oostdijk @version $Revision$ *)
(** * No double elements modulo p. *)
Definition nodoubles (p : nat) (l : Zlist) : Prop :=
forall x : Z,
inlist Z x l -> forall y : Z, inlist Z y (zdrop x l) -> ~ Mod x y p.
(** * All elements from l1 occur in l2 modulo p. *)
Definition allex (p : nat) (l0 l1 : Zlist) : Prop :=
forall x : Z, inlist Z x l0 -> exists y : Z, inlist Z y l1 /\ Mod x y p.
(** * The list of integers between 1 and n (inclusive) *)
Fixpoint until (n : nat) : Zlist :=
match n with
| O => Nil Z
| S n => Cons Z (Z_of_nat (S n)) (until n)
end.
(** * 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_nil : forall p : nat, permmod p (Nil Z) (Nil Z).