Theorems · Theorem · order theory
Set.iInter_eq_univ
∀ {α : Type u_1} {ι : Sort u_5} {s : ι → Set α}, ⋂ i, s i = Set.univ ↔ ∀ (i : ι), s i = Set.univ- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
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
- Set.univstatement · cited by 3,945
- Set.iInterstatement · cited by 1,084
- iInf_eq_topproof · cited by 10
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.