AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.betweenKey_injective

theoremverifiedformalizationimported Lean

SocialChoice.Voting.betweenKey_injective

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N A : Type*} in
theorem SocialChoice.Voting.betweenKey_injective [Fintype A] (r : LinearOrder A)
    {x y z : A} (_hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z) :
    Function.Injective (betweenKey r x y z)
Formalizes
EconCSLib, `SocialChoice.Voting.betweenKey_injective`
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 4
Used by 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N A : Type*} intheorem SocialChoice.Voting.betweenKey_injective [Fintype A] (r : LinearOrder A)    {x y z : A} (_hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z) :    Function.Injective (betweenKey r x y z) := by  classical  intro a b h  unfold betweenKey at h  by_cases hax : a = x <;> by_cases hbx : b = x  · simp_all  · by_cases hby : b = y <;> by_cases hbz : b = z <;> simp_all  · by_cases hay : a = y <;> by_cases haz : a = z <;> simp_all  · by_cases hay : a = y <;> by_cases hby : b = y    · simp_all    · by_cases hbz : b = z <;> simp_all    · by_cases haz : a = z <;> simp_all    · by_cases haz : a = z <;> by_cases hbz : b = z      · simp_all      · simp_all      · simp_all      · simp_all        exact rank_injective r (by omega)
See it in the graphDiscuss this resultChallenge it