Theorems · Theorem · order theory
Set.iUnion_univ_pi
∀ {α : Type u_1} {π : α → Type u_12} {ι : α → Type u_13} (t : (a : α) → ι a → Set (π a)),
(⋃ x, Set.univ.pi fun a => t a (x a)) = Set.univ.pi fun a => ⋃ j, t a j- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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.univstatement · cited by 3,945
- Set.iUnionstatement · cited by 2,483
- Set.extproof · cited by 2,266
- Set.pistatement · cited by 405
Cited by2
Results whose statement or proof uses this declaration.
- generateFrom_pi_eqproof · cited by 1
- IsCountablySpanning.piproof · cited by 0