Theorems · Theorem · combinatorics
Multiset.card_erase_lt_of_mem
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s : Multiset α}, a ∈ s → (s.erase a).card < s.card- Defined in
- Mathlib.Data.Multiset.AddSub
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
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.
- Multisetstatement and proof · cited by 2,627
- Multiset.cardstatement · cited by 375
- Multiset.erasestatement · cited by 93
- Multiset.card_lt_cardproof · cited by 6
- Multiset.erase_ltproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Finset.card_erase_lt_of_memproof · cited by 3