Theorems · Theorem · group theory
Finset.card_le_card_add_left_of_injective
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : Add α] {s t : Finset α} {a : α},
a ∈ s → IsAddLeftRegular a → t.card ≤ (s + t).cardSee card_le_card_add_left for a more convenient but less general version for types with a
left-cancellative addition.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqAdd
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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 · cited by 2,327
- Finset.addstatement · cited by 133
- IsAddLeftRegularstatement and proof · cited by 58
- Finset.card_le_card_image₂_leftproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Finset.card_le_card_add_leftproof · cited by 4