IndexedLOrder.isInternalDoor
abbrevimported Lean
IndexedLOrder.isInternalDoor
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 variable (τ D) in abbrev IndexedLOrder.isInternalDoor
- Defined in
- EconCSLib, `IndexedLOrder.isInternalDoor`
- 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.isInternalDoor← IndexedLOrder.isInternalDoor (EconCSLib/Math/FixedPoint/Scarf.lean:326): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- 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… - 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
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 variable (τ D) in abbrev IndexedLOrder.isInternalDoor := IST.isDoor τ D ∧ τ.Nonempty /- Lemma 2-/