Theorems · Theorem · group theory
Finset.card_le_card_pow
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : CancelMonoid α] {s : Finset α} {n : ℕ}, n ≠ 0 → s.card ≤ (s ^ n).card- Cited by
- 1 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqCancelMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- Finset.cardstatement and proof · cited by 2,327
- pow_oneproof · cited by 894
- one_ne_zeroproof · cited by 885
- Finset.npowstatement · cited by 30
- CancelMonoidstatement and proof · cited by 20
- Finset.card_pow_monoproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Finset.small_alternating_pow_of_small_triplingproof · cited by 0