Theorems · Theorem · combinatorics
Finset.mem_of_mem_erase
∀ {α : Type u_1} [inst : DecidableEq α] {s : Finset α} {a b : α}, b ∈ s.erase a → b ∈ s- Defined in
- Mathlib.Data.Finset.Erase
- Cited by
- 20 results in Mathlib
- Foundations
- Depth 54 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.
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.erasestatement · cited by 455
- Multiset.mem_of_mem_eraseproof · cited by 10
Cited by20
Results whose statement or proof uses this declaration.
- Finsupp.mapDomain_apply'proof · cited by 3
- Finpartition.equitabilise_auxproof · cited by 3
- meromorphicNFAt_prodproof · cited by 3
- Convex.helly_theorem'proof · cited by 3
- Finset.lt_max'_of_mem_erase_max'proof · cited by 3
- Finset.induction_on_max_valueproof · cited by 2
- Finset.noncommProd_erase_mulstatement · cited by 2
- Lagrange.derivative_nodalproof · cited by 1
- Polynomial.mul_prod_pow_inverse_eq_quo_add_sum_rem_mul_pow_inverseproof · cited by 1
- Equiv.Perm.OnCycleFactors.kerParam_applyproof · cited by 1
- Finset.Colex.erase_le_erase_min'proof · cited by 1
- Finset.prod_lt_prodproof · cited by 1