Theorems · Theorem · general topology
Filter.HasBasis.mem_iff
∀ {α : Type u_1} {ι : Sort u_4} {l : Filter α} {p : ι → Prop} {s : ι → Set α} {t : Set α},
l.HasBasis p s → (t ∈ l ↔ ∃ i, p i ∧ s i ⊆ t)Definition of HasBasis unfolded with implicit set argument.
- Defined in
- Mathlib.Order.Filter.Bases.Basic
- Cited by
- 193 results in Mathlib
- Foundations
- Depth 7 from the axioms, rests on 17 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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.HasBasis.mem_iff'proof · cited by 9
Cited by193
Results whose statement or proof uses this declaration.
- Filter.HasBasis.comapproof · cited by 89
- mem_nhds_iffproof · cited by 67
- Filter.HasBasis.mapproof · cited by 51
- Filter.HasBasis.to_hasBasisproof · cited by 40
- Filter.HasBasis.eventually_iffproof · cited by 38
- mem_nhdsWithinproof · cited by 29
- Filter.HasBasis.ge_iffproof · cited by 28
- Filter.HasBasis.le_basis_iffproof · cited by 28
- Metric.mem_nhds_iffproof · cited by 26
- Filter.mem_atTop_setsproof · cited by 21
- Filter.HasBasis.prod_selfproof · cited by 19
- Filter.HasBasis.inf_principalproof · cited by 18