Theorems · Theorem · group theory
Finset.card_pow_le
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : Monoid α] {s : Finset α} {n : ℕ}, (s ^ n).card ≤ s.card ^ n- Cited by
- 2 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Monoidstatement and proof · cited by 3,887
- Finset.cardstatement · cited by 2,327
- Finset.monoidstatement · cited by 20
Cited by2
Results whose statement or proof uses this declaration.
- IsApproximateSubgroup.card_pow_leproof · cited by 1
- IsApproximateSubgroup.pow_inter_pow_covBySMul_sq_inter_sqproof · cited by 1