AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.tripartition_lemma

theoremverifiedformalizationimported Lean

SocialChoice.Voting.tripartition_lemma

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N A : Type*} in
theorem SocialChoice.Voting.tripartition_lemma {N : Type*} {A B C : Set N}
    (h : tripartition A B C) :
    ∀ i : N,
      i ∈ A ∪ B ∪ C ∧
      (i ∈ A ↔ i ∉ B ∧ i ∉ C) ∧
      (i ∈ B ↔ i ∉ A ∧ i ∉ C) ∧
      (i ∈ C ↔ i ∉ A ∧ i ∉ B)
Formalizes
EconCSLib, `SocialChoice.Voting.tripartition_lemma`
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 1
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N A : Type*} intheorem SocialChoice.Voting.tripartition_lemma {N : Type*} {A B C : Set N}    (h : tripartition A B C) :    ∀ i : N,      i ∈ A ∪ B ∪ C ∧      (i ∈ A ↔ i ∉ B ∧ i ∉ C) ∧      (i ∈ B ↔ i ∉ A ∧ i ∉ C) ∧      (i ∈ C ↔ i ∉ A ∧ i ∉ B) := by  intro i  by_cases hA : i ∈ A <;> by_cases hB : i ∈ B <;> by_cases hC : i ∈ C <;>    simp_all [tripartition]  · have := Set.mem_inter hA hB; simp_all  · have := Set.mem_inter hA hB; simp_all  · have := Set.mem_inter hA hC; simp_all  · have := Set.mem_inter hB hC; simp_all  · have hnot : i ∉ A ∪ B ∪ C := by      intro hmem      rcases hmem with (hmem | hmem) | hmem <;> contradiction    rw [h.2.2.2] at hnot    exact hnot trivial
See it in the graphDiscuss this resultChallenge it