IndexedLOrder.Dominant_of_supset
theoremverifiedformalizationimported Lean
IndexedLOrder.Dominant_of_supset
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 omit [Inhabited T] in lemma IndexedLOrder.Dominant_of_supset (σ : Finset T) (C D: Finset I) : C ⊆ D → isDominant σ C → isDominant σ D
- Formalizes
- EconCSLib, `IndexedLOrder.Dominant_of_supset`
- 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.Dominant_of_supset← IndexedLOrder.Dominant_of_supset (EconCSLib/Math/FixedPoint/Scarf.lean:199): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- IndexedLOrder.isDominant
σis dominant with respect toC: for everyy : Tthere existsi ∈ Csuch that every element ofσis ≥[i] y — i.e.,σ… - IndexedLOrderA family of linear orders on
Tindexed byI. Eachi : Iprovides a linear orderIST i : LinearOrder Ton the typeT. This is the… - instFunLikeIndexedLOrderLinearOrderinstFunLikeIndexedLOrderLinearOrder
- IndexedLOrder.isDominant
- Used by 1
- IndexedLOrder.isCell_of_doorIndexedLOrder.isCell_of_door
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) inomit [Inhabited T] inlemma IndexedLOrder.Dominant_of_supset (σ : Finset T) (C D: Finset I) : C ⊆ D → isDominant σ C → isDominant σ D := by intro h1 h2 intro y obtain ⟨j,hj⟩:= h2 y use j,(h1 hj.1) intro x hx exact hj.2 x hx