IndexedLOrder.collision_door_valid
theoremverifiedformalizationimported Lean
IndexedLOrder.collision_door_valid
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 open Classical in variable (c : T → I) (σ : Finset T) (C : Finset I) in variable {c σ C} in omit [DecidableEq T] [Inhabited T] in lemma IndexedLOrder.collision_door_valid [DecidableEq T] (σ : Finset T) (C : Finset I) (_ : T → I) (x : T) (h_cell : isCell σ C) (hx_in_σ : x ∈ σ) (h_card_eq : C.card = σ.card) : isDoorof (σ.erase x) C σ C
- Formalizes
- EconCSLib, `IndexedLOrder.collision_door_valid`
- 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.collision_door_valid← IndexedLOrder.collision_door_valid (EconCSLib/Math/FixedPoint/Scarf.lean:1608): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- IndexedLOrder.isDoorofIndexedLOrder.isDoorof
- IndexedLOrder.Dominant_of_subsetIndexedLOrder.Dominant_of_subset
- 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… - instFunLikeIndexedLOrderLinearOrderinstFunLikeIndexedLOrderLinearOrder
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 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] inopen Classical invariable (c : T → I) (σ : Finset T) (C : Finset I) invariable {c σ C} inomit [DecidableEq T] [Inhabited T] inlemma IndexedLOrder.collision_door_valid [DecidableEq T] (σ : Finset T) (C : Finset I) (_ : T → I) (x : T) (h_cell : isCell σ C) (hx_in_σ : x ∈ σ) (h_card_eq : C.card = σ.card) : isDoorof (σ.erase x) C σ C := by apply isDoorof.idoor h_cell · constructor · exact Dominant_of_subset σ (σ.erase x) C (Finset.erase_subset x σ) h_cell · rw [h_card_eq] rw [Finset.card_erase_of_mem hx_in_σ] exact (Nat.sub_add_cancel (Finset.card_pos.mpr ⟨x, hx_in_σ⟩)).symm · exact Finset.notMem_erase x σ · exact Finset.insert_erase hx_in_σ · rfl-- Lemma 7