IndexedLOrder.m_element
defimported Lean
IndexedLOrder.m_element
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 noncomputable def IndexedLOrder.m_element [Fintype T] (τ : Finset T) (D : Finset I) (i : I) (h_nonempty : τ.Nonempty) (h : (M_set τ D i h_nonempty).Nonempty) : T
- Defined in
- EconCSLib, `IndexedLOrder.m_element`
- 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.m_element← IndexedLOrder.m_element (EconCSLib/Math/FixedPoint/Scarf.lean:368): 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 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 noncomputable def IndexedLOrder.m_element [Fintype T] (τ : Finset T) (D : Finset I) (i : I) (h_nonempty : τ.Nonempty) (h : (M_set τ D i h_nonempty).Nonempty) : T := @Finset.max' _ (IST i) (M_set τ D i h_nonempty).toFinset (Set.toFinset_nonempty.mpr h) -- Theorem: m_element is indeed the maximal element