AFTD Auto-Formalizing Theoretical Domains

rsinv_run

theoremverifiedformalizationimported Lean

RSInv over daRun.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
open GS in
variable {n : ℕ} [NeZero n] in
lemma rsinv_run (w m : Preferences n) (fuel : ℕ) (s : DAState n)
    (hrs : RSInv w m s)
    (hnc0 : ∀ k : Fin n, s.nextChoice k ≤ n)
    (hj : JInv m s)
    (hinj : ∀ j1 j2 k : Fin n, s.holding j1 = some k → s.holding j2 = some k → j1 = j2) :
    RSInv w m (daRun w m fuel s)
Formalizes
EconCSLib, `rsinv_run`
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 11
  • holding_injective_stepIn daStep, holding remains injective.
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.
  • GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
  • RSInvRSInv (the deferred-acceptance rank invariant — the engine of the stability proof): for every man j and every woman i that j has…
  • JInvJInv (Proposed → Held): once man i has proposed to woman p in some prior step, p is currently held by *someone* (possibly i,…
  • GS.daRunRun DA for at most fuel steps, stopping early if no free men remain.
  • GS.freeMenSetThe finset of all free men in s.
  • 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…
  • rsinv_stepRSInv is preserved by one daStep.
  • daStep_nc_le_nnextChoice i ≤ n for daStep.
  • jinv_stepJInv is preserved by one daStep.
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] in/-- RSInv over daRun. -/lemma rsinv_run (w m : Preferences n) (fuel : ℕ) (s : DAState n)    (hrs : RSInv w m s)    (hnc0 : ∀ k : Fin n, s.nextChoice k ≤ n)    (hj : JInv m s)    (hinj : ∀ j1 j2 k : Fin n, s.holding j1 = some k → s.holding j2 = some k → j1 = j2) :    RSInv w m (daRun w m fuel s) := by  induction fuel generalizing s with  | zero => exact hrs  | succ k ih =>      simp only [daRun]; split_ifs with hne      · apply ih        · exact rsinv_step w m s hrs hnc0        · exact daStep_nc_le_n w m s hnc0 hj hinj        · exact jinv_step w m s hj        · exact holding_injective_step w m s hinj      · exact hrs
See it in the graphDiscuss this resultChallenge it