Theorems · Theorem · combinatorics
Multiset.erase_lt
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s : Multiset α}, s.erase a < s ↔ a ∈ s- Defined in
- Mathlib.Data.Multiset.AddSub
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 25 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.
Cites7
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
- ne_of_ltproof · cited by 203
- Multiset.erasestatement and proof · cited by 93
- not_imp_commproof · cited by 56
- Multiset.cons_eraseproof · cited by 25
- Multiset.erase_of_notMemproof · cited by 10
- Multiset.lt_cons_selfproof · cited by 8
Cited by2
Results whose statement or proof uses this declaration.
- PrimeSpectrum.exists_multiset_prod_cons_le_and_prod_not_leproof · cited by 2
- Multiset.card_erase_lt_of_memproof · cited by 1