AFTD Auto-Formalizing Theoretical Domains

FieldStatistic.ofList_insert_lt_eq

theoremverifiedformalizationimported Lean

FieldStatistic.ofList_insert_lt_eq

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open FieldStatistic in
variable {𝓕 : Type} in
open Physlib.List in
variable (q : 𝓕 β†’ FieldStatistic) in
lemma FieldStatistic.ofList_insert_lt_eq (n m : β„•) (Ο†1 : 𝓕) (Ο†s : List 𝓕) (hn : m ≀ n)
    (hm : m ≀ Ο†s.length) :
    ofList q ((List.insertIdx Ο†s m Ο†1).take (n + 1)) =
    ofList q ((Ο†1 :: Ο†s).take (n + 1))
Formalizes
Physlib, `FieldStatistic.ofList_insert_lt_eq`
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
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 22
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen FieldStatistic invariable {𝓕 : Type} inopen Physlib.List invariable (q : 𝓕 β†’ FieldStatistic) inlemma FieldStatistic.ofList_insert_lt_eq (n m : β„•) (Ο†1 : 𝓕) (Ο†s : List 𝓕) (hn : m ≀ n)    (hm : m ≀ Ο†s.length) :    ofList q ((List.insertIdx Ο†s m Ο†1).take (n + 1)) =    ofList q ((Ο†1 :: Ο†s).take (n + 1)) := by  apply ofList_perm  simp only [List.take_succ_cons]  refine take_insert_let Ο†1 n m hn Ο†s hm
See it in the graphDiscuss this resultChallenge it