AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • IndexedLOrder.isDominantσ is dominant with respect to C: for every y : T there exists i ∈ C such that every element of σ is ≥[i] y — i.e., σ…
  • IndexedLOrderA family of linear orders on T indexed by I. Each i : I provides a linear order IST i : LinearOrder T on the type T. This is the…
  • instFunLikeIndexedLOrderLinearOrderinstFunLikeIndexedLOrderLinearOrder
Used by 1

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it