Theorems · Theorem · order theory
Set.iInter_univ
∀ {α : Type u_1} {ι : Sort u_5}, ⋂ x, Set.univ = Set.univ- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 24 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 · cited by 53,352
- Set.univstatement · cited by 3,945
- Set.iInterstatement · cited by 1,084
- iInf_topproof · cited by 21
Cited by24
Results whose statement or proof uses this declaration.
- Filter.biInter_memproof · cited by 22
- ProbabilityTheory.iIndepFun.isProbabilityMeasureproof · cited by 14
- ProbabilityTheory.iIndepFun_iff_map_fun_eq_pi_mapproof · cited by 6
- Set.Finite.interior_biInterproof · cited by 5
- ProbabilityTheory.Kernel.iIndepSets.iIndepproof · cited by 4
- Filter.iInf_principal_finsetproof · cited by 3
- ProbabilityTheory.Kernel.iIndepSets.ae_isProbabilityMeasureproof · cited by 3
- Dynamics.dynEntourage_univproof · cited by 2
- Dynamics.dynEntourage_zeroproof · cited by 2
- isGδ_iff_eq_iInter_natproof · cited by 2
- IsCompactSystem.insert_univproof · cited by 2
- TopCat.isTopologicalBasis_cofiltered_limitproof · cited by 1