IndexedLOrder.m_element_not_in_tau
theoremverifiedformalizationimported Lean
IndexedLOrder.m_element_not_in_tau
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] in lemma IndexedLOrder.m_element_not_in_tau [Fintype T] (τ : Finset T) (D : Finset I) (i a b : I) (h_door : IST.isDoor τ D) (h_nonempty : τ.Nonempty) (ha_mem : a ∈ D) (hb_mem : b ∈ D) (hab : a ≠ b) (h_eq_mini : mini h_nonempty a = mini h_nonempty b) (h_M_nonempty : (M_set τ D i h_nonempty).Nonempty) (h_i_is : i = a ∨ i = b) : m_element τ D i h_nonempty h_M_nonempty ∉ τ
- Formalizes
- EconCSLib, `IndexedLOrder.m_element_not_in_tau`
- 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_not_in_tau← IndexedLOrder.m_element_not_in_tau (EconCSLib/Math/FixedPoint/Scarf.lean:708): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- IndexedLOrder.isDoor
(σ, C)is a door: a dominant cell with|C| = |σ| + 1. A door has one more color than points; it is adjacent to exactly two rooms… - IndexedLOrder.M_setIndexedLOrder.M_set
- IndexedLOrder.m_element_is_maximalIndexedLOrder.m_element_is_maximal
- IndexedLOrder.m_elementIndexedLOrder.m_element
- IndexedLOrder.is_maximal_in_M_setIndexedLOrder.is_maximal_in_M_set
- IndexedLOrder.isCellAlias for
isDominant σ C: the cell predicate for the pair(σ, C). - IndexedLOrderA family of linear orders on
Tindexed byI. Eachi : Iprovides a linear orderIST i : LinearOrder Ton the typeT. This is the… - IndexedLOrder.miniIndexedLOrder.mini
- instFunLikeIndexedLOrderLinearOrderinstFunLikeIndexedLOrderLinearOrder
- IndexedLOrder.isDoor
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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] inlemma IndexedLOrder.m_element_not_in_tau [Fintype T] (τ : Finset T) (D : Finset I) (i a b : I) (h_door : IST.isDoor τ D) (h_nonempty : τ.Nonempty) (ha_mem : a ∈ D) (hb_mem : b ∈ D) (hab : a ≠ b) (h_eq_mini : mini h_nonempty a = mini h_nonempty b) (h_M_nonempty : (M_set τ D i h_nonempty).Nonempty) (h_i_is : i = a ∨ i = b) : m_element τ D i h_nonempty h_M_nonempty ∉ τ := by let m_i := m_element τ D i h_nonempty h_M_nonempty have h_max : is_maximal_in_M_set τ D i h_nonempty m_i := m_element_is_maximal τ D i h_nonempty h_M_nonempty intro h_m_in_tau obtain ⟨k, hk_mem, hk_dom⟩ := h_door.1 m_i by_cases hk_eq_i : k = i · subst hk_eq_i have h_m_le_mini : m_i ≤[k] mini h_nonempty k := hk_dom (mini h_nonempty k) (by unfold mini exact @Finset.min'_mem _ (IST k) _ h_nonempty) have h_m_eq_mini : m_i = mini h_nonempty k := by letI := IST k have h_mini_le_m : mini h_nonempty k ≤[k] m_i := Finset.min'_le τ m_i h_m_in_tau exact le_antisymm h_m_le_mini h_mini_le_m have h_m_in_M : m_i ∈ M_set τ D k h_nonempty := h_max.1 unfold M_set at h_m_in_M cases h_i_is with | inl hi_eq_a => subst hi_eq_a have h_mini_b_lt_m : mini h_nonempty b <[b] m_i := h_m_in_M b hb_mem hab.symm rw [h_m_eq_mini, h_eq_mini] at h_mini_b_lt_m letI := IST b exact lt_irrefl (mini h_nonempty b) h_mini_b_lt_m | inr hi_eq_b => subst hi_eq_b have h_mini_a_lt_m : mini h_nonempty a <[a] m_i := h_m_in_M a ha_mem hab rw [h_m_eq_mini, ← h_eq_mini] at h_mini_a_lt_m letI := IST a exact lt_irrefl (mini h_nonempty a) h_mini_a_lt_m · have h_m_in_M : m_i ∈ M_set τ D i h_nonempty := h_max.1 unfold M_set at h_m_in_M have h_mini_k_lt_m : mini h_nonempty k <[k] m_i := h_m_in_M k hk_mem hk_eq_i have h_m_le_mini_k : m_i ≤[k] mini h_nonempty k := hk_dom (mini h_nonempty k) (by unfold mini exact @Finset.min'_mem _ (IST k) _ h_nonempty) letI := IST k exact not_le.mpr h_mini_k_lt_m h_m_le_mini_k