From 8e2d90a6a9f4480026afd433fc997d9958f76a38 Mon Sep 17 00:00:00 2001
From: letouzey
Date: Mon, 3 Jan 2011 18:51:13 +0000
Subject: Numbers: some improvements in proofs

 - a ltac solve_proper which generalizes solve_predicate_wd and co
 - using le_elim is nicer that (apply le_lteq; destruct ...)
 - "apply ->" can now be "apply" most of the time.

 Benefit: NumPrelude is now almost empty

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@13762 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 theories/Numbers/Integer/Binary/ZBinary.v | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'theories/Numbers/Integer/Binary')

diff --git a/theories/Numbers/Integer/Binary/ZBinary.v b/theories/Numbers/Integer/Binary/ZBinary.v
index 8ed42ed8d9..cad5152d7a 100644
--- a/theories/Numbers/Integer/Binary/ZBinary.v
+++ b/theories/Numbers/Integer/Binary/ZBinary.v
@@ -23,7 +23,7 @@ Proof.
 intros A A_wd A0 AS n; apply Zind; clear n.
 assumption.
 intros; rewrite <- Zsucc_succ'. now apply -> AS.
-intros n H. rewrite <- Zpred_pred'. rewrite Zsucc_pred in H. now apply <- AS.
+intros n H. rewrite <- Zpred_pred'. rewrite Zsucc_pred in H. now apply AS.
 Qed.
 
 (** * Implementation of [ZAxiomsMiniSig] by [BinInt.Z] *)
-- 
cgit v1.2.3