(* 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                                                     *)
(** pock. Pocklington's criterion.  @author Olga Caprotti and Martijn Oostdijk @version $Revision$ *)
(** For all numbers q in natlist qlist: 1 is a linear combination of a^(m*qlist/qi) and n modulo n. *)
Definition allLinCombMod (a : Z) (n m : nat) (qlist : natlist) :=
alllist nat
(fun q : nat =>
LinCombMod 1 (Exp a (m * multDrop q qlist) - 1) (Z_of_nat n) n) qlist.
(** Pocklington's theorem (finally). Proves Pocklington for natural numbers. *)
(** Below is an attempt to restate Pocklington's theorem using only numbers from Z. This will make concrete computations faster. *)
(** ZallLinCombMod is equivalent to AllLinCombMod but uses Z. *)
Definition ZallLinCombMod (a n m N : Z) (qlist : Zlist) :=
alllist Z
(fun q : Z => ZLinCombMod 1 (ZExp a (m * zmultDrop q qlist) - 1) n N)
qlist.

Lemma ZallLinCombMod_ok :
forall (a n m N : Z) (qlist : Zlist),
ZallLinCombMod a n m N qlist ->
forall qi : Z,
inlist Z qi qlist -> ZLinCombMod 1 (ZExp a (m * zmultDrop qi qlist) - 1) n N.