Theorems · Theorem · order theory
Set.iInter_and
∀ {α : Type u_1} {p q : Prop} (s : p ∧ q → Set α), ⋂ (h : p ∧ q), s h = ⋂ (hp : p), ⋂ (hq : q), s ⋯- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 8 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_andproof · cited by 15
Cited by8
Results whose statement or proof uses this declaration.
- Set.biInter_and'proof · cited by 17
- Convexity.convexHull_eq_iInterproof · cited by 1
- convexHull_eq_iInterproof · cited by 1
- absConvexHull_eq_iInterproof · cited by 1
- Filter.sInter_lift_setsproof · cited by 1
- Convexity.subset_convexHull_iffproof · cited by 0
- Set.biInter_andproof · cited by 0
- Filter.mem_biInf_principalproof · cited by 0