IndexedLOrder.is_maximal_in_M_set
defimported Lean
IndexedLOrder.is_maximal_in_M_set
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open IndexedLOrder in open Classical in variable {T : Type*} [Inhabited T] in variable {I : Type*} in variable [IST : IndexedLOrder I T] in set_option quotPrecheck false in variable (σ : Finset T) (C : Finset I) in variable [DecidableEq T] [DecidableEq I] in def IndexedLOrder.is_maximal_in_M_set (τ : Finset T) (D : Finset I) (i : I) (h_nonempty : τ.Nonempty) (x : T) : Prop
- Defined in
- EconCSLib, `IndexedLOrder.is_maximal_in_M_set`
- 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.IndexedLOrder.is_maximal_in_M_set← IndexedLOrder.is_maximal_in_M_set (EconCSLib/Math/FixedPoint/Scarf.lean:364): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- IndexedLOrder.M_setIndexedLOrder.M_set
- IndexedLOrderA family of linear orders on
Tindexed byI. Eachi : Iprovides a linear orderIST i : LinearOrder Ton the typeT. This is the… - instFunLikeIndexedLOrderLinearOrderinstFunLikeIndexedLOrderLinearOrder
- Used by 3
- IndexedLOrder.maximal_element_uniqueIndexedLOrder.maximal_element_unique
- IndexedLOrder.m_element_is_maximalIndexedLOrder.m_element_is_maximal
- IndexedLOrder.m_element_not_in_tauIndexedLOrder.m_element_not_in_tau
Lean source view module on GitHub
set_option quotPrecheck false set_option hygiene false local notation lhs "<[" i "]" rhs => (IST i).lt lhs rhs local notation lhs "≤[" i "]" rhs => (IST i).le lhs rhs set_option hygiene true set_option autoImplicit true in set_option relaxedAutoImplicit true in open IndexedLOrder in open Classical in variable {T : Type*} [Inhabited T] in variable {I : Type*} in variable [IST : IndexedLOrder I T] in set_option quotPrecheck false in variable (σ : Finset T) (C : Finset I) in variable [DecidableEq T] [DecidableEq I] in def IndexedLOrder.is_maximal_in_M_set (τ : Finset T) (D : Finset I) (i : I) (h_nonempty : τ.Nonempty) (x : T) : Prop := x ∈ M_set τ D i h_nonempty ∧ ∀ y ∈ M_set τ D i h_nonempty, y ≤[i] x -- The maximal element m_i when M_i is nonempty