Indifferent
defimported Lean
Two outcomes are indifferent under a preorder: a ≤ b ∧ b ≤ a. In a PartialOrder this implies a = b; in a general Preorder it does not. [MSZ 2.5]
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {A : Type*} [Preorder A] in def Indifferent (a b : A) : Prop
- Defined in
- EconCSLib, `Indifferent`
- 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.Indifferent← Indifferent (EconCSLib/Foundation/Preference.lean:76): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 4
- Indifferent.transIndifference is transitive.
- RepresentsPreference.indifferent_iffA utility representation preserves indifference.
- Indifferent.reflIndifference is reflexive.
- Indifferent.symmIndifference is symmetric.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {A : Type*} [Preorder A] in /-- Two outcomes are indifferent under a preorder: `a ≤ b ∧ b ≤ a`. In a `PartialOrder` this implies `a = b`; in a general `Preorder` it does not. [MSZ 2.5] -/ def Indifferent (a b : A) : Prop := a ≤ b ∧ b ≤ a