SocialChoice.Voting.betweenBallot_xz
theoremverifiedformalizationimported Lean
SocialChoice.Voting.betweenBallot_xz
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N A : Type*} in theorem SocialChoice.Voting.betweenBallot_xz [Fintype A] (r : LinearOrder A) {x y z : A} (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z) : BallotPrefers (betweenBallot r hxy hxz hyz) x z
- Formalizes
- EconCSLib, `SocialChoice.Voting.betweenBallot_xz`
- 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.betweenBallot_xz← SocialChoice.Voting.betweenBallot_xz (EconCSLib/SocialChoice/Voting/Decisive.lean:150): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- SocialChoice.Voting.BallotPrefersBallot
rranksastrictly aboveb. - SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.betweenKey_injectiveSocialChoice.Voting.betweenKey_injective
- SocialChoice.Voting.ballotFromInjectivePull a linear order back along an injective map, using the supplied codomain order explicitly rather than relying on ambient typeclass…
- SocialChoice.Voting.betweenKeySocialChoice.Voting.betweenKey
- SocialChoice.Voting.rank
rank r ais the number of alternatives strictly aboveain ballotr. - SocialChoice.Voting.ballotLTBallot
r's strict-order instance, exposed explicitly to avoid ambient typeclass search. - SocialChoice.Voting.betweenBallotSocialChoice.Voting.betweenBallot
- SocialChoice.Voting.BallotPrefersBallot
- Used by 1
- SocialChoice.Voting.modifiedForwardProfile_specSocialChoice.Voting.modifiedForwardProfile_spec
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 invariable {N A : Type*} intheorem SocialChoice.Voting.betweenBallot_xz [Fintype A] (r : LinearOrder A) {x y z : A} (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z) : BallotPrefers (betweenBallot r hxy hxz hyz) x z := by simp [betweenBallot, betweenKey, Ne.symm hxz, Ne.symm hyz]