Theorems · Theorem · group theory
List.formPerm_apply_mem_eq_next
∀ {α : Type u_1} [inst : DecidableEq α] {l : List α}, l.Nodup → ∀ (x : α) (hx : x ∈ l), l.formPerm x = l.next x hx- Defined in
- Mathlib.GroupTheory.Perm.Cycle.Concrete
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 71 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 and proof · cited by 62,936
- Equiv.Permstatement · cited by 1,375
- LE.le.trans_ltproof · cited by 795
- List.formPermstatement and proof · cited by 54
- List.nextstatement · cited by 22
- List.next_getElemproof · cited by 7
- List.formPerm_apply_getElemproof · cited by 6
Cited by2
Results whose statement or proof uses this declaration.
- Equiv.Perm.formPerm_toListproof · cited by 1
- Cycle.formPerm_apply_mem_eq_nextproof · cited by 0