AFTD Auto-Formalizing Theoretical Domains

IndexedLOrder.M_sets_disjoint

theoremverifiedformalizationimported Lean

IndexedLOrder.M_sets_disjoint

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] in
lemma IndexedLOrder.M_sets_disjoint [Fintype T] (τ : Finset T) (D : Finset I) (a b : I)
    (h_nonempty : τ.Nonempty) (h_door : IST.isDoor τ D)
    (ha : a ∈ D) (hb : b ∈ D) (hab : a ≠ b)
    (h_eq : mini h_nonempty a = mini h_nonempty b) :
    M_set τ D a h_nonempty ∩ M_set τ D b h_nonempty = ∅
Formalizes
EconCSLib, `IndexedLOrder.M_sets_disjoint`
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

Lean source view module on GitHub

set_option quotPrecheck falseset_option hygiene falselocal notation  lhs "<[" i "]" rhs => (IST i).lt lhs rhslocal notation  lhs "≤[" i "]" rhs => (IST i).le lhs rhsset_option hygiene trueset_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] inlemma IndexedLOrder.M_sets_disjoint [Fintype T] (τ : Finset T) (D : Finset I) (a b : I)    (h_nonempty : τ.Nonempty) (h_door : IST.isDoor τ D)    (ha : a ∈ D) (hb : b ∈ D) (hab : a ≠ b)    (h_eq : mini h_nonempty a = mini h_nonempty b) :    M_set τ D a h_nonempty ∩ M_set τ D b h_nonempty = ∅ := by  ext y  simp only [Set.mem_inter_iff, Set.mem_empty_iff_false]  constructor  · intro ⟨h_in_a, h_in_b⟩    unfold M_set at h_in_a h_in_b    have h_b_ne_a : b ≠ a := hab.symm    have h_mini_b_lt_y : mini h_nonempty b <[b] y := h_in_a b hb h_b_ne_a    have h_mini_a_lt_y : mini h_nonempty a <[a] y := h_in_b a ha hab    rw [h_eq] at h_mini_a_lt_y    obtain ⟨k, hk_in_D, hk_dom⟩ := h_door.1 y    have h_mini_b_mem : mini h_nonempty b ∈ τ := by      unfold mini      exact @Finset.min'_mem _ (IST b) _ h_nonempty    have h_y_le_mini_b : y ≤[k] mini h_nonempty b := hk_dom (mini h_nonempty b) h_mini_b_mem    by_cases hk_eq_a : k = a    · subst hk_eq_a      letI := IST k      exact not_le.mpr h_mini_a_lt_y h_y_le_mini_b    · by_cases hk_eq_b : k = b      · subst hk_eq_b        letI := IST k        exact not_le.mpr h_mini_b_lt_y h_y_le_mini_b      · have h_mini_k_lt_y : mini h_nonempty k <[k] y := h_in_a k hk_in_D hk_eq_a        have h_mini_k_mem : mini h_nonempty k ∈ τ := by          unfold mini          exact @Finset.min'_mem _ (IST k) _ h_nonempty        have h_y_le_mini_k : y ≤[k] mini h_nonempty k := hk_dom (mini h_nonempty k) h_mini_k_mem        letI := IST k        exact not_le.mpr h_mini_k_lt_y h_y_le_mini_k  · intro h    exact False.elim h
See it in the graphDiscuss this resultChallenge it