Theorems · Theorem · group theory
List.formPerm_apply_getElem
∀ {α : Type u_1} [inst : DecidableEq α] (xs : List α),
xs.Nodup → ∀ (i : ℕ) (h : i < xs.length), xs.formPerm xs[i] = xs[(i + 1) % xs.length]- Defined in
- Mathlib.GroupTheory.Perm.List
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 50 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 · cited by 62,936
- Equiv.Permstatement · cited by 1,375
- LE.le.trans_ltstatement and proof · cited by 795
- LE.le.eq_or_ltproof · cited by 220
- List.formPermstatement · cited by 54
- List.formPerm_apply_lt_getElemproof · cited by 1
- List.formPerm_apply_getElem_lengthproof · cited by 1
Cited by6
Results whose statement or proof uses this declaration.
- List.formPerm_pow_apply_getElemproof · cited by 4
- List.formPerm_apply_mem_eq_self_iffproof · cited by 3
- List.formPerm_apply_mem_eq_nextproof · cited by 2
- List.support_formPerm_of_nodup'proof · cited by 2
- List.formPerm_rotate_oneproof · cited by 1
- List.formPerm_ext_iffproof · cited by 1