AFTD Auto-Formalizing Theoretical Domains

FieldStatistic.ofList_take_succ_cons

theoremverifiedformalizationimported Lean

FieldStatistic.ofList_take_succ_cons

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open FieldStatistic in
variable {𝓕 : Type} in
variable (q : 𝓕 β†’ FieldStatistic) in
lemma FieldStatistic.ofList_take_succ_cons (n : β„•) (Ο†1 : 𝓕) (Ο†s : List 𝓕) :
    ofList q ((Ο†1 :: Ο†s).take (n + 1)) = q Ο†1 * ofList q (Ο†s.take n)
Formalizes
Physlib, `FieldStatistic.ofList_take_succ_cons`
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 21
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen FieldStatistic invariable {𝓕 : Type} invariable (q : 𝓕 β†’ FieldStatistic) inlemma FieldStatistic.ofList_take_succ_cons (n : β„•) (Ο†1 : 𝓕) (Ο†s : List 𝓕) :    ofList q ((Ο†1 :: Ο†s).take (n + 1)) = q Ο†1 * ofList q (Ο†s.take n) := by  simp only [List.take_succ_cons]  rw [ofList_cons_eq_mul]
See it in the graphDiscuss this resultChallenge it