(* Contribution to the Coq Library   V6.3 (July 1999)                    *)
(****************************************************************************)
(*                 The Calculus of Inductive Constructions                  *)
(*                                                                          *)
(*                                Projet Coq                                *)
(*                                                                          *)
(*                     INRIA                        ENS-CNRS                *)
(*              Rocquencourt                        Lyon                    *)
(*                                                                          *)
(*                                Coq V5.10                                 *)
(*                              Nov 25th 1994                               *)
(*                                                                          *)
(****************************************************************************)
(*                              Z_succ_pred.v                               *)
(****************************************************************************)
Require Export Arith.
Require Export Zbase.
(* Succ and Pred on Z *)
(**************)
Definition succZ (x : Z) :=
match x return Z with
| OZ =>
(* OZ *)  IZ (* pos n *)
| pos n => pos (S n)
(* neg n *)
| neg n =>
match n return Z with
| O =>
(* O *)  OZ (* S m *)
| S m => neg m
end
end.
(**************)
Definition predZ (x : Z) :=
match x return Z with
| OZ =>
(* OZ *)  neg 0 (* pos n *)
| pos n =>
match n return Z with
| O =>
(* O *)  OZ (* S m *)
| S m => pos m
end
(* neg n *)
| neg n => neg (S n)
end.

(*************************)
Lemma succ_pred_pred_succZ : forall x : Z, succZ (predZ x) = predZ (succZ x).