Theorems · Theorem · group theory
Finset.univ_pow
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : Monoid α] {n : ℕ} [inst_2 : Fintype α],
n ≠ 0 → Finset.univ ^ n = Finset.univ- Cited by
- 0 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqMonoidFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Finsetstatement · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Fintypestatement and proof · cited by 7,736
- Set.univproof · cited by 3,945
- Monoidstatement and proof · cited by 3,887
- Finset.univstatement and proof · cited by 3,473
- Finset.coe_injectiveproof · cited by 127
- Finset.coe_univproof · cited by 101
- Finset.npowstatement · cited by 30
- Finset.coe_powproof · cited by 4
- Set.univ_powproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.