AFTD Auto-Formalizing Theoretical Domains

Physlib.List.insertIdx_length_fin

theoremverifiedformalizationimported Lean

Physlib.List.insertIdx_length_fin

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {n : Nat} in
@[simp]
lemma Physlib.List.insertIdx_length_fin {I : Type} (i : I) :
    (r : List I) → (n : Fin r.length.succ) →
    (List.insertIdx r n i).length = r.length.succ
Formalizes
Physlib, `Physlib.List.insertIdx_length_fin`
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
Classical.choiceQuot.soundpropext
Built on 1
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {n : Nat} in@[simp]lemma Physlib.List.insertIdx_length_fin {I : Type} (i : I) :    (r : List I) → (n : Fin r.length.succ) →    (List.insertIdx r n i).length = r.length.succ  | [], 0 => by simp  | a :: as, 0 => by simp  | a :: as, ⟨n + 1, h⟩ => by    simp only [List.insertIdx_succ_cons, List.length_cons, Nat.succ_eq_add_one, add_left_inj]    exact insertIdx_length_fin i as ⟨n, Nat.succ_lt_succ_iff.mp h⟩
See it in the graphDiscuss this resultChallenge it