AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.bestGood_mem

theoremverifiedformalizationimported Lean

bestGood lies in the candidate set.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {n : ℕ} {G : Type*} in
variable [NeZero n] in
omit [NeZero n] in
lemma SocialChoice.FairDivision.Indivisible.bestGood_mem [DecidableEq G]
    (I : AdditiveInstance (Fin n) G) (i : Fin n)
    (s : Finset G) (hs : s.Nonempty) :
    bestGood I i s hs ∈ s
Formalizes
EconCSLib, `SocialChoice.FairDivision.Indivisible.bestGood_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 4

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
variable [NeZero n] in
omit [NeZero n] in
/-- `bestGood` lies in the candidate set. -/
lemma SocialChoice.FairDivision.Indivisible.bestGood_mem [DecidableEq G]
    (I : AdditiveInstance (Fin n) G) (i : Fin n)
    (s : Finset G) (hs : s.Nonempty) :
    bestGood I i s hs ∈ s :=
  rawBestGood_mem I.toAdditiveValuation i s hs
See it in the graphDiscuss this resultChallenge it