Skip to main content
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

Canonical 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