AFTD Auto-Formalizing Theoretical Domains

TotalPreorder

classimported Lean

A total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or decidable equality. Two distinct elements can be indifferent. This is the appropriate notion for weak preferences in utility theory and matching theory. [MSZ 2.1–2.4]

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
class TotalPreorder (A : Type*) extends Preorder A
Defined in
EconCSLib, `TotalPreorder`
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
none listed
Used by 755

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- A total preorder: a preorder where `≤` is total (complete). This is weaker than `LinearOrder` — it does NOT require antisymmetry or decidable equality. Two distinct elements can be indifferent. This is the appropriate notion for weak preferences in utility theory and matching theory. [MSZ 2.1–2.4] -/
class TotalPreorder (A : Type*) extends Preorder A where
  /-- The preference relation is complete: for any `a b`, either `a ≤ b` or `b ≤ a`. -/
  le_total : ∀ (a b : A), a ≤ b ∨ b ≤ a
See it in the graphDiscuss this resultChallenge it