Theorems · Definition · combinatorics
Sym.map
{α : Type u_1} → {β : Type u_2} → {n : ℕ} → (α → β) → Sym α n → Sym β nA function α → β induces a function Sym α n → Sym β n by applying it to every element of
the underlying n-tuple.
- Defined in
- Mathlib.Data.Sym.Basic
- Cited by
- 22 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multiset.mapproof · cited by 876
- Symstatement and proof · cited by 150
Cited by26
Results whose statement or proof uses this declaration.
- Sym.equivCongrproof · cited by 5
- SymOptionSuccEquiv.decodeproof · cited by 4
- SymOptionSuccEquiv.encodeproof · cited by 4
- Sym.attach_map_coestatement and proof · cited by 3
- Sym.map_congrstatement · cited by 3
- Sym.map_mapstatement · cited by 3
- Sym.map_injectivestatement and proof · cited by 2
- Sym.equivCongr_applystatement · cited by 2
- SymOptionSuccEquiv.encode_of_none_notMemstatement · cited by 1
- MvPolynomial.rename_msymmproof · cited by 1
- Sym.mem_mapstatement · cited by 1
- Sym.attach_consstatement and proof · cited by 0