AFTD Auto-Formalizing Theoretical Domains

holding_rank_mono_run

theoremverifiedformalizationimported Lean

Rank-mono over any daRun.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
open GS in
variable {n : ℕ} [NeZero n] in
variable (w m : Preferences n) in
lemma holding_rank_mono_run (fuel : ℕ) (s : DAState n) (j : Fin n) {hval : Fin n}
    (hh : s.holding j = some hval) :
    ∃ h' : Fin n, (daRun w m fuel s).holding j = some h' ∧
      (w.prefs j).idxOf h' ≤ (w.prefs j).idxOf hval
Formalizes
EconCSLib, `holding_rank_mono_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 6
  • 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.
  • 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.
  • holding_rank_mono_stepAfter one daStep, woman j's held man's rank can only decrease (she only upgrades).
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] invariable (w m : Preferences n) in/-- Rank-mono over any `daRun`. -/lemma holding_rank_mono_run (fuel : ℕ) (s : DAState n) (j : Fin n) {hval : Fin n}    (hh : s.holding j = some hval) :    ∃ h' : Fin n, (daRun w m fuel s).holding j = some h' ∧      (w.prefs j).idxOf h' ≤ (w.prefs j).idxOf hval := by  induction fuel generalizing s hval with  | zero   => exact ⟨hval, hh, le_refl _⟩  | succ k ih =>      simp only [daRun]      split_ifs with hne      · obtain ⟨h1, hh1, hrk1⟩ := holding_rank_mono_step w m s j hh        obtain ⟨h2, hh2, hrk2⟩ := ih (daStep w m s) hh1        exact ⟨h2, hh2, Nat.le_trans hrk2 hrk1⟩      · exact ⟨hval, hh, le_refl _⟩
See it in the graphDiscuss this resultChallenge it