Theorems · Theorem · order theory
Set.sUnion_eq_univ_iff
∀ {α : Type u_1} {c : Set (Set α)}, ⋃₀ c = Set.univ ↔ ∀ (a : α), ∃ b ∈ c, a ∈ b- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- Set.univstatement · cited by 3,945
- Set.sUnionstatement · cited by 392
Cited by8
Results whose statement or proof uses this declaration.
- TopologicalSpace.IsTopologicalBasis.of_hasBasis_nhdsproof · cited by 6
- MeasureTheory.Measure.ext_of_Ico'proof · cited by 2
- Filter.isTopologicalBasis_Iic_principalproof · cited by 1
- MeasureTheory.Measure.ext_of_Icc'proof · cited by 1
- Topology.IsLower.isTopologicalSpace_basisproof · cited by 1
- Bornology.sUnion_bounded_univproof · cited by 0
- pi_generateFrom_eq_finiteproof · cited by 0
- Set.sUnion_finite_eq_univproof · cited by 0