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

exists_smul_le_of_π”˜β‚ƒ

Carleson.Discrete.ForestUnion Β· Carleson/Discrete/ForestUnion.lean:487 to 494

Mathematical statement

Exact Lean statement

lemma exists_smul_le_of_π”˜β‚ƒ (u : π”˜β‚ƒ k n j) : βˆƒ m : 𝔐 (X := X) k n, smul 100 u.1 ≀ smul 1 m.1

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma exists_smul_le_of_π”˜β‚ƒ (u : π”˜β‚ƒ k n j) : βˆƒ m : 𝔐 (X := X) k n, smul 100 u.1 ≀ smul 1 m.1 := by  classical  obtain ⟨u, mu⟩ := u  replace mu := (π”˜β‚ƒ_subset_π”˜β‚‚.trans π”˜β‚‚_subset_π”˜β‚ |>.trans π”˜β‚_subset_ℭ₁) mu  rw [ℭ₁, mem_sdiff, preℭ₁, mem_setOf, filter_mem_univ_eq_toFinset] at mu  replace mu := (show 0 < 2 ^ j by positivity).trans_le mu.1.2  rw [Finset.card_pos] at mu; obtain ⟨m, hm⟩ := mu  rw [mem_toFinset, 𝔅] at hm; exact ⟨⟨m, hm.1⟩, hm.2⟩