fpvandoorn/carleson
Source indexedlemma Β· leanprover/lean4:v4.32.0
ordConnected_C4
Carleson.Discrete.ForestUnion Β· Carleson/Discrete/ForestUnion.lean:95 to 108
Source documentation
Lemma 5.3.9
Exact Lean statement
lemma ordConnected_C4 : OrdConnected (ββ k n j : Set (π X))
Complete declaration
Lean source
Full Lean sourceLean 4
lemma ordConnected_C4 : OrdConnected (ββ k n j : Set (π X)) := by rw [ordConnected_def]; intro p mp p'' mp'' p' mp' have mp''β := mem_of_mem_of_subset mp'' ββ_subset_ββ have mp'β : p' β ββ (X := X) k n j := mem_of_mem_of_subset mp' (ordConnected_C3.out (mem_of_mem_of_subset mp ββ_subset_ββ) mp''β) by_cases e : p' = p''; Β· rwa [β e] at mp'' simp_rw [ββ, layersBelow, mem_sdiff, mp'β, true_and] by_contra h; simp_rw [mem_iUnion] at h; obtain β¨l', hl', p'mβ© := h rw [maxLayer_def, mem_setOf, maximal_iff] at p'm simp_rw [mem_sdiff] at p'm have p''nm : p'' β β l'', β (_ : l'' < l'), πβ k n j l'' := by replace mp'' := mp''.2; contrapose! mp'' refine mem_of_mem_of_subset mp'' <| iUnionβ_mono' fun i hi β¦ β¨i, hi.le.trans hl', subset_rflβ© exact absurd (p'm.2 β¨mp''β, p''nmβ© mp'.2) e