Theorems · Theorem · combinatorics
Finset.symInsertEquiv_apply_snd_coe
∀ {α : Type u_1} {s : Finset α} {a : α} [inst : DecidableEq α] {n : ℕ} (h : a ∉ s) (m : ↥((insert a s).sym n)),
↑((Finset.symInsertEquiv h) m).snd = (Sym.filterNe a ↑m).snd- Defined in
- Mathlib.Data.Finset.Sym
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 82 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.
- DFunLike.coestatement and proof · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- Equivstatement · cited by 8,337
- Symstatement and proof · cited by 150
- Finset.symstatement and proof · cited by 35
- Finset.symInsertEquivstatement and proof · cited by 6
- Sym.filterNestatement · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.