TotalPreorder.comparable
theoremverifiedformalizationimported Lean
In a total preorder, any two elements are comparable.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem TotalPreorder.comparable [TotalPreorder A] (a b : A) : a ≤ b ∨ b ≤ a
- Formalizes
- EconCSLib, `TotalPreorder.comparable`
- 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.TotalPreorder.comparable← TotalPreorder.comparable (EconCSLib/Foundation/Preference.lean:122): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 1
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
- TotalPreorderA total preorder: a preorder where
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- In a total preorder, any two elements are comparable. -/ theorem TotalPreorder.comparable [TotalPreorder A] (a b : A) : a ≤ b ∨ b ≤ a := TotalPreorder.le_total a b