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

ordConnected_C1

Carleson.Discrete.ForestUnion Β· Carleson/Discrete/ForestUnion.lean:48 to 65

Source documentation

Lemma 5.3.6

Exact Lean statement

lemma ordConnected_C1 : OrdConnected (ℭ₁ k n j : Set (𝔓 X))

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma ordConnected_C1 : OrdConnected (ℭ₁ k n j : Set (𝔓 X)) := by  rw [ordConnected_def]; intro p mp p'' mp'' p' mp'  have mp'₁ : p' ∈ β„­ (X := X) k n := mem_of_mem_of_subset mp'    (ordConnected_C.out (mem_of_mem_of_subset mp ℭ₁_subset_β„­)      (mem_of_mem_of_subset mp'' ℭ₁_subset_β„­))  simp_rw [ℭ₁, mem_sdiff, preℭ₁, mem_setOf, not_and, not_le] at mp mp'' ⊒  simp_rw [mp.1.1, true_and, true_implies] at mp  simp_rw [mp'₁, true_and, true_implies]  simp_rw [mp''.1.1, true_and, true_implies] at mp''  constructor  Β· refine mp''.1.trans (Finset.card_le_card fun b mb ↦ ?_)    simp_rw [Finset.mem_filter_univ, 𝔅, mem_setOf] at mb ⊒    have h100 := wiggle_order_11_10 (n := 100) mp'.2 (C5_3_3_le (X := X).trans (by norm_num))    exact ⟨mb.1, h100.trans mb.2⟩  Β· refine (Finset.card_le_card fun b mb ↦ ?_).trans_lt mp.2    simp_rw [Finset.mem_filter_univ, 𝔅, mem_setOf] at mb ⊒    have h100 := wiggle_order_11_10 (n := 100) mp'.1 (C5_3_3_le (X := X).trans (by norm_num))    exact ⟨mb.1, h100.trans mb.2⟩