Theorems · Theorem · general topology
Filter.HasBasis.frequently_smallSets
∀ {α : Type u_4} {ι : Sort u_5} {p : ι → Prop} {l : Filter α} {s : ι → Set α} {q : Set α → Prop} {hl : l.HasBasis p s},
(∀ ⦃s t : Set α⦄, s ⊆ t → q s → q t) → ((∃ᶠ (s : Set α) in l.smallSets, q s) ↔ ∀ (i : ι), p i → q (s i))- Defined in
- Mathlib.Order.Filter.SmallSets
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Filterstatement and proof · cited by 8,121
- Filter.HasBasisstatement and proof · cited by 604
- Filter.Frequentlystatement · cited by 414
- Filter.smallSetsstatement · cited by 89
- Filter.HasBasis.forall_iffproof · cited by 15
- Filter.frequently_smallSets'proof · cited by 1
Cited by5
Results whose statement or proof uses this declaration.
- Filter.HasBasis.mem_measureSupportproof · cited by 6
- MeasureTheory.Measure.mem_support_restrictproof · cited by 1
- Distribution.mem_dsupport_iff_frequentlyproof · cited by 1
- Filter.HasBasis.mem_dsupportproof · cited by 1
- MeasureTheory.Measure.interior_inter_supportproof · cited by 0