AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.eq_false_of_supportedOn_of_not_mem

theoremverifiedformalizationimported Lean

KnapsackAuction.eq_false_of_supportedOn_of_not_mem

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] [DecidableEq I] in
lemma KnapsackAuction.eq_false_of_supportedOn_of_not_mem
    {items : List I} {x : BinaryAllocation I}
    (hsupp : supportedOn items x) {i : I} (hi : i ∉ items) :
    x i = false
Formalizes
EconCSLib, `KnapsackAuction.eq_false_of_supportedOn_of_not_mem`
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
none — Lean reports it depends on no axioms
Built on 2
Used by 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] [DecidableEq I] inlemma KnapsackAuction.eq_false_of_supportedOn_of_not_mem    {items : List I} {x : BinaryAllocation I}    (hsupp : supportedOn items x) {i : I} (hi : i ∉ items) :    x i = false := by  cases hxi : x i with  | false => rfl  | true => exact False.elim (hi (hsupp i hxi))
See it in the graphDiscuss this resultChallenge it