AFTD Auto-Formalizing Theoretical Domains

Physlib.List.insertIdx_length_fst_append

theoremverifiedformalizationimported Lean

Physlib.List.insertIdx_length_fst_append

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {n : Nat} in
lemma Physlib.List.insertIdx_length_fst_append {I : Type} (φ : I) : (φs φs' : List I) →
    List.insertIdx (φs ++ φs') φs.length φ = (φs ++ φ :: φs')
Formalizes
Physlib, `Physlib.List.insertIdx_length_fst_append`
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_length_fst_append {I : Type} (φ : I) : (φs φs' : List I) →    List.insertIdx (φs ++ φs') φs.length φ = (φs ++ φ :: φs')  | [], φs' => by simp  | φ' :: φs, φs' => by    simp only [List.length_cons, List.cons_append, List.insertIdx_succ_cons, List.cons.injEq,      true_and]    exact insertIdx_length_fst_append φ φs φs'
See it in the graphDiscuss this resultChallenge it