Theorems · Definition · group theory
fintypePerm
{α : Type u_1} → [DecidableEq α] → [Fintype α] → Fintype (Equiv.Perm α)The collection of permutations of a fintype is a fintype.
- Defined in
- Mathlib.Data.Fintype.Perm
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- Equiv.Permstatement · cited by 1,375
- permsOfFinsetproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Fintype.card_permproof · cited by 8