Theorems · Theorem · order theory
Set.iInter_ite
∀ {α : Type u_1} {ι : Sort u_5} (p : ι → Prop) [inst : DecidablePred p] (f g : ι → Set α),
(⋂ i, if p i then f i else g i) = (⋂ i, ⋂ (_ : p i), f i) ∩ ⋂ i, ⋂ (_ : ¬p i), g i- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidablePred
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
- Set.iInter_diteproof · cited by 2
Cited by3
Results whose statement or proof uses this declaration.
- ProbabilityTheory.iIndepFun_iff_map_fun_eq_pi_mapproof · cited by 6
- ProbabilityTheory.cond_iInterproof · cited by 1
- ProbabilityTheory.Kernel.iIndepFun.cond_iInterproof · cited by 0