AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.BallotPrefers.total_of_ne

theoremverifiedformalizationimported Lean

SocialChoice.Voting.BallotPrefers.total_of_ne

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset in
variable {N A : Type*} in
theorem SocialChoice.Voting.BallotPrefers.total_of_ne (r : LinearOrder A) {a b : A} (hne : a ≠ b) :
    BallotPrefers r a b ∨ BallotPrefers r b a
Formalizes
EconCSLib, `SocialChoice.Voting.BallotPrefers.total_of_ne`
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 — Lean reports it depends on no axioms
Built on 3
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset invariable {N A : Type*} intheorem SocialChoice.Voting.BallotPrefers.total_of_ne (r : LinearOrder A) {a b : A} (hne : a ≠ b) :    BallotPrefers r a b ∨ BallotPrefers r b a := by  letI := r  rcases lt_or_gt_of_ne hne with hab | hba  · left    simpa [BallotPrefers, ballotLT] using hab  · right    simpa [BallotPrefers, ballotLT] using hba
See it in the graphDiscuss this resultChallenge it