Theorems · Theorem · order theory
Set.inter_biInter
∀ {ι : Type u_12} {α : Type u_13} {s : Set ι},
s.Nonempty → ∀ (f : ι → Set α) (t : Set α), ⋂ i ∈ s, t ∩ f i = t ∩ ⋂ i ∈ s, f i- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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.Nonemptystatement and proof · cited by 2,627
- Set.iInterstatement and proof · cited by 1,084
- Set.inter_commproof · cited by 291
- Set.iInter_congr_Propproof · cited by 170
- Set.biInter_interproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.