Theorems · Theorem · order theory
Set.subset_iInter
∀ {β : Type u_2} {ι : Sort u_5} {t : Set β} {s : ι → Set β}, (∀ (i : ι), t ⊆ s i) → t ⊆ ⋂ i, s i- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 17 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.
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.iInterstatement · cited by 1,084
- le_iInfproof · cited by 102
Cited by17
Results whose statement or proof uses this declaration.
- Set.subset_iInter₂proof · cited by 9
- MeasureTheory.OuterMeasure.exists_measurable_superset_eq_trimproof · cited by 4
- MeasureTheory.OuterMeasure.exists_measurable_superset_forall_eq_trimproof · cited by 3
- interior_iInterproof · cited by 2
- MeasureTheory.hahn_decompositionproof · cited by 2
- Perfect.subset_perfectKernelproof · cited by 1
- CantorBendixson.perfectKernel_eq_iteratedDerivedSet_of_mem_fixedPointsproof · cited by 1
- MeasureTheory.Measure.measure_toMeasurable_inter_of_sumproof · cited by 1
- connectedComponent_subset_iInter_isClopenproof · cited by 1
- interior_iInter_subsetproof · cited by 1
- Set.iInter_mono'proof · cited by 1