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.KnapsackAuction.eq_false_of_supportedOn_of_not_mem← KnapsackAuction.eq_false_of_supportedOn_of_not_mem (EconCSLib/MechanismDesign/Auction/Knapsack.lean:436): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- KnapsackAuction.supportedOnAn allocation is supported on a list of agents if every selected agent appears in that list.
- KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- Used by 2
- KnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highestKnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highest
- KnapsackAuction.supportedOn_nil_iffKnapsackAuction.supportedOn_nil_iff
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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))