AFTD Auto-Formalizing Theoretical Domains

jinv_run

theoremverifiedformalizationimported Lean

JInv 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 jinv_run (w m : Preferences n) (fuel : ℕ) (s : DAState n) (hj : JInv m s) :
    JInv m (daRun w m fuel s)
Formalizes
EconCSLib, `jinv_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 7
  • 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.daRunRun DA for at most fuel steps, stopping early if no free men remain.
  • GS.freeMenSetThe finset of all free men in s.
  • jinv_stepJInv is preserved by one daStep.
  • GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
  • JInvJInv (Proposed → Held): once man i has proposed to woman p in some prior step, p is currently held by *someone* (possibly i,…
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] in/-- `JInv` over `daRun`. -/lemma jinv_run (w m : Preferences n) (fuel : ℕ) (s : DAState n) (hj : JInv m s) :    JInv m (daRun w m fuel s) := by  induction fuel generalizing s with  | zero   => exact hj  | succ k ih =>      simp only [daRun]; split_ifs with hne      · exact ih _ (jinv_step w m s hj)      · exact hj
See it in the graphDiscuss this resultChallenge it