SocialChoice.Voting.BallotPrefers.asymm
theoremverifiedformalizationimported Lean
SocialChoice.Voting.BallotPrefers.asymm
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in theorem SocialChoice.Voting.BallotPrefers.asymm (r : LinearOrder A) {a b : A} : BallotPrefers r a b → ¬ BallotPrefers r b a
- Formalizes
- EconCSLib, `SocialChoice.Voting.BallotPrefers.asymm`
- 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.SocialChoice.Voting.BallotPrefers.asymm← SocialChoice.Voting.BallotPrefers.asymm (EconCSLib/SocialChoice/Voting/Basic.lean:102): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- SocialChoice.Voting.BallotPrefersBallot
rranksastrictly aboveb. - SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.BallotPrefersBallot
- Used by 2
- SocialChoice.Voting.modifiedForwardProfile_specSocialChoice.Voting.modifiedForwardProfile_spec
- SocialChoice.Voting.Prefers.asymmSocialChoice.Voting.Prefers.asymm
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset invariable {N A : Type*} intheorem SocialChoice.Voting.BallotPrefers.asymm (r : LinearOrder A) {a b : A} : BallotPrefers r a b → ¬ BallotPrefers r b a := by intro hab hba have hle_not := (r.lt_iff_le_not_ge a b).mp hab have hle := (r.lt_iff_le_not_ge b a).mp hba |>.left exact hle_not.right hle