Theorems · Theorem · combinatorics
Finset.sym_eq_empty
∀ {α : Type u_1} {s : Finset α} [inst : DecidableEq α] {n : ℕ}, s.sym n = ∅ ↔ n ≠ 0 ∧ s = ∅- Defined in
- Mathlib.Data.Finset.Sym
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 80 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.
Cites6
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
- Symstatement · cited by 150
- Finset.symstatement and proof · cited by 35
- Finset.singleton_ne_emptyproof · cited by 6
- Finset.eq_empty_of_sym_eq_emptyproof · cited by 1
- Finset.sym_emptyproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- DividedPowers.dpow_sum'proof · cited by 2
- Finset.sym_nonemptyproof · cited by 0