AFTD Auto-Formalizing Theoretical Domains

IndexedLOrder.maximal_element_unique

theoremverifiedformalizationimported Lean

IndexedLOrder.maximal_element_unique

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
omit [Inhabited T] [DecidableEq T] [DecidableEq I] in
lemma IndexedLOrder.maximal_element_unique [Fintype T] (τ : Finset T) (D : Finset I) (i : I)
    (h_nonempty : τ.Nonempty) (h_M_nonempty : (M_set τ D i h_nonempty).Nonempty)
    (x : T) (h_x_max : is_maximal_in_M_set τ D i h_nonempty x) :
    x = m_element τ D i h_nonempty h_M_nonempty
Formalizes
EconCSLib, `IndexedLOrder.maximal_element_unique`
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
Classical.choiceQuot.soundpropext
Built on 6

Lean source view module on GitHub

set_option quotPrecheck falseset_option hygiene falselocal notation  lhs "<[" i "]" rhs => (IST i).lt lhs rhslocal notation  lhs "≤[" i "]" rhs => (IST i).le lhs rhsset_option hygiene trueset_option autoImplicit true inset_option relaxedAutoImplicit true inopen IndexedLOrder inopen Classical invariable {T : Type*} [Inhabited T] invariable {I : Type*} invariable [IST : IndexedLOrder I T] inset_option quotPrecheck false invariable (σ : Finset T) (C : Finset I) invariable [DecidableEq T] [DecidableEq I] inomit [Inhabited T] [DecidableEq T] [DecidableEq I] inlemma IndexedLOrder.maximal_element_unique [Fintype T] (τ : Finset T) (D : Finset I) (i : I)    (h_nonempty : τ.Nonempty) (h_M_nonempty : (M_set τ D i h_nonempty).Nonempty)    (x : T) (h_x_max : is_maximal_in_M_set τ D i h_nonempty x) :    x = m_element τ D i h_nonempty h_M_nonempty := by  let m_i := m_element τ D i h_nonempty h_M_nonempty  have h_mi_max : is_maximal_in_M_set τ D i h_nonempty m_i :=    m_element_is_maximal τ D i h_nonempty h_M_nonempty  letI := IST i  have h_x_in_M : x ∈ M_set τ D i h_nonempty := h_x_max.1  have h_mi_in_M : m_i ∈ M_set τ D i h_nonempty := h_mi_max.1  have h_x_le_mi : x ≤[i] m_i := h_mi_max.2 x h_x_in_M  have h_mi_le_x : m_i ≤[i] x := h_x_max.2 m_i h_mi_in_M  exact le_antisymm h_x_le_mi h_mi_le_x
See it in the graphDiscuss this resultChallenge it