Theorems · Theorem · group theory
Finset.Nonempty.card_pow_mono
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : CancelMonoid α] {s : Finset α},
s.Nonempty → Monotone fun n => (s ^ n).cardSee Finset.card_pow_mono for a version that works for the empty set.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 83 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.
Cites9
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
- Monotonestatement · cited by 1,397
- Finset.Nonemptystatement and proof · cited by 1,001
- pow_succproof · cited by 374
- monotone_nat_of_le_succproof · cited by 45
- Finset.npowstatement · cited by 30
- CancelMonoidstatement and proof · cited by 20
- Finset.card_le_card_mul_rightproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Finset.card_pow_monoproof · cited by 1