Physlib.List.insertIdx_map
theoremverifiedformalizationimported Lean
Physlib.List.insertIdx_map
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {n : Nat} in lemma Physlib.List.insertIdx_map {I J : Type} (f : I → J) : (i : ℕ) → (r : List I) → (r0 : I) → (List.insertIdx r i r0).map f = List.insertIdx (r.map f) i (f r0)
- Formalizes
- Physlib, `Physlib.List.insertIdx_map`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2024 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.Physlib.List.insertIdx_map← Physlib.List.insertIdx_map (Physlib/Mathematics/ForMathlib/List/InsertIdx.lean:23): verbatim
- Verified
- 09 Oct 2026
- Axioms
propext
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {n : Nat} inlemma Physlib.List.insertIdx_map {I J : Type} (f : I → J) : (i : ℕ) → (r : List I) → (r0 : I) → (List.insertIdx r i r0).map f = List.insertIdx (r.map f) i (f r0) | 0, [], r0 => by simp | n+1, [], r0 => by simp | 0, a::as, r0 => by simp | n+1, a::as, r0 => by simp only [List.insertIdx_succ_cons, List.map_cons, List.cons.injEq, true_and] exact insertIdx_map f n as r0