AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.acyclicBallot_spec

theoremverifiedformalizationimported Lean

SocialChoice.Voting.acyclicBallot_spec

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N A : Type*} in
theorem SocialChoice.Voting.acyclicBallot_spec [Fintype A]
    {x y z : A} (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z) :
    BallotPrefers (acyclicBallot A hxy hxz hyz) x y ∧
      BallotPrefers (acyclicBallot A hxy hxz hyz) y z
Formalizes
EconCSLib, `SocialChoice.Voting.acyclicBallot_spec`
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 6
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N A : Type*} intheorem SocialChoice.Voting.acyclicBallot_spec [Fintype A]    {x y z : A} (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z) :    BallotPrefers (acyclicBallot A hxy hxz hyz) x y ∧      BallotPrefers (acyclicBallot A hxy hxz hyz) y z := by  exact ⟨betweenBallot_xy (defaultBallot A) hxy hxz hyz,    betweenBallot_yz (defaultBallot A) hxy hxz hyz⟩
See it in the graphDiscuss this resultChallenge it