AFTD Auto-Formalizing Theoretical Domains

GS.daStep_nc_free

theoremverifiedformalizationimported Lean

GS.daStep_nc_free

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
lemma GS.daStep_nc_free {n : ℕ} {w m : Preferences n} {s : DAState n} {i : Fin n}
    (hi : isFree s i = true) : (daStep w m s).nextChoice i = s.nextChoice i + 1
Formalizes
EconCSLib, `GS.daStep_nc_free`
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
  • GS.daStepOne step of standard men-proposing DA. All free men propose; women pick the best of {held, new proposers} by rank; free men advance their…
  • GS.propTargetThe woman man i proposes to at cursor index k (none if out of bounds).
  • GS.isFreeMan i is free in s iff no woman holds him.
  • GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.
Used by 6
  • holdinv_stepHoldInv is preserved by one DA step. Proof structure: case-analyze on the pair (s.holding p, bestNew p) that drives daStep's…
  • nc_sum_increase∑ nextChoice strictly increases when free men exist.
  • jinv_stepJInv is preserved by one daStep.
  • GS.daStep_NoAchievableRejectionInductive step (KEY LEMMA). NoAchievableRejection is preserved by one daStep. Also threads HoldInv (for the old-holder index…
  • daStep_nc_le_nnextChoice i ≤ n for daStep.
  • rsinv_stepRSInv is preserved by one daStep.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inlemma GS.daStep_nc_free {n : ℕ} {w m : Preferences n} {s : DAState n} {i : Fin n}    (hi : isFree s i = true) : (daStep w m s).nextChoice i = s.nextChoice i + 1 := by  simp [daStep, hi]
See it in the graphDiscuss this resultChallenge it