AFTD Auto-Formalizing Theoretical Domains

IndexedLOrder.outsidedoor_is_singleton

theoremverifiedformalizationimported Lean

IndexedLOrder.outsidedoor_is_singleton

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] [DecidableEq T] [DecidableEq I] in
lemma IndexedLOrder.outsidedoor_is_singleton (h : IST.isOutsideDoor τ  D) :  τ = Finset.empty ∧  ∃ i, D = {i}
Formalizes
EconCSLib, `IndexedLOrder.outsidedoor_is_singleton`
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 5

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] inomit [Inhabited T] [DecidableEq T] [DecidableEq I] inlemma IndexedLOrder.outsidedoor_is_singleton (h : IST.isOutsideDoor τ  D) :  τ = Finset.empty ∧  ∃ i, D = {i} := by  obtain ⟨h1, h2⟩ := h  subst h2  obtain ⟨_,h3⟩ := h1  replace h4 : D.card = 1 := by    simp_all    rfl  exact ⟨rfl, Finset.card_eq_one.1 h4⟩
See it in the graphDiscuss this resultChallenge it