AFTD Auto-Formalizing Theoretical Domains

IndexedLOrder.isRoom_of_Door

theoremverifiedformalizationimported Lean

IndexedLOrder.isRoom_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
variable {σ C} in
omit [Inhabited T] in
lemma IndexedLOrder.isRoom_of_Door (h1 : isDoorof τ D σ C) : IST.isRoom σ C
Formalizes
EconCSLib, `IndexedLOrder.isRoom_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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6
  • 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.isRoom(σ, C) is a room: a dominant cell with |σ| = |C|. In a room, the index set and the point set have the same cardinality. Colorful…
  • IndexedLOrder.isCellAlias for isDominant σ C: the cell predicate for the pair (σ, C).
  • 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) invariable [DecidableEq T] [DecidableEq I] invariable {σ C} inomit [Inhabited T] inlemma IndexedLOrder.isRoom_of_Door (h1 : isDoorof τ D σ C) : IST.isRoom σ C := by  cases h1  · rename_i h0 h2 x h3 h4 h5    constructor    · exact h0    · simp only [<-h5, h2.2, <-h4, h3, not_false_eq_true, Finset.card_insert_of_notMem]  · rename_i h0 h2 x h3 h4 h5    constructor    · exact h0    · have h6 := Finset.card_insert_of_notMem h3      subst h4      replace h5 : D.card = (insert x C).card := by rw [h5]      rw [h6] at h5      rw [h2.2] at h5      exact Eq.symm $ (add_left_inj _).1 h5
See it in the graphDiscuss this resultChallenge it