nc_le_n_run
theoremverifiedformalizationimported Lean
nextChoice i ≤ n 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 nc_le_n_run (w m : Preferences n) (fuel : ℕ) (s : DAState n) (hnc0 : ∀ i : Fin n, s.nextChoice i ≤ n) (hj : JInv m s) (hinj : ∀ j1 j2 k : Fin n, s.holding j1 = some k → s.holding j2 = some k → j1 = j2) (i : Fin n) : (daRun w m fuel s).nextChoice i ≤ n
- Formalizes
- EconCSLib, `nc_le_n_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.nc_le_n_run← nc_le_n_run (EconCSLib/MarketDesign/Matching/GaleShapley.lean:582): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- holding_injective_stepIn
daStep,holdingremains injective. - GS.PreferencesList-based preferences:
prefs iis a full permutation ofFin n, ordered from most to least preferred. - GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
- JInvJInv (Proposed → Held): once man
ihas proposed to womanpin some prior step,pis currently held by *someone* (possiblyi,… - GS.daRunRun DA for at most
fuelsteps, 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…
- daStep_nc_le_n
nextChoice i ≤ nfordaStep. - jinv_step
JInvis preserved by onedaStep.
- holding_injective_stepIn
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] in/-- `nextChoice i ≤ n` over `daRun`. -/lemma nc_le_n_run (w m : Preferences n) (fuel : ℕ) (s : DAState n) (hnc0 : ∀ i : Fin n, s.nextChoice i ≤ n) (hj : JInv m s) (hinj : ∀ j1 j2 k : Fin n, s.holding j1 = some k → s.holding j2 = some k → j1 = j2) (i : Fin n) : (daRun w m fuel s).nextChoice i ≤ n := by induction fuel generalizing s with | zero => exact hnc0 i | succ k ih => simp only [daRun]; split_ifs with hne · exact ih _ (daStep_nc_le_n w m s hnc0 hj hinj) (jinv_step w m s hj) (holding_injective_step w m s hinj) · exact hnc0 i