chore(*): update to lean 3.36.0 (#11253)

The main breaking change is the change in elaboration of double membership binders into x hx y hy, from x y hx hy.




Co-authored-by: Yury G. Kudryashov <urkud@urkud.name>

Author: ericrbg

archive/imo/imo1994_q1.lean

@@ -85,7 +85,7 @@ begin
     rcases hx with ⟨i, ⟨hi, rfl⟩⟩,
     have h1 : a i + a (fin.last m - k) ≤ n,
     { linarith only [h, a.monotone hi.2] },
-    have h2 : a i + a (fin.last m - k) ∈ A := hadd _ _ (ha _) (ha _) h1,
+    have h2 : a i + a (fin.last m - k) ∈ A := hadd _ (ha _) _ (ha _) h1,
     rw [←mem_coe, ←range_order_emb_of_fin A hm, set.mem_range] at h2,
     cases h2 with j hj,
     use j,

archive/imo/imo2021_q1.lean

@@ -143,7 +143,7 @@ begin
     { rw [finset.mem_insert, finset.mem_singleton, finset.mem_singleton],
       push_neg,
       exact ⟨⟨hab.ne, (hab.trans hbc).ne⟩, hbc.ne⟩ } },
-  { intros x y hx hy hxy,
+  { intros x hx y hy hxy,
     simp only [finset.mem_insert, finset.mem_singleton] at hx hy,
     rcases hx with rfl|rfl|rfl; rcases hy with rfl|rfl|rfl,
     all_goals { contradiction <|> assumption <|> simpa only [add_comm x y], } },
@@ -177,5 +177,5 @@ begin
   simp only [finset.subset_iff, finset.mem_inter] at hCA,
   -- Now we split into the two cases C ⊆ [n, 2n] \ A and C ⊆ A, which can be dealt with identically.
   cases hCA; [right, left];
-  exact ⟨a, b, (hCA ha).2, (hCA hb).2, hab, h₁ a b (hCA ha).1 (hCA hb).1 hab⟩,
+  exact ⟨a, (hCA ha).2, b, (hCA hb).2, hab, h₁ a (hCA ha).1 b (hCA hb).1 hab⟩,
 end

leanpkg.toml

@@ -1,7 +1,7 @@
 [package]
 name = "mathlib"
 version = "0.1"
-lean_version = "leanprover-community/lean:3.35.1"
+lean_version = "leanprover-community/lean:3.36.0"
 path = "src"
 
 [dependencies]

src/algebra/lie/solvable.lean

@@ -261,19 +261,15 @@ instance radical_is_solvable [is_noetherian R L] : is_solvable R (radical R L) :
 begin
   have hwf := lie_submodule.well_founded_of_noetherian R L L,
   rw ← complete_lattice.is_sup_closed_compact_iff_well_founded at hwf,
-  refine hwf { I : lie_ideal R L | is_solvable R I } _ _,
-  { use ⊥, exact lie_algebra.is_solvable_bot R L, },
-  { intros I J hI hJ, apply lie_algebra.is_solvable_add R L; [exact hI, exact hJ], },
+  refine hwf { I : lie_ideal R L | is_solvable R I } ⟨⊥, _⟩ (λ I hI J hJ, _),
+  { exact lie_algebra.is_solvable_bot R L, },
+  { apply lie_algebra.is_solvable_add R L, exacts [hI, hJ] },
 end
 
 /-- The `→` direction of this lemma is actually true without the `is_noetherian` assumption. -/
 lemma lie_ideal.solvable_iff_le_radical [is_noetherian R L] (I : lie_ideal R L) :
   is_solvable R I ↔ I ≤ radical R L :=
-begin
-  split; intros h,
-  { exact le_Sup h, },
-  { apply le_solvable_ideal_solvable h, apply_instance, },
-end
+⟨λ h, le_Sup h, λ h, le_solvable_ideal_solvable h infer_instance⟩
 
 lemma center_le_radical : center R L ≤ radical R L :=
 have h : is_solvable R (center R L), { apply_instance, }, le_Sup h

src/algebraic_geometry/prime_spectrum/basic.lean

@@ -349,7 +349,7 @@ topological_space.of_closed (set.range prime_spectrum.zero_locus)
     simp only [hf],
     exact ⟨_, zero_locus_Union _⟩
   end
-  (by { rintro _ _ ⟨s, rfl⟩ ⟨t, rfl⟩, exact ⟨_, (union_zero_locus s t).symm⟩ })
+  (by { rintro _ ⟨s, rfl⟩ _ ⟨t, rfl⟩, exact ⟨_, (union_zero_locus s t).symm⟩ })
 
 lemma is_open_iff (U : set (prime_spectrum R)) :
   is_open U ↔ ∃ s, Uᶜ = zero_locus s :=

src/algebraic_geometry/properties.lean

@@ -207,7 +207,9 @@ begin
       exact H } },
   { intros R hX s hs x,
     erw [basic_open_eq_of_affine', prime_spectrum.basic_open_eq_bot_iff] at hs,
-    replace hs := (hs.map (Spec_Γ_identity.app R).inv).eq_zero,
+    replace hs := (hs.map (Spec_Γ_identity.app R).inv),
+    -- what the hell?!
+    replace hs := @is_nilpotent.eq_zero _ _ _ _ (show _, from _) hs,
     rw coe_hom_inv_id at hs,
     rw [hs, map_zero],
     exact @@is_reduced.component_reduced hX ⊤ }

src/algebraic_geometry/structure_sheaf.lean

@@ -694,7 +694,7 @@ begin
   refine ⟨(λ i, a i * (h i) ^ N), (λ i, (h i) ^ (N + 1)),
     (λ i, eq_to_hom (basic_opens_eq i) ≫ iDh i), _, _, _⟩,
   { simpa only [basic_opens_eq] using h_cover },
-  { intros i j hi hj,
+  { intros i hi j hj,
     -- Here we need to show that our new fractions `a i / h i` satisfy the normalization condition
     -- Of course, the power `N` we used to expand the fractions might be bigger than the power
     -- `n (i, j)` which was originally chosen. We denote their difference by `k`
@@ -795,7 +795,7 @@ begin
   rw [← hb, finset.sum_mul, finset.mul_sum],
   apply finset.sum_congr rfl,
   intros j hj,
-  rw [mul_assoc, ah_ha j i hj hi],
+  rw [mul_assoc, ah_ha j hj i hi],
   ring
 end
 

src/analysis/ODE/gronwall.lean

@@ -165,9 +165,8 @@ begin
   assume t ht,
   have := dist_triangle4_right (f' t) (g' t) (v t (f t)) (v t (g t)),
   rw [dist_eq_norm] at this,
-  apply le_trans this,
-  apply le_trans (add_le_add (add_le_add (f_bound t ht) (g_bound t ht))
-    (hv t (f t) (g t) (hfs t ht) (hgs t ht))),
+  refine this.trans ((add_le_add (add_le_add (f_bound t ht) (g_bound t ht))
+    (hv t (f t) (hfs t ht) (g t) (hgs t ht))).trans _),
   rw [dist_eq_norm, add_comm]
 end
 
@@ -188,7 +187,7 @@ theorem dist_le_of_approx_trajectories_ODE {v : ℝ → E → E}
   (ha : dist (f a) (g a) ≤ δ) :
   ∀ t ∈ Icc a b, dist (f t) (g t) ≤ gronwall_bound δ K (εf + εg) (t - a) :=
 have hfs : ∀ t ∈ Ico a b, f t ∈ (@univ E), from λ t ht, trivial,
-dist_le_of_approx_trajectories_ODE_of_mem_set (λ t x y hx hy, (hv t).dist_le_mul x y)
+dist_le_of_approx_trajectories_ODE_of_mem_set (λ t x hx y hy, (hv t).dist_le_mul x y)
   hf hf' f_bound hfs hg hg' g_bound (λ t ht, trivial) ha
 
 /-- If `f` and `g` are two exact solutions of the same ODE, then the distance between them
@@ -234,7 +233,7 @@ theorem dist_le_of_trajectories_ODE {v : ℝ → E → E}
   (ha : dist (f a) (g a) ≤ δ) :
   ∀ t ∈ Icc a b, dist (f t) (g t) ≤ δ * exp (K * (t - a)) :=
 have hfs : ∀ t ∈ Ico a b, f t ∈ (@univ E), from λ t ht, trivial,
-dist_le_of_trajectories_ODE_of_mem_set (λ t x y hx hy, (hv t).dist_le_mul x y)
+dist_le_of_trajectories_ODE_of_mem_set (λ t x hx y hy, (hv t).dist_le_mul x y)
   hf hf' hfs hg hg' (λ t ht, trivial) ha
 
 /-- There exists only one solution of an ODE \(\dot x=v(t, x)\) in a set `s ⊆ ℝ × E` with
@@ -270,5 +269,5 @@ theorem ODE_solution_unique {v : ℝ → E → E}
   (ha : f a = g a) :
   ∀ t ∈ Icc a b, f t = g t :=
 have hfs : ∀ t ∈ Ico a b, f t ∈ (@univ E), from λ t ht, trivial,
-ODE_solution_unique_of_mem_set (λ t x y hx hy, (hv t).dist_le_mul x y)
+ODE_solution_unique_of_mem_set (λ t x hx y hy, (hv t).dist_le_mul x y)
   hf hf' hfs hg hg' (λ t ht, trivial) ha

src/analysis/analytic/basic.lean

@@ -565,7 +565,7 @@ lemma has_fpower_series_on_ball.image_sub_sub_deriv_le
   ∃ C, ∀ (y z ∈ emetric.ball x r'),
     ∥f y - f z - (p 1 (λ _, y - z))∥ ≤ C * (max ∥y - x∥ ∥z - x∥) * ∥y - z∥ :=
 by simpa only [is_O_principal, mul_assoc, normed_field.norm_mul, norm_norm, prod.forall,
-  emetric.mem_ball, prod.edist_eq, max_lt_iff, and_imp]
+  emetric.mem_ball, prod.edist_eq, max_lt_iff, and_imp, @forall_swap (_ < _) E]
   using hf.is_O_image_sub_image_sub_deriv_principal hr
 
 /-- If `f` has formal power series `∑ n, pₙ` at `x`, then

src/analysis/box_integral/basic.lean

@@ -658,7 +658,7 @@ begin
     have : 0 ≤ μ.to_box_additive J, from ennreal.to_real_nonneg,
     rw [norm_smul, real.norm_eq_abs, abs_of_nonneg this, ← dist_eq_norm],
     refine mul_le_mul_of_nonneg_left _ this,
-    refine Hδ _ _ (tagged_prepartition.tag_mem_Icc _ _) (tagged_prepartition.tag_mem_Icc _ _) _,
+    refine Hδ _ (tagged_prepartition.tag_mem_Icc _ _) _ (tagged_prepartition.tag_mem_Icc _ _) _,
     rw [← add_halves δ],
     refine (dist_triangle_left _ _ J.upper).trans (add_le_add (h₁.1 _ _ _) (h₂.1 _ _ _)),
     { exact prepartition.bUnion_index_mem _ hJ },