IndexedLOrder.isCell_of_door
theoremverifiedformalizationimported Lean
IndexedLOrder.isCell_of_door
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] in lemma IndexedLOrder.isCell_of_door (h1 : isDoorof τ D σ C) : IST.isCell τ D
- Formalizes
- EconCSLib, `IndexedLOrder.isCell_of_door`
- 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.isCell_of_door← IndexedLOrder.isCell_of_door (EconCSLib/Math/FixedPoint/Scarf.lean:279): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- 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.isDoorofIndexedLOrder.isDoorof
- IndexedLOrder.Dominant_of_subsetIndexedLOrder.Dominant_of_subset
- IndexedLOrder.Dominant_of_supsetIndexedLOrder.Dominant_of_supset
- 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
- 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 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] inlemma IndexedLOrder.isCell_of_door (h1 : isDoorof τ D σ C) : IST.isCell τ D := by cases h1 · rename_i h0 _ j h1 h3 h4 rw [h4] exact IST.Dominant_of_subset _ _ C (by simp [<-h3]) h0 · rename_i h0 _ j h1 h2' h3 rw [h2', h3] exact IST.Dominant_of_supset _ _ _ (Finset.subset_insert j C) h0