Theorems · Theorem · group theory
Finset.card_pow_mono
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : CancelMonoid α] {s : Finset α} {m n : ℕ},
m ≠ 0 → m ≤ n → (s ^ m).card ≤ (s ^ n).cardSee Finset.Nonempty.card_pow_mono for a version that works for zero powers.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 84 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.
Cites8
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
- Finset.Nonemptyproof · cited by 1,001
- Finset.eq_empty_or_nonemptyproof · cited by 104
- Finset.npowstatement · cited by 30
- CancelMonoidstatement and proof · cited by 20
- Finset.empty_powproof · cited by 4
- Finset.Nonempty.card_pow_monoproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Finset.card_le_card_powproof · cited by 1