AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.condorcetProfile_spec

theoremverifiedformalizationimported Lean

SocialChoice.Voting.condorcetProfile_spec

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N A : Type*} in
theorem SocialChoice.Voting.condorcetProfile_spec [Fintype N] [Fintype A]
    {S T U : Set N}
    {x y z : A} (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z)
    (hSTU : tripartition S T U) :
    ∀ i,
      (i ∈ S → Prefers (condorcetProfile S T U x y z hxy hxz hyz) i x y ∧
          Prefers (condorcetProfile S T U x y z hxy hxz hyz) i y z) ∧
      (i ∈ T → Prefers (condorcetProfile S T U x y z hxy hxz hyz) i y z ∧
          Prefers (condorcetProfile S T U x y z hxy hxz hyz) i z x) ∧
      (i ∈ U → Prefers (condorcetProfile S T U x y z hxy hxz hyz) i z x ∧
          Prefers (condorcetProfile S T U x y z hxy hxz hyz) i x y)
Formalizes
EconCSLib, `SocialChoice.Voting.condorcetProfile_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 9

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N A : Type*} intheorem SocialChoice.Voting.condorcetProfile_spec [Fintype N] [Fintype A]    {S T U : Set N}    {x y z : A} (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z)    (hSTU : tripartition S T U) :    ∀ i,      (i ∈ S → Prefers (condorcetProfile S T U x y z hxy hxz hyz) i x y ∧          Prefers (condorcetProfile S T U x y z hxy hxz hyz) i y z) ∧      (i ∈ T → Prefers (condorcetProfile S T U x y z hxy hxz hyz) i y z ∧          Prefers (condorcetProfile S T U x y z hxy hxz hyz) i z x) ∧      (i ∈ U → Prefers (condorcetProfile S T U x y z hxy hxz hyz) i z x ∧          Prefers (condorcetProfile S T U x y z hxy hxz hyz) i x y) := by  classical  intro i  have htri := tripartition_lemma hSTU i  by_cases hS : i ∈ S  · constructor    · intro _      simpa [condorcetProfile, Prefers, hS] using acyclicBallot_spec hxy hxz hyz    constructor    · intro hT      exact False.elim ((htri.2.2.1.mp hT).1 hS)    · intro hU      exact False.elim ((htri.2.2.2.mp hU).1 hS)  · by_cases hT : i ∈ T    · have hnotU : i ∉ U := (htri.2.2.1.mp hT).2      constructor      · intro hS'        exact False.elim (hS hS')      constructor      · intro _        simpa [condorcetProfile, Prefers, hS, hT] using          acyclicBallot_spec hyz (Ne.symm hxy) (Ne.symm hxz)      · intro hU'        exact False.elim (hnotU hU')    · have hU : i ∈ U := by        exact (htri.2.2.2).mpr ⟨hS, hT⟩      constructor      · intro hS'        exact False.elim (hS hS')      constructor      · intro hT'        exact False.elim (hT hT')      · intro _        simpa [condorcetProfile, Prefers, hS, hT] using          acyclicBallot_spec (Ne.symm hxz) (Ne.symm hyz) hxy
See it in the graphDiscuss this resultChallenge it