Theorems · Theorem · order theory
Set.iInter_subtype
∀ {α : Type u_1} {β : Type u_2} (p : α → Prop) (s : { x // p x } → Set β), ⋂ x, s x = ⋂ x, ⋂ (hx : p x), s ⟨x, hx⟩- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 9 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
- iInf_subtypeproof · cited by 12
Cited by9
Results whose statement or proof uses this declaration.
- Set.iInter_coe_setproof · cited by 17
- Filter.HasBasis.iInfproof · cited by 3
- LocallyFinite.iInter_compl_mem_nhdsproof · cited by 2
- isExtreme_biInterproof · cited by 1
- Convexity.convexHull_eq_iInterproof · cited by 1
- convexHull_eq_iInterproof · cited by 1
- absConvexHull_eq_iInterproof · cited by 1
- RCLike.iInter_countable_halfSpaces_eqproof · cited by 0
- Convexity.subset_convexHull_iffproof · cited by 0