Theorems · Theorem · combinatorics
List.getElem_eq_getElem_rotate
∀ {α : Type u} (l : List α) (n k : ℕ) (hk : k < l.length), l[k] = (l.rotate n)[(l.length - n % l.length + k) % l.length]A version of List.getElem_rotate that represents l[k] in terms of
(List.rotate l n)[⋯], not vice versa. Can be used instead of rewriting List.getElem_rotate
from right to left.
- Defined in
- Mathlib.Data.List.Rotate
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LT.lt.leproof · cited by 2,189
- LE.le.trans_ltstatement and proof · cited by 795
- LT.lt.trans_eqstatement and proof · cited by 65
- List.length_rotatestatement and proof · cited by 19
- List.getElem_rotateproof · cited by 11
Cited by2
Results whose statement or proof uses this declaration.
- List.get_eq_get_rotateproof · cited by 1
- List.isRotated_next_eqproof · cited by 1