Theorems · Theorem · combinatorics
Fintype.coe_piFinset
∀ {α : Type u_1} [inst : DecidableEq α] [inst_1 : Fintype α] {δ : α → Type u_4} (t : (a : α) → Finset (δ a)),
↑(Fintype.piFinset t) = Set.univ.pi fun a => ↑(t a)- Defined in
- Mathlib.Data.Fintype.Pi
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement and proof · cited by 8,199
- Fintypestatement and proof · cited by 7,736
- Set.univstatement · cited by 3,945
- Set.extproof · cited by 2,266
- Set.pistatement · cited by 405
- Fintype.piFinsetstatement and proof · cited by 86
- Set.mem_univ_piproof · cited by 17
- Fintype.mem_piFinsetproof · cited by 9
Cited by1
Results whose statement or proof uses this declaration.
- Set.Finite.piproof · cited by 3