AFTD Auto-Formalizing Theoretical Domains

CostM.cost_parList_cons

theoremverifiedformalizationimported Lean

CostM.cost_parList_cons

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {C : Type*} {A B : Type u} in
@[simp] theorem CostM.cost_parList_cons [SemilatticeSup C] [OrderBot C]
    (m : CostM C A) (ms : List (CostM C A)) :
    (parList (m :: ms)).cost = m.cost ⊔ (parList ms).cost
Formalizes
EconCSLib, `CostM.cost_parList_cons`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2025 Sorrachai Yingchareonthawornhcai. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 30
Used by 2
  • CostM.BoundedThe cost of alg i is bounded by bound (size i) for every input i.
  • CostM.IsPolyBoundedSpecialization of Bounded for C = ℕ: cost is polynomial in input size.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {C : Type*} {A B : Type u} in
@[simp] theorem CostM.cost_parList_cons [SemilatticeSup C] [OrderBot C]
    (m : CostM C A) (ms : List (CostM C A)) :
    (parList (m :: ms)).cost = m.cost ⊔ (parList ms).cost := rfl
See it in the graphDiscuss this resultChallenge it