AFTD Auto-Formalizing Theoretical Domains

Pref.ofLinearOrder

defimported Lean

Bundle an explicit linear order as a preference.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
def Pref.ofLinearOrder {A : Type*} (r : LinearOrder A) : Pref A
Defined in
EconCSLib, `Pref.ofLinearOrder`
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
Built on 3
  • IsPreferenceA weak preference relation is admissible if it is reflexive, transitive, and total.
  • 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 linear order as a preference. -/
def Pref.ofLinearOrder {A : Type*} (r : LinearOrder A) : Pref A where
  rel := fun a b => @LE.le A r.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 }
See it in the graphDiscuss this resultChallenge it