AFTD Auto-Formalizing Theoretical Domains

GS.mem_freeMenSet

theoremverifiedformalizationimported Lean

GS.mem_freeMenSet

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
lemma GS.mem_freeMenSet {n : ℕ} {s : DAState n} {i : Fin n} :
    i ∈ freeMenSet s ↔ isFree s i = true
Formalizes
EconCSLib, `GS.mem_freeMenSet`
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
  • GS.freeMenSetThe finset of all free men in s.
  • GS.isFreeMan i is free in s iff no woman holds him.
  • GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
Used by 2
  • nc_sum_increase∑ nextChoice strictly increases when free men exist.
  • finalState_no_free_menAt termination, every man is held (no free man remains). Proof: if a free man remained, nc_sum_grows would give n*n + 1 ≤ n*n,…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inlemma GS.mem_freeMenSet {n : ℕ} {s : DAState n} {i : Fin n} :    i ∈ freeMenSet s ↔ isFree s i = true := by simp [freeMenSet]
See it in the graphDiscuss this resultChallenge it