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

diff --git a/doc/refman/RefMan-tacex.tex b/doc/refman/RefMan-tacex.tex
index 8330a434b..91ff3d5ec 100644
--- a/doc/refman/RefMan-tacex.tex
+++ b/doc/refman/RefMan-tacex.tex
@@ -1129,7 +1129,7 @@ red; intros (x, (y, Hy)).
 elim (Hy 0); elim (Hy 1); elim (Hy 2); intros;
  match goal with
  | [_:(?a = ?b),_:(?a = ?c) |- _ ] =>
-     cut (b = c); [ discriminate | apply trans_equal with a; auto ]
+     cut (b = c); [ discriminate | transitivity a; auto ]
  end.
 Qed.
 \end{coq_example*}
@@ -1379,7 +1379,7 @@ Axiom AR_unit : (A -> unit) = unit.
 Axiom AL_unit : (unit -> A) = A.
 Lemma Cons : B = C -> A * B = A * C.
 Proof.
-intro Heq; rewrite Heq; apply refl_equal.
+intro Heq; rewrite Heq; reflexivity.
 Qed.
 End Iso_axioms.
 \end{coq_example*}
@@ -1439,7 +1439,7 @@ Ltac assoc := repeat rewrite <- Ass.
 \begin{coq_example}
 Ltac DoCompare n :=
   match goal with
-  | [ |- (?A = ?A) ] => apply refl_equal
+  | [ |- (?A = ?A) ] => reflexivity
   | [ |- (?A * ?B = ?A * ?C) ] =>
       apply Cons; let newn := Length B in
                   DoCompare newn