Theorems · Theorem · order theory
Finset.set_biInter_singleton
∀ {α : Type u_2} {β : Type u_3} (a : α) (s : α → Set β), ⋂ x ∈ {a}, s x = s a- Defined in
- Mathlib.Order.CompleteLattice.Finset
- Cited by
- 1 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.
Cites4
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
- Finsetstatement · cited by 13,712
- Set.iInterstatement · cited by 1,084
- Finset.iInf_singletonproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- ProbabilityTheory.Kernel.iIndepSets.indepSetsproof · cited by 3