AFTD Auto-Formalizing Theoretical Domains

PreferenceWithUniqueTop

structure

A preference relation on alternatives with a complete and transitive weak preference relation and a unique top alternative.

Statement

structure PreferenceWithUniqueTop (X : Type*)
Defined in
scout/2611-18282-safe-manipulation-of-tops-only-voting-rules.md:215
Verified
16 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

A structure PreferenceWithUniqueTop parameterized by a type X, consisting of: 1. rel: a binary relation on X (X → X → Prop), 2. total: a proof that rel is total/connected, i.e., for all x, y : X, rel x y ∨ rel y x, 3. trans: a proof that rel is transitive, i.e., for all x, y, z : X, rel x y → rel y z → rel x z, 4. top: a distinguished element of X, 5. unique_top: a proof that for all y : X, if y ≠ top, then ¬ rel y top.

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

/-- Preference relation on alternatives with complete and transitive weak preference and a unique top alternative. -/
structure PreferenceWithUniqueTop (X : Type*) where
  rel : X → X → Prop
  total : ∀ x y, rel x y ∨ rel y x
  trans : ∀ x y z, rel x y → rel y z → rel x z
  top : X
  unique_top : ∀ y, y ≠ top → ¬ rel y top
See it in the graphDiscuss this resultChallenge it