AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.feasibleBinaryAllocations_nonempty

theoremverifiedformalizationimported Lean

KnapsackAuction.feasibleBinaryAllocations_nonempty

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] in
lemma KnapsackAuction.feasibleBinaryAllocations_nonempty (A : KnapsackAuction I U) (hW : 0 ≤ A.totalCapacity) :
    A.feasibleBinaryAllocations ≠ []
Formalizes
EconCSLib, `KnapsackAuction.feasibleBinaryAllocations_nonempty`
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 7
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] inlemma KnapsackAuction.feasibleBinaryAllocations_nonempty (A : KnapsackAuction I U) (hW : 0 ≤ A.totalCapacity) :    A.feasibleBinaryAllocations ≠ [] := by  classical  intro hnil  have hmem : (fun _ : I => false) ∈ A.feasibleBinaryAllocations := by    unfold feasibleBinaryAllocations    simp [zeroBinaryRespectsCapacity (A := A) hW]  rw [hnil] at hmem  simp at hmem
See it in the graphDiscuss this resultChallenge it