AFTD Auto-Formalizing Theoretical Domains

holding_injective_run

theoremverifiedformalizationimported Lean

Over daRun, holding remains injective.

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_injective_run (fuel : ℕ) (s : DAState n)
    (hinj : ∀ j1 j2 : Fin n, ∀ i : Fin n,
      s.holding j1 = some i → s.holding j2 = some i → j1 = j2) :
    ∀ j1 j2 : Fin n, ∀ i : Fin n,
      (daRun w m fuel s).holding j1 = some i → (daRun w m fuel s).holding j2 = some i → j1 = j2
Formalizes
EconCSLib, `holding_injective_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
  • 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.
  • 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…
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] invariable (w m : Preferences n) in/-- Over `daRun`, holding remains injective. -/lemma holding_injective_run (fuel : ℕ) (s : DAState n)    (hinj : ∀ j1 j2 : Fin n, ∀ i : Fin n,      s.holding j1 = some i → s.holding j2 = some i → j1 = j2) :    ∀ j1 j2 : Fin n, ∀ i : Fin n,      (daRun w m fuel s).holding j1 = some i → (daRun w m fuel s).holding j2 = some i → j1 = j2 := by  induction fuel generalizing s with  | zero   => exact hinj  | succ k ih =>      simp only [daRun]      split_ifs with hne      · exact ih (daStep w m s) (holding_injective_step w m s hinj)      · exact hinj
See it in the graphDiscuss this resultChallenge it