Theorems · Theorem · general topology
Filter.mem_cardinalGenerate_iff
∀ {α : Type u} {c : Cardinal.{u}} {g : Set (Set α)} {s : Set α} {hreg : c.IsRegular},
s ∈ Filter.cardinalGenerate g ⋯ ↔ ∃ S ⊆ g, Cardinal.mk ↑S < c ∧ ⋂₀ S ⊆ sA set is in the cardinalInterFilter generated by g if and only if
it contains an intersection of c elements of g.
- Defined in
- Mathlib.Order.Filter.CardinalInter
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 104 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites29
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 · cited by 8,121
- Set.Elemstatement and proof · cited by 7,166
- Set.univproof · cited by 3,945
- Cardinalstatement and proof · cited by 2,598
- Nat.cast_oneproof · cited by 2,501
- Set.iUnionproof · cited by 2,483
- Cardinal.mkstatement and proof · cited by 942
- Filter.mem_of_supersetproof · cited by 308
- Cardinal.IsRegularstatement and proof · cited by 282
- Set.sInterstatement and proof · cited by 225
- Set.singleton_subset_iffproof · cited by 206
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.