AFTD Auto-Formalizing Theoretical Domains

GS.daStep_holding

theoremverifiedformalizationimported Lean

One step of DA: woman p's new holding, expanded once. This is the workhorse rewrite for any proof that needs to case-split on what (daStep w m s).holding p is. It unfolds the outermost match inside daStep's newHolding. The statement does inline the auxiliary proposerList / bestNew formulae verbatim; downstream proofs re-abbreviate them with set *after* rewriting (see holdinv_step). The match shape is: `` match s.holding p, bestNew p with | none, none => none -- still free | some h, none => some h -- old hold kept | none, some q => some q -- new proposer | some h, some q => if rank q < rank h then q else h -- upgrade? ` where bestNew p = (proposerList p).argmin (rank in w.prefs p) and proposerList p is the list of free men who proposed to p this step. Provable by rfl because daStep is noncomputable def and the body is a sequence of lets ending in a structure literal whose .holding p projects directly to the inner match`.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
lemma GS.daStep_holding {n : ℕ} (w m : Preferences n) (s : DAState n) (p : Fin n) :
    (daStep w m s).holding p =
      (match s.holding p,
        ((Finset.univ.filter (fun i : Fin n =>
            isFree s i && (propTarget m i (s.nextChoice i) == some p))).val.toList).argmin
          (fun i => (w.prefs p).idxOf i) with
        | none,   none   => none
        | some h, none   => some h
        | none,   some q => some q
        | some h, some q =>
            if (w.prefs p).idxOf q < (w.prefs p).idxOf h then some q else some h)
Formalizes
EconCSLib, `GS.daStep_holding`
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 2
  • holdinv_stepHoldInv is preserved by one DA step. Proof structure: case-analyze on the pair (s.holding p, bestNew p) that drives daStep's…
  • GS.daStep_NoAchievableRejectionInductive step (KEY LEMMA). NoAchievableRejection is preserved by one daStep. Also threads HoldInv (for the old-holder index…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
/-- One step of DA: woman `p`'s new holding, expanded once. This is the workhorse rewrite for any proof that needs to case-split on what `(daStep w m s).holding p` is. It unfolds the outermost `match` inside `daStep`'s `newHolding`. The statement **does inline** the auxiliary `proposerList` / `bestNew` formulae verbatim; downstream proofs re-abbreviate them with `set` *after* rewriting (see `holdinv_step`). The match shape is: ``` match s.holding p, bestNew p with | none, none => none -- still free | some h, none => some h -- old hold kept | none, some q => some q -- new proposer | some h, some q => if rank q < rank h then q else h -- upgrade? ``` where `bestNew p = (proposerList p).argmin (rank in w.prefs p)` and `proposerList p` is the list of free men who proposed to `p` this step. Provable by `rfl` because `daStep` is `noncomputable def` and the body is a sequence of `let`s ending in a structure literal whose `.holding p` projects directly to the inner `match`. -/
lemma GS.daStep_holding {n : ℕ} (w m : Preferences n) (s : DAState n) (p : Fin n) :
    (daStep w m s).holding p =
      (match s.holding p,
        ((Finset.univ.filter (fun i : Fin n =>
            isFree s i && (propTarget m i (s.nextChoice i) == some p))).val.toList).argmin
          (fun i => (w.prefs p).idxOf i) with
        | none,   none   => none
        | some h, none   => some h
        | none,   some q => some q
        | some h, some q =>
            if (w.prefs p).idxOf q < (w.prefs p).idxOf h then some q else some h) := rfl
See it in the graphDiscuss this resultChallenge it