AFTD Auto-Formalizing Theoretical Domains

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.
Verified
09 Oct 2026
Axioms
propext

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it