KnapsackAuction.supportedOn_tail_of_eq_false
theoremverifiedformalizationimported Lean
KnapsackAuction.supportedOn_tail_of_eq_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] [DecidableEq I] in lemma KnapsackAuction.supportedOn_tail_of_eq_false {i : I} {items : List I} {x : BinaryAllocation I} (hsupp : supportedOn (i :: items) x) (hxi : x i = false) : supportedOn items x
- Formalizes
- EconCSLib, `KnapsackAuction.supportedOn_tail_of_eq_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.KnapsackAuction.supportedOn_tail_of_eq_false← KnapsackAuction.supportedOn_tail_of_eq_false (EconCSLib/MechanismDesign/Auction/Knapsack.lean:455): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- 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.
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.supportedOn_tail_of_eq_false {i : I} {items : List I} {x : BinaryAllocation I} (hsupp : supportedOn (i :: items) x) (hxi : x i = false) : supportedOn items x := by intro j hj have hjmem : j ∈ i :: items := hsupp j hj rcases List.mem_cons.mp hjmem with rfl | hjtail · simp [hxi] at hj · exact hjtail