Update imo_proofs/imo_1985_p6.lean

imo_proofs/imo_1985_p6.lean

@@ -1,6 +1,5 @@
 import Mathlib
 
-set_option linter.unusedVariables.analyzeTactics true
 
 lemma aux_1
   (f : ℕ → NNReal → ℝ)
@@ -1318,6 +1317,7 @@ lemma imo_1985_p6_nnreal
     exact aux_unique f h₁ hmo₀ h₇ x y hx₀ hy₀
 
 
+
 theorem imo_1985_p6
   (f : ℕ → ℝ → ℝ)
   (h₀ : ∀ x, f 1 x = x)
@@ -1325,7 +1325,7 @@ theorem imo_1985_p6
   ∃! a, ∀ n, 0 < n → 0 < f n a ∧ f n a < f (n + 1) a ∧ f (n + 1) a < 1 := by
   let fn : ℕ → NNReal → ℝ := fun n x => f n x
   have hfn₁: ∀ n x, 0 < n → 0 ≤ x → fn n x = f n x := by
-    exact fun n x a a ↦ rfl
+    exact fun n x _ _ ↦ rfl
   have h₂: ∃! a, ∀ (n : ℕ), 0 < n → 0 < fn n a ∧ fn n a < fn (n + 1) a ∧ fn (n + 1) a < 1 := by
     exact imo_1985_p6_nnreal fn (fun x ↦ h₀ ↑x) fun n x ↦ h₁ n ↑x
   obtain ⟨a, ha₀, ha₁⟩ := h₂
@@ -1353,4 +1353,3 @@ theorem imo_1985_p6
         exact (hy₀ 1 (by decide)).1
       have hy₅: (0:ℝ) < 0 := by exact lt_trans hy₄ hy₃
       exact (lt_self_iff_false 0).mp hy₅
-