ZArith + other : favor the use of modern names instead of compat notations

 - For instance, refl_equal --> eq_refl
 - Npos, Zpos, Zneg now admit more uniform qualified aliases
   N.pos, Z.pos, Z.neg.
 - A new module BinInt.Pos2Z with results about injections from
   positive to Z
 - A result about Z.pow pushed in the generic layer
 - Zmult_le_compat_{r,l} --> Z.mul_le_mono_nonneg_{r,l}
 - Using tactic Z.le_elim instead of Zle_lt_or_eq
 - Some cleanup in ring, field, micromega
   (use of "Equivalence", "Proper" ...)
 - Some adaptions in QArith (for instance changed Qpower.Qpower_decomp)
 - In ZMake and ZMake, functor parameters are now named NN and ZZ
   instead of N and Z for avoiding confusions

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@15515 85f007b7-540e-0410-9357-904b9bb8a0f7

1 files changed, 5 insertions, 5 deletions

diff --git a/theories/ZArith/Wf_Z.v b/theories/ZArith/Wf_Z.v
index bcccc1269..bb84d0c8c 100644
--- a/theories/ZArith/Wf_Z.v
+++ b/theories/ZArith/Wf_Z.v
@@ -39,7 +39,7 @@ Proof.
 Qed.
 
 Lemma Z_of_nat_complete_inf (x : Z) :
- 0 <= x -> {n : nat | x = Z_of_nat n}.
+ 0 <= x -> {n : nat | x = Z.of_nat n}.
 Proof.
  intros H. exists (Z.to_nat x). symmetry. now apply Z2Nat.id.
 Qed.
@@ -53,7 +53,7 @@ Qed.
 
 Lemma Z_of_nat_set :
  forall P:Z -> Set,
-   (forall n:nat, P (Z_of_nat n)) -> forall x:Z, 0 <= x -> P x.
+   (forall n:nat, P (Z.of_nat n)) -> forall x:Z, 0 <= x -> P x.
 Proof.
  intros P H x Hx. now destruct (Z_of_nat_complete_inf x Hx) as (n,->).
 Qed.
@@ -129,7 +129,7 @@ Section Efficient_Rec.
    - now destruct Hz.
   Qed.
 
-  (** A more general induction principle on non-negative numbers using [Zlt]. *)
+  (** A more general induction principle on non-negative numbers using [Z.lt]. *)
 
   Lemma Zlt_0_rec :
     forall P:Z -> Type,
@@ -155,7 +155,7 @@ Section Efficient_Rec.
     exact Zlt_0_rec.
   Qed.
 
-  (** Obsolete version of [Zlt] induction principle on non-negative numbers *)
+  (** Obsolete version of [Z.lt] induction principle on non-negative numbers *)
 
   Lemma Z_lt_rec :
     forall P:Z -> Type,
@@ -173,7 +173,7 @@ Section Efficient_Rec.
     exact Z_lt_rec.
   Qed.
 
-  (** An even more general induction principle using [Zlt]. *)
+  (** An even more general induction principle using [Z.lt]. *)
 
   Lemma Zlt_lower_bound_rec :
     forall P:Z -> Type, forall z:Z,