From 7cfc4e5146be5666419451bdd516f1f3f264d24a Mon Sep 17 00:00:00 2001
From: Enrico Tassi <gareuselesinge@debian.org>
Date: Sun, 25 Jan 2015 14:42:51 +0100
Subject: Imported Upstream version 8.5~beta1+dfsg

---
 theories/NArith/Ndec.v | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

(limited to 'theories/NArith/Ndec.v')

diff --git a/theories/NArith/Ndec.v b/theories/NArith/Ndec.v
index e38ce5ba..5b1815bd 100644
--- a/theories/NArith/Ndec.v
+++ b/theories/NArith/Ndec.v
@@ -1,6 +1,6 @@
 (************************************************************************)
 (*  v      *   The Coq Proof Assistant  /  The Coq Development Team     *)
-(* <O___,, *   INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2014     *)
+(* <O___,, *   INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2015     *)
 (*   \VV/  **************************************************************)
 (*    //   *      This file is distributed under the terms of the       *)
 (*         *       GNU Lesser General Public License Version 2.1        *)
@@ -119,11 +119,11 @@ Lemma Nneq_elim a a' :
    N.odd a = negb (N.odd a') \/
    N.eqb (N.div2 a) (N.div2 a') = false.
 Proof.
-  intros. cut (N.odd a = N.odd a' \/ N.odd a = negb (N.odd a')).
-  intros. elim H0. intro. right. apply Ndiv2_bit_neq. assumption.
-  assumption.
-  intro. left. assumption.
-  case (N.odd a), (N.odd a'); auto.
+  intros.
+  enough (N.odd a = N.odd a' \/ N.odd a = negb (N.odd a')) as [].
+  - right. apply Ndiv2_bit_neq; assumption.
+  - left. assumption.
+  - case (N.odd a), (N.odd a'); auto.
 Qed.
 
 Lemma Ndouble_or_double_plus_un a :
-- 
cgit v1.2.3