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, 4 insertions, 4 deletions

diff --git a/theories/ZArith/Zabs.v b/theories/ZArith/Zabs.v
index 2e43b3554..1eaae5df0 100644
--- a/theories/ZArith/Zabs.v
+++ b/theories/ZArith/Zabs.v
@@ -77,9 +77,9 @@ Notation Zsgn_null := Z.sgn_null_iff (compat "8.3").
 (** A characterization of the sign function: *)
 
 Lemma Zsgn_spec x :
-  0 < x /\ Zsgn x = 1 \/
-  0 = x /\ Zsgn x = 0 \/
-  0 > x /\ Zsgn x = -1.
+  0 < x /\ Z.sgn x = 1 \/
+  0 = x /\ Z.sgn x = 0 \/
+  0 > x /\ Z.sgn x = -1.
 Proof.
  intros. Z.swap_greater. apply Z.sgn_spec.
 Qed.
@@ -99,7 +99,7 @@ Proof.
  intros (H,H'). apply Zabs2Nat.inj_le; trivial. now transitivity n.
 Qed.
 
-Lemma Zabs_nat_lt n m : 0 <= n < m -> (Zabs_nat n < Zabs_nat m)%nat.
+Lemma Zabs_nat_lt n m : 0 <= n < m -> (Z.abs_nat n < Z.abs_nat m)%nat.
 Proof.
  intros (H,H'). apply Zabs2Nat.inj_lt; trivial.
   transitivity n; trivial. now apply Z.lt_le_incl.