Kills the useless tactic annotations "in |- *"

 Most of these heavyweight annotations were introduced a long time ago
 by the automatic 7.x -> 8.0 translator

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@15518 85f007b7-540e-0410-9357-904b9bb8a0f7

1 files changed, 9 insertions, 9 deletions

diff --git a/theories/Arith/Euclid.v b/theories/Arith/Euclid.v
index 513fd1108..6dd0272a8 100644
--- a/theories/Arith/Euclid.v
+++ b/theories/Arith/Euclid.v
@@ -19,16 +19,16 @@ Inductive diveucl a b : Set :=
 
 Lemma eucl_dev : forall n, n > 0 -> forall m:nat, diveucl m n.
 Proof.
-  intros b H a; pattern a in |- *; apply gt_wf_rec; intros n H0.
+  intros b H a; pattern a; apply gt_wf_rec; intros n H0.
   elim (le_gt_dec b n).
   intro lebn.
   elim (H0 (n - b)); auto with arith.
   intros q r g e.
-  apply divex with (S q) r; simpl in |- *; auto with arith.
+  apply divex with (S q) r; simpl; auto with arith.
   elim plus_assoc.
   elim e; auto with arith.
   intros gtbn.
-  apply divex with 0 n; simpl in |- *; auto with arith.
+  apply divex with 0 n; simpl; auto with arith.
 Defined.
 
 Lemma quotient :
@@ -36,17 +36,17 @@ Lemma quotient :
     n > 0 ->
     forall m:nat, {q : nat |  exists r : nat, m = q * n + r /\ n > r}.
 Proof.
-  intros b H a; pattern a in |- *; apply gt_wf_rec; intros n H0.
+  intros b H a; pattern a; apply gt_wf_rec; intros n H0.
   elim (le_gt_dec b n).
   intro lebn.
   elim (H0 (n - b)); auto with arith.
   intros q Hq; exists (S q).
   elim Hq; intros r Hr.
-  exists r; simpl in |- *; elim Hr; intros.
+  exists r; simpl; elim Hr; intros.
   elim plus_assoc.
   elim H1; auto with arith.
   intros gtbn.
-  exists 0; exists n; simpl in |- *; auto with arith.
+  exists 0; exists n; simpl; auto with arith.
 Defined.
 
 Lemma modulo :
@@ -54,15 +54,15 @@ Lemma modulo :
     n > 0 ->
     forall m:nat, {r : nat |  exists q : nat, m = q * n + r /\ n > r}.
 Proof.
-  intros b H a; pattern a in |- *; apply gt_wf_rec; intros n H0.
+  intros b H a; pattern a; apply gt_wf_rec; intros n H0.
   elim (le_gt_dec b n).
   intro lebn.
   elim (H0 (n - b)); auto with arith.
   intros r Hr; exists r.
   elim Hr; intros q Hq.
-  elim Hq; intros; exists (S q); simpl in |- *.
+  elim Hq; intros; exists (S q); simpl.
   elim plus_assoc.
   elim H1; auto with arith.
   intros gtbn.
-  exists n; exists 0; simpl in |- *; auto with arith.
+  exists n; exists 0; simpl; auto with arith.
 Defined.