Theorems · Definition · combinatorics
Finset.erase
{α : Type u_1} → [DecidableEq α] → Finset α → α → Finset αerase s a is the set s - {a}, that is, the elements of s which are
not equal to a.
- Defined in
- Mathlib.Data.Finset.Erase
- Cited by
- 455 results in Mathlib
- Foundations
- Depth 27 from the axioms, rests on 306 definitions · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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.valproof · cited by 438
- Multiset.eraseproof · cited by 93
Cited by470
Results whose statement or proof uses this declaration.
- Finset.insert_erasestatement · cited by 65
- Finset.mem_erasestatement · cited by 61
- Finset.notMem_erasestatement · cited by 59
- Finsupp.updateproof · cited by 52
- Finsupp.eraseproof · cited by 46
- Finset.prod_eq_zeroproof · cited by 44
- Finset.card_erase_of_memstatement · cited by 38
- Finset.shadowproof · cited by 35
- Finset.erase_subsetstatement · cited by 31
- Finset.erase_eq_of_notMemstatement · cited by 30
- Finset.add_sum_erasestatement · cited by 28
- Lagrange.basisproof · cited by 26
Showing the 200 most cited of 470.