Skip to main content
fpvandoorn/carleson
Source indexedlemma Β· leanprover/lean4:v4.32.0

urel_of_not_disjoint

Carleson.Discrete.ForestUnion Β· Carleson/Discrete/ForestUnion.lean:208 to 232

Source documentation

Helper for 5.4.2 that is also used in 5.4.9.

Exact Lean statement

lemma urel_of_not_disjoint {x y : 𝔓 X} (my : y ∈ π”˜β‚‚ k n j) (xye : π“˜ x = π“˜ y)
    (nd : Β¬Disjoint (ball_(x) (𝒬 x) 100) (ball_(y) (𝒬 y) 100)) : URel k n j y x

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma urel_of_not_disjoint {x y : 𝔓 X} (my : y ∈ π”˜β‚‚ k n j) (xye : π“˜ x = π“˜ y)    (nd : Β¬Disjoint (ball_(x) (𝒬 x) 100) (ball_(y) (𝒬 y) 100)) : URel k n j y x := by  rw [not_disjoint_iff] at nd  obtain ⟨(Ο‘ : Θ X), (Ο‘x : Ο‘ ∈ ball_{π“˜ x} (𝒬 x) 100), (Ο‘y : Ο‘ ∈ ball_{π“˜ y} (𝒬 y) 100)⟩ := nd  rw [π”˜β‚‚, mem_setOf, not_disjoint_iff] at my; obtain ⟨p, hp, _⟩ := my.2  suffices w : ball_(x) (𝒬 x) 1 βŠ† ball_(y) (𝒬 y) 500 by    right; use p, hp; obtain ⟨_, np, sl⟩ := hp    have hpy : smul 10 p ≀ smul 500 y :=      (smul_mono_left (by norm_num)).trans (wiggle_order_500 sl np)    exact ⟨(xye β–Έ sl.1 : π“˜ p ≀ π“˜ x), hpy.2.trans w⟩  intro (q : Θ X) (mq : q ∈ ball_{π“˜ x} (𝒬 x) 1)  calc    _ ≀ dist_(y) q Ο‘ + dist_(y) Ο‘ (𝒬 y) := dist_triangle ..    _ ≀ dist_(y) q (𝒬 x) + dist_(y) Ο‘ (𝒬 x) + dist_(y) Ο‘ (𝒬 y) := by      gcongr; apply dist_triangle_right    _ < 1 + 100 + 100 := by      have hΟ‘y : dist_(y) Ο‘ (𝒬 y) < 100 := Ο‘y      have hc : 𝔠 x = 𝔠 y := congr_arg c xye      have hs : 𝔰 x = 𝔰 y := congr_arg s xye      gcongr      Β· rw [← hc, ← hs]        exact mq      Β· rw [← hc, ← hs]        exact mem_ball.mp Ο‘x    _ < _ := by norm_num