AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations

theoremverifiedformalizationimported Lean

KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open KnapsackAuction in
open scoped BigOperators in
variable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in
variable [Fintype I] [DecidableEq I] [LinearOrder I] in
omit [LinearOrder I] in
lemma KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations
    (A : KnapsackAuction I U) {x : BinaryAllocation I}
    (hx : x ∈ A.feasibleBinaryAllocations) :
    A.binaryRespectsCapacity x
Formalizes
EconCSLib, `KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations`
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
Classical.choiceQuot.soundpropext
Built on 4
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen KnapsackAuction inopen scoped BigOperators invariable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] invariable [Fintype I] [DecidableEq I] [LinearOrder I] inomit [LinearOrder I] inlemma KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations    (A : KnapsackAuction I U) {x : BinaryAllocation I}    (hx : x ∈ A.feasibleBinaryAllocations) :    A.binaryRespectsCapacity x := by  classical  unfold feasibleBinaryAllocations at hx  simp at hx  exact hx
See it in the graphDiscuss this resultChallenge it