fpvandoorn/carleson
Source indexedlemma Β· leanprover/lean4:v4.32.0
ordConnected_C2
Carleson.Discrete.ForestUnion Β· Carleson/Discrete/ForestUnion.lean:68 to 81
Source documentation
Lemma 5.3.7
Exact Lean statement
lemma ordConnected_C2 : OrdConnected (ββ k n j : Set (π X))
Complete declaration
Lean source
Full Lean sourceLean 4
lemma ordConnected_C2 : 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_C1.out mpβ (mem_of_mem_of_subset mp'' ββ_subset_ββ)) by_cases e : p = p'; Β· rwa [e] at mp simp_rw [ββ, layersAbove, mem_sdiff, mp'β, true_and] by_contra h; rw [mem_iUnionβ] at h; obtain β¨l', bl', p'mβ© := h rw [minLayer, mem_setOf, minimal_iff] at p'm have pnm : p β β l'', β (_ : l'' < l'), πβ k n j l'' := by replace mp := mp.2; contrapose! mp exact mem_of_mem_of_subset mp (iUnion_mono'' fun i β¦ iUnion_subset_iUnion_const fun hi β¦ (hi.trans_le bl').le) exact absurd (p'm.2 β¨mp.1, pnmβ© mp'.1).symm e