AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.bottomKey

defimported Lean

SocialChoice.Voting.bottomKey

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N A : Type*} in
noncomputable def SocialChoice.Voting.bottomKey [Fintype A] (r : LinearOrder A) (y a : A) : Nat
Defined in
EconCSLib, `SocialChoice.Voting.bottomKey`
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
none listed
Built on 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N A : Type*} in
noncomputable def SocialChoice.Voting.bottomKey [Fintype A] (r : LinearOrder A) (y a : A) : Nat :=
  if a = y then Fintype.card A + 1 else rank r a
See it in the graphDiscuss this resultChallenge it