AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.rawBestGood_mem

theoremverifiedformalizationimported Lean

rawBestGood lies in the candidate set s.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {n : ℕ} {G : Type*} in
lemma SocialChoice.FairDivision.Indivisible.rawBestGood_mem
    (w : AdditiveValuation (Fin n) G) (i : Fin n)
    (s : Finset G) (hs : s.Nonempty) :
    rawBestGood w i s hs ∈ s
Formalizes
EconCSLib, `SocialChoice.FairDivision.Indivisible.rawBestGood_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
Classical.choiceQuot.soundpropext
Built on 2
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {n : ℕ} {G : Type*} in
/-- `rawBestGood` lies in the candidate set `s`. -/
lemma SocialChoice.FairDivision.Indivisible.rawBestGood_mem
    (w : AdditiveValuation (Fin n) G) (i : Fin n)
    (s : Finset G) (hs : s.Nonempty) :
    rawBestGood w i s hs ∈ s :=
  (Classical.choose_spec (Finset.exists_max_image s (w.weight i) hs)).1
See it in the graphDiscuss this resultChallenge it