Theorems · Theorem · combinatorics
Finset.univ_pi_univ
∀ {α : Type u_3} {β : α → Type u_4} [inst : DecidableEq α] [inst_1 : Fintype α] [inst_2 : (a : α) → Fintype (β a)],
(Finset.univ.pi fun a => Finset.univ) = Finset.univ- Defined in
- Mathlib.Data.Fintype.Pi
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintypeFintype
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.
- Finsetstatement · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Finset.univstatement and proof · cited by 3,473
- Finset.extproof · cited by 565
- Finset.pistatement · cited by 23
Cited by1
Results whose statement or proof uses this declaration.
- Matrix.det_blockDiagonalproof · cited by 4