Skip to main content
fpvandoorn/carleson
Source indexedlemma ยท leanprover/lean4:v4.32.0

pairwiseDisjoint_๐”˜โ‚„

Carleson.Discrete.ForestUnion ยท Carleson/Discrete/ForestUnion.lean:622 to 633

Mathematical statement

Exact Lean statement

lemma pairwiseDisjoint_๐”˜โ‚„ : univ.PairwiseDisjoint (๐”˜โ‚„ (X := X) k n j)

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma pairwiseDisjoint_๐”˜โ‚„ : univ.PairwiseDisjoint (๐”˜โ‚„ (X := X) k n j) := by  intro l hl m hm hml  apply disjoint_iff_forall_ne.2 (fun x hx y hy โ†ฆ ?_)  simp only [๐”˜โ‚„, mem_Ico, mem_iUnion, exists_prop] at hx hy  rcases hx with โŸจa, โŸจha, h'aโŸฉ, xaโŸฉ  rcases hy with โŸจb, โŸจhb, h'bโŸฉ, ybโŸฉ  have h : a โ‰  b := by    rcases lt_or_gt_of_ne hml with h | h    ยท exact (h'a.trans_le (le_trans (mul_le_mul' h le_rfl) hb)).ne    ยท exact (h'b.trans_le (le_trans (mul_le_mul' h le_rfl) ha)).ne'  have := pairwiseDisjoint_iteratedMaximalSubfamily (๐”˜โ‚ƒ (X := X) k n j) (mem_univ a) (mem_univ b) h  exact disjoint_iff_forall_ne.1 this xa yb