AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.betweenBallot

defimported Lean

SocialChoice.Voting.betweenBallot

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N A : Type*} in
noncomputable def SocialChoice.Voting.betweenBallot [Fintype A] (r : LinearOrder A)
    {x y z : A} (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z) :
    LinearOrder A
Defined in
EconCSLib, `SocialChoice.Voting.betweenBallot`
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 4
Used by 6

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.betweenBallot [Fintype A] (r : LinearOrder A)
    {x y z : A} (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z) :
    LinearOrder A :=
  ballotFromInjective (inferInstance : LinearOrder Nat) (betweenKey r x y z)
    (betweenKey_injective r hxy hxz hyz)
See it in the graphDiscuss this resultChallenge it