diff options
| author |  Stephane Glondu <steph@glondu.net> | 2013-05-08 18:01:07 +0200 |
|---|---|---|
| committer | Stephane Glondu <steph@glondu.net> | 2013-05-08 18:01:07 +0200 |
| commit | 095eac936751bab72e3c6bbdfa3ede51f7198721 (patch) | |
| tree | 44cf2859ba6b8486f056efaaf7ee6c2d855f2aae /theories/Arith/Even.v | |
| parent | 4e6d6dab2ef2de6c1ad7972fc981e55a4fde7ae3 (diff) | |
| parent | 0b14713e3efd7f8f1cc8a06555d0ec8fbe496130 (diff) | |
Merge branch 'experimental/master'
Diffstat (limited to 'theories/Arith/Even.v')
| -rw-r--r-- | theories/Arith/Even.v | 8 |
1 files changed, 3 insertions, 5 deletions
diff --git a/theories/Arith/Even.v b/theories/Arith/Even.v index 5bab97c2..4f679fe2 100644 --- a/theories/Arith/Even.v +++ b/theories/Arith/Even.v @@ -1,18 +1,16 @@ (************************************************************************) (* v * The Coq Proof Assistant / The Coq Development Team *) -(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2011 *) +(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2012 *) (* \VV/ **************************************************************) (* // * This file is distributed under the terms of the *) (* * GNU Lesser General Public License Version 2.1 *) (************************************************************************) -(*i $Id: Even.v 14641 2011-11-06 11:59:10Z herbelin $ i*) - (** Here we define the predicates [even] and [odd] by mutual induction and we prove the decidability and the exclusion of those predicates. The main results about parity are proved in the module Div2. *) -Open Local Scope nat_scope. +Local Open Scope nat_scope. Implicit Types m n : nat. @@ -147,7 +145,7 @@ Lemma even_mult_aux : forall n m, (odd (n * m) <-> odd n /\ odd m) /\ (even (n * m) <-> even n \/ even m). Proof. - intros n; elim n; simpl in |- *; auto with arith. + intros n; elim n; simpl; auto with arith. intros m; split; split; auto with arith. intros H'; inversion H'. intros H'; elim H'; auto. |