Pref.ofTotalPreorder
defimported Lean
Bundle an explicit total preorder as a preference.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in def Pref.ofTotalPreorder {A : Type*} (r : TotalPreorder A) : Pref A
- Defined in
- EconCSLib, `Pref.ofTotalPreorder`
- 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.Pref.ofTotalPreorder← Pref.ofTotalPreorder (EconCSLib/Foundation/Preference.lean:162): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- IsPreferenceA weak preference relation is admissible if it is reflexive, transitive, and total.
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp
- PrefA bundled weak preference relation. Use this interface when several agents may rank the same outcome type differently. Use…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- Bundle an explicit total preorder as a preference. -/ def Pref.ofTotalPreorder {A : Type*} (r : TotalPreorder A) : Pref A where rel := fun a b => @LE.le A r.toPreorder.toLE a b prop := { reflexive := fun a => r.le_refl a transitive := fun _ _ _ => r.le_trans _ _ _ total := fun a b => r.le_total a b }