Theorems · Theorem
List.getElem_map_rev
∀ {α : Type u} {β : Type v} (f : α → β) {l : List α} {n : ℕ} {h : n < l.length}, f l[n] = (List.map f l)[n]A version of getElem_map that can be used for rewriting.
- Defined in
- Mathlib.Data.List.Basic
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 45 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by2
Results whose statement or proof uses this declaration.
- Composition.length_sigmaCompositionAuxproof · cited by 3
- Ideal.exists_ltSeries_of_hasGoingDownproof · cited by 1