From 49a7bb129b8a7f9d5a9175b7a340112c20e95d96 Mon Sep 17 00:00:00 2001
From: letouzey
Date: Thu, 15 May 2008 22:42:23 +0000
Subject: In practice, the new setoid rewrite (and the "at" syntax) allows to
 avoid using the ad-hoc qsetoid_rewrite. Could QRewrite.v be made completely
 obsolete ? For the moment rewrite under fun and exists don't work.

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10935 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 theories/Numbers/Integer/Abstract/ZPlus.v | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'theories/Numbers/Integer/Abstract/ZPlus.v')

diff --git a/theories/Numbers/Integer/Abstract/ZPlus.v b/theories/Numbers/Integer/Abstract/ZPlus.v
index cdafa1ca7c..2520d62e19 100644
--- a/theories/Numbers/Integer/Abstract/ZPlus.v
+++ b/theories/Numbers/Integer/Abstract/ZPlus.v
@@ -75,7 +75,7 @@ Proof NZplus_cancel_r.
 Theorem Zplus_pred_l : forall n m : Z, P n + m == P (n + m).
 Proof.
 intros n m.
-pattern n at 2. qsetoid_rewrite <- (Zsucc_pred n).
+rewrite <- (Zsucc_pred n) at 2.
 rewrite Zplus_succ_l. now rewrite Zpred_succ.
 Qed.
 
@@ -104,19 +104,19 @@ Qed.
 
 Theorem Zminus_pred_l : forall n m : Z, P n - m == P (n - m).
 Proof.
-intros n m. pattern n at 2; qsetoid_rewrite <- (Zsucc_pred n).
+intros n m. rewrite <- (Zsucc_pred n) at 2.
 rewrite Zminus_succ_l; now rewrite Zpred_succ.
 Qed.
 
 Theorem Zminus_pred_r : forall n m : Z, n - (P m) == S (n - m).
 Proof.
-intros n m. pattern m at 2; qsetoid_rewrite <- (Zsucc_pred m).
+intros n m. rewrite <- (Zsucc_pred m) at 2.
 rewrite Zminus_succ_r; now rewrite Zsucc_pred.
 Qed.
 
 Theorem Zopp_pred : forall n : Z, - (P n) == S (- n).
 Proof.
-intro n. pattern n at 2; qsetoid_rewrite <- (Zsucc_pred n).
+intro n. rewrite <- (Zsucc_pred n) at 2.
 rewrite Zopp_succ. now rewrite Zsucc_pred.
 Qed.
 
-- 
cgit v1.2.3