set "baseuri" "cic:/matita/nat/fermat_little_theorem".
+include "nat/exp.ma".
include "nat/gcd.ma".
include "nat/permutation.ma".
apply H4.
qed.
+(*
+theorem bad : \forall p,a:nat. prime p \to \lnot divides p a \to
+mod (exp a (pred p)) p = (S O).
+intros.
+cut map_iter p (\lambda x.x) times (S O) =
+map_iter p (\lambda n.(mod (a*n) p)) times (S O).
+*)
\ No newline at end of file