From 9043add656177eeac1491a73d2f3ab92bec0013c Mon Sep 17 00:00:00 2001
From: Benjamin Barenblat <bbaren@debian.org>
Date: Sat, 29 Dec 2018 14:31:27 -0500
Subject: Imported Upstream version 8.8.2

---
 theories/FSets/FMapPositive.v | 24 +++++++++++++-----------
 1 file changed, 13 insertions(+), 11 deletions(-)

(limited to 'theories/FSets/FMapPositive.v')

diff --git a/theories/FSets/FMapPositive.v b/theories/FSets/FMapPositive.v
index b1c0fdaa..0fc68b14 100644
--- a/theories/FSets/FMapPositive.v
+++ b/theories/FSets/FMapPositive.v
@@ -1,10 +1,12 @@
-(***********************************************************************)
-(*  v      *   The Coq Proof Assistant  /  The Coq Development Team    *)
-(* <O___,, *        INRIA-Rocquencourt  &  LRI-CNRS-Orsay              *)
-(*   \VV/  *************************************************************)
-(*    //   *      This file is distributed under the terms of the      *)
-(*         *       GNU Lesser General Public License Version 2.1       *)
-(***********************************************************************)
+(************************************************************************)
+(*         *   The Coq Proof Assistant / The Coq Development Team       *)
+(*  v      *   INRIA, CNRS and contributors - Copyright 1999-2018       *)
+(* <O___,, *       (see CREDITS file for the list of authors)           *)
+(*   \VV/  **************************************************************)
+(*    //   *    This file is distributed under the terms of the         *)
+(*         *     GNU Lesser General Public License Version 2.1          *)
+(*         *     (see LICENSE file for the text of the license)         *)
+(************************************************************************)
 
 (** * FMapPositive : an implementation of FMapInterface for [positive] keys. *)
 
@@ -654,19 +656,19 @@ Module PositiveMap <: S with Module E:=PositiveOrderedTypeBits.
 
   Lemma xelements_bits_lt_1 : forall p p0 q m v,
      List.In (p0,v) (xelements m (append p (xO q))) -> E.bits_lt p0 p.
-  Proof.
+  Proof using.
   intros.
   generalize (xelements_complete _ _ _ _ H); clear H; intros.
-  revert p0 q m v H.
+  revert p0 H.
   induction p; destruct p0; simpl; intros; eauto; try discriminate.
   Qed.
 
   Lemma xelements_bits_lt_2 : forall p p0 q m v,
      List.In (p0,v) (xelements m (append p (xI q))) -> E.bits_lt p p0.
-  Proof.
+  Proof using.
   intros.
   generalize (xelements_complete _ _ _ _ H); clear H; intros.
-  revert p0 q m v H.
+  revert p0 H.
   induction p; destruct p0; simpl; intros; eauto; try discriminate.
   Qed.
 
-- 
cgit v1.2.3