AFTD Auto-Formalizing Theoretical Domains

RepresentsPreference.lt_iff

theoremverifiedformalizationimported Lean

A utility representation preserves strict preference.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
theorem RepresentsPreference.lt_iff [Preorder A] [Preorder V'] {u : A → V'}
    (h : RepresentsPreference u) (a b : A) :
    a < b ↔ u a < u b
Formalizes
EconCSLib, `RepresentsPreference.lt_iff`
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.
What was changed in RepresentsPreference.lt_iff
--- EconCSLib/Foundation/Preference.lean:191 (RepresentsPreference.lt_iff)
+++ as compiled here
@@ -1,3 +1,4 @@
-/-- A utility representation preserves strict preference. -/
-theorem RepresentsPreference.lt_iff [Preorder A] [Preorder V] {u : A → V}
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+theorem RepresentsPreference.lt_iff [Preorder A] [Preorder V'] {u : A → V'}
     (h : RepresentsPreference u) (a b : A) :
Verified
08 Oct 2026
Axioms
propext
Built on 1
  • RepresentsPreferenceA utility function u : A → V represents the preference ≤ on A if a ≤ b ↔ u a ≤ u b. [MSZ 2.7]

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true in/-- A utility representation preserves strict preference. -/theorem RepresentsPreference.lt_iff [Preorder A] [Preorder V'] {u : A → V'}    (h : RepresentsPreference u) (a b : A) :    a < b ↔ u a < u b := by  rw [Preorder.lt_iff_le_not_ge, Preorder.lt_iff_le_not_ge, h.le_iff, h.le_iff]
See it in the graphDiscuss this resultChallenge it