Theorems · Theorem · order theory
Set.sInter_insert
∀ {α : Type u_1} (s : Set α) (T : Set (Set α)), ⋂₀ insert s T = s ∩ ⋂₀ T- 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.sInterstatement · cited by 225
- sInf_insertproof · cited by 4
Cited by8
Results whose statement or proof uses this declaration.
- Set.Finite.isOpen_sInterproof · cited by 6
- IsSemilinearSet.sInterproof · cited by 2
- FiniteInter.finiteInter_memproof · cited by 2
- IsClub.interproof · cited by 1
- IsPreirreducible.subset_irreducibleproof · cited by 1
- isIrreducible_iff_sInterproof · cited by 1
- Set.Finite.dense_sInterproof · cited by 1
- IsExposed.sInterproof · cited by 0