Theorems · Definition · group theory
permsOfFinset
{α : Type u_1} → [DecidableEq α] → Finset α → Finset (Equiv.Perm α)Given a finset, produce the finset of all permutations of its elements.
- Defined in
- Mathlib.Data.Fintype.Perm
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 59 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.
Cites8
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
- Equiv.Permstatement · cited by 1,375
- Finset.valproof · cited by 438
- Multiset.ofListproof · cited by 290
- Multiset.Nodupproof · cited by 148
- Finset.nodupproof · cited by 40
- permsOfListproof · cited by 6
- nodup_permsOfListproof · cited by 0
Cited by3
Results whose statement or proof uses this declaration.
- fintypePermproof · cited by 1
- card_perms_of_finsetstatement · cited by 1
- mem_perms_of_finset_iffstatement · cited by 0