Theorems · Theorem · order theory
Set.iUnion_eq_univ_iff
∀ {α : Type u_1} {ι : Sort u_5} {f : ι → Set α}, ⋃ i, f i = Set.univ ↔ ∀ (x : α), ∃ i, x ∈ f i- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 19 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.iUnionstatement · cited by 2,483
Cited by19
Results whose statement or proof uses this declaration.
- CompactExhaustion.exists_memproof · cited by 5
- Metric.iUnion_ball_natproof · cited by 4
- Set.iUnion_Iicproof · cited by 3
- exists_mem_compactCoveringproof · cited by 3
- Metric.iUnion_closedBall_natproof · cited by 2
- Set.iUnion_Iciproof · cited by 2
- Set.iUnion_Iioproof · cited by 2
- Set.iUnion_Ioiproof · cited by 2
- TopologicalSpace.isTopologicalBasis_of_coverproof · cited by 2
- IsOpen.iUnion_smulproof · cited by 1
- IsOpen.iUnion_vaddproof · cited by 1
- Metric.iUnion_ball_nat_succproof · cited by 1