Theorems · Theorem · group theory
List.formPerm_apply_lt_getElem
∀ {α : Type u_1} [inst : DecidableEq α] (xs : List α),
xs.Nodup → ∀ (n : ℕ) (hn : n + 1 < xs.length), xs.formPerm xs[n] = xs[n + 1]- Defined in
- Mathlib.GroupTheory.Perm.List
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 49 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.
Cites10
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
- zero_addproof · cited by 2,366
- Equiv.Permstatement and proof · cited by 1,375
- Equiv.swapproof · cited by 197
- List.formPermstatement and proof · cited by 54
- Equiv.swap_apply_of_ne_of_neproof · cited by 39
- Equiv.Perm.one_applyproof · cited by 7
- List.Nodup.of_consproof · cited by 3
- List.formPerm_singletonproof · cited by 1
- List.formPerm_apply_getElem_zeroproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- List.formPerm_apply_getElemproof · cited by 6