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

diff --git a/theories/Logic/ClassicalFacts.v b/theories/Logic/ClassicalFacts.v
index bcec657aa..7d5cec74d 100644
--- a/theories/Logic/ClassicalFacts.v
+++ b/theories/Logic/ClassicalFacts.v
@@ -191,7 +191,7 @@ Section Proof_irrelevance_gen.
     intros Ext Ind.
     case (ext_prop_fixpoint Ext bool true); intros G Gfix.
     set (neg := fun b:bool => bool_elim bool false true b).
-    generalize (refl_equal (G neg)).
+    generalize (eq_refl (G neg)).
     pattern (G neg) at 1 in |- *.
     apply Ind with (b := G neg); intro Heq.
     rewrite (bool_elim_redl bool false true).
@@ -228,9 +228,9 @@ Section Proof_irrelevance_Prop_Ext_CC.
   Definition FalseP : BoolP := fun C c1 c2 => c2.
   Definition BoolP_elim C c1 c2 (b:BoolP) := b C c1 c2.
   Definition BoolP_elim_redl (C:Prop) (c1 c2:C) :
-    c1 = BoolP_elim C c1 c2 TrueP := refl_equal c1.
+    c1 = BoolP_elim C c1 c2 TrueP := eq_refl c1.
   Definition BoolP_elim_redr (C:Prop) (c1 c2:C) :
-    c2 = BoolP_elim C c1 c2 FalseP := refl_equal c2.
+    c2 = BoolP_elim C c1 c2 FalseP := eq_refl c2.
 
   Definition BoolP_dep_induction :=
     forall P:BoolP -> Prop, P TrueP -> P FalseP -> forall b:BoolP, P b.
@@ -263,9 +263,9 @@ Section Proof_irrelevance_CIC.
     | trueP : boolP
     | falseP : boolP.
   Definition boolP_elim_redl (C:Prop) (c1 c2:C) :
-    c1 = boolP_ind C c1 c2 trueP := refl_equal c1.
+    c1 = boolP_ind C c1 c2 trueP := eq_refl c1.
   Definition boolP_elim_redr (C:Prop) (c1 c2:C) :
-    c2 = boolP_ind C c1 c2 falseP := refl_equal c2.
+    c2 = boolP_ind C c1 c2 falseP := eq_refl c2.
   Scheme boolP_indd := Induction for boolP Sort Prop.
 
   Lemma ext_prop_dep_proof_irrel_cic : prop_extensionality -> proof_irrelevance.
@@ -392,9 +392,9 @@ Section Proof_irrelevance_CCI.
   Hypothesis em : forall A:Prop, A \/ ~ A.
 
   Definition or_elim_redl (A B C:Prop) (f:A -> C) (g:B -> C)
-    (a:A) : f a = or_ind f g (or_introl B a) := refl_equal (f a).
+    (a:A) : f a = or_ind f g (or_introl B a) := eq_refl (f a).
   Definition or_elim_redr (A B C:Prop) (f:A -> C) (g:B -> C)
-    (b:B) : g b = or_ind f g (or_intror A b) := refl_equal (g b).
+    (b:B) : g b = or_ind f g (or_intror A b) := eq_refl (g b).
   Scheme or_indd := Induction for or Sort Prop.
 
   Theorem proof_irrelevance_cci : forall (B:Prop) (b1 b2:B), b1 = b2.