Theorems · Theorem · order theory
Set.iInter_iInter_eq_right
∀ {α : Type u_1} {β : Type u_2} {b : β} {s : (x : β) → b = x → Set α}, ⋂ x, ⋂ (h : b = x), s x h = s b ⋯- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 17 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_iInf_eq_rightproof · cited by 3
Cited by17
Results whose statement or proof uses this declaration.
- Subfield.coe_sInfproof · cited by 5
- ProbabilityTheory.Kernel.iIndepSets.precompproof · cited by 4
- LieSubalgebra.coe_sInfproof · cited by 2
- Algebra.sInf_toSubsemiringproof · cited by 2
- IntermediateField.sInf_toSubalgebraproof · cited by 2
- IntermediateField.sInf_toSubfieldproof · cited by 1
- compactSpace_generateFrom_of_compl_memproof · cited by 0
- Set.sInter_prodproof · cited by 0
- Submodule.coe_torsionBySetproof · cited by 0
- NonUnitalAlgebra.sInf_toNonUnitalSubsemiringproof · cited by 0
- NonUnitalAlgebra.sInf_toSubmoduleproof · cited by 0
- Algebra.sInf_toSubmoduleproof · cited by 0