AFTD Auto-Formalizing Theoretical Domains

IndexedLOrder.m_element_is_maximal

theoremverifiedformalizationimported Lean

IndexedLOrder.m_element_is_maximal

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
theorem IndexedLOrder.m_element_is_maximal [Fintype T] (τ : Finset T) (D : Finset I) (i : I) (h_nonempty : τ.Nonempty)
    (h : (M_set τ D i h_nonempty).Nonempty) :
    is_maximal_in_M_set τ D i h_nonempty (m_element τ D i h_nonempty h)
Formalizes
EconCSLib, `IndexedLOrder.m_element_is_maximal`
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 5
Used by 2

Lean source view module on GitHub

set_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] intheorem IndexedLOrder.m_element_is_maximal [Fintype T] (τ : Finset T) (D : Finset I) (i : I) (h_nonempty : τ.Nonempty)    (h : (M_set τ D i h_nonempty).Nonempty) :    is_maximal_in_M_set τ D i h_nonempty (m_element τ D i h_nonempty h) := by  unfold is_maximal_in_M_set m_element  let s_finset := (M_set τ D i h_nonempty).toFinset  have h_nonempty_finset: s_finset.Nonempty := Set.toFinset_nonempty.mpr h  constructor  · rw [←Set.mem_toFinset]    exact @Finset.max'_mem _ (IST i) s_finset h_nonempty_finset  · intros y hy    rw [←Set.mem_toFinset] at hy    apply @Finset.le_max' _ (IST i)    exact hy-- Sublemma 3.1: τ is dominant with respect to D - i iff i ∈ {a,b} and M_i = ∅
See it in the graphDiscuss this resultChallenge it