AFTD Auto-Formalizing Theoretical Domains

exists_preference_with_unique_top

theoremverified

For every alternative p in X, there exists a preference relation with unique top p.

Statement

theorem exists_preference_with_unique_top {X : Type*} (p : X) : ∃ R : PreferenceWithUniqueTop X, R.top = p
Source
folklore
Verified
16 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • PreferenceWithUniqueTopA preference relation on alternatives with a complete and transitive weak preference relation and a unique top alternative.

Read back from the Lean

For any type X and any element p : X, there exists a PreferenceWithUniqueTop X whose distinguished top element is equal to p.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- For every alternative, there exists a preference relation with that alternative as unique top. -/
theorem exists_preference_with_unique_top {X : Type*} (p : X) : ∃ R : PreferenceWithUniqueTop X, R.top = p := by
  refine ⟨⟨fun x y => x = p ∨ y ≠ p, ?_, ?_, p, ?_⟩, rfl⟩
  · intro x y
    by_cases hx : x = p
    · exact Or.inl (Or.inl hx)
    · exact Or.inr (Or.inr hx)
  · intro x y z hxy hyz
    rcases hxy with hx | hy
    · exact Or.inl hx
    · rcases hyz with hy' | hz
      · exact (hy hy').elim
      · exact Or.inr hz
  · intro y hy h
    rcases h with h1 | h2
    · exact hy h1
    · exact h2 rfl
See it in the graphDiscuss this resultChallenge it