Mathlib Map

Theorems · Theorem · order theory

Set.biInter_inter

∀ {ι : Type u_12} {α : Type u_13} {s : Set ι},
  s.Nonempty → ∀ (f : ι → Set α) (t : Set α), ⋂ i ∈ s, f i ∩ t = (⋂ i ∈ s, f i) ∩ t
Defined in
Mathlib.Data.Set.Lattice
Cited by
2 results in Mathlib
Foundations
Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Matroid.Indep.inter_isBasis_biInter · cited by 2Indep.inter_isBasis_biInt…Set.inter_biInter · cited by 0Set.inter_biInterSet · cited by 53352SetSet.Elem · cited by 7166Set.ElemSet.Nonempty · cited by 2627Set.NonemptySet.iInter · cited by 1084Set.iInterSet.Nonempty.to_subtype · cited by 55Nonempty.to_subtypeSet.biInter_eq_iInter · cited by 19Set.biInter_eq_iInterSet.biInter_interCITED BYCITES

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.