AFTD Auto-Formalizing Theoretical Domains

holding_rank_mono_step

theoremverifiedformalizationimported Lean

After one daStep, woman j's held man's rank can only decrease (she only upgrades).

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_step (s : DAState n) (j : Fin n) {hval : Fin n}
    (hh : s.holding j = some hval) :
    ∃ h' : Fin n, (daStep w m s).holding j = some h' ∧
      (w.prefs j).idxOf h' ≤ (w.prefs j).idxOf hval
Formalizes
EconCSLib, `holding_rank_mono_step`
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 3

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/-- After one `daStep`, woman `j`'s held man's rank can only decrease (she only upgrades). -/lemma holding_rank_mono_step (s : DAState n) (j : Fin n) {hval : Fin n}    (hh : s.holding j = some hval) :    ∃ h' : Fin n, (daStep w m s).holding j = some h' ∧      (w.prefs j).idxOf h' ≤ (w.prefs j).idxOf hval := by  simp only [daStep]  set pl := (Finset.univ.filter (fun i =>    isFree s i && (propTarget m i (s.nextChoice i) == some j))).val.toList  cases pl.argmin (fun i => (w.prefs j).idxOf i) with  | none => exact ⟨hval, by simp [hh], le_refl _⟩  | some p =>      simp only [hh]      split_ifs with hlt      · exact ⟨p, rfl, Nat.le_of_lt hlt⟩      · exact ⟨hval, rfl, le_refl _⟩
See it in the graphDiscuss this resultChallenge it