AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.supportedOn_update_false

theoremverifiedformalizationimported Lean

KnapsackAuction.supportedOn_update_false

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
variable {I : Type*} [Fintype I] [DecidableEq I] in
omit [Fintype I] in
lemma KnapsackAuction.supportedOn_update_false
    {i : I} {items : List I} {x : BinaryAllocation I}
    (hsupp : supportedOn (i :: items) x) :
    supportedOn items (Function.update x i false)
Formalizes
EconCSLib, `KnapsackAuction.supportedOn_update_false`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. 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
propext
Built on 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators invariable {I : Type*} [Fintype I] [DecidableEq I] inomit [Fintype I] inlemma KnapsackAuction.supportedOn_update_false    {i : I} {items : List I} {x : BinaryAllocation I}    (hsupp : supportedOn (i :: items) x) :    supportedOn items (Function.update x i false) := by  intro j hj  by_cases hji : j = i  · subst hji    simp at hj  · have hxj : x j = true := by simpa [Function.update, hji] using hj    have hjmem : j ∈ i :: items := hsupp j hxj    rcases List.mem_cons.mp hjmem with rfl | hjtail    · exact False.elim (hji rfl)    · exact hjtail
See it in the graphDiscuss this resultChallenge it