AFTD Auto-Formalizing Theoretical Domains

daStep_nc_le_n

theoremverifiedformalizationimported Lean

nextChoice i ≤ n for daStep.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
open GS in
variable {n : ℕ} [NeZero n] in
lemma daStep_nc_le_n (w m : Preferences n) (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) : (daStep w m s).nextChoice i ≤ n
Formalizes
EconCSLib, `daStep_nc_le_n`
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 8
  • 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.daStep_nc_heldGS.daStep_nc_held
  • not_free_of_nc_genextChoice i ≥ n + injectivity + JInv → man i is not free.
  • GS.daStep_nc_freeGS.daStep_nc_free
  • GS.isFreeMan i is free in s iff no woman holds him.
  • 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.
Used by 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] in/-- `nextChoice i ≤ n` for `daStep`. -/lemma daStep_nc_le_n (w m : Preferences n) (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) : (daStep w m s).nextChoice i ≤ n := by  by_cases hfi : isFree s i = true  · rw [daStep_nc_free hfi]    by_contra h_gt; push_neg at h_gt    exact absurd (not_free_of_nc_ge m s i hj hinj (by omega)) (by simp [hfi])  · rw [daStep_nc_held (by simpa using hfi)]; exact hnc0 i
See it in the graphDiscuss this resultChallenge it