AFTD Auto-Formalizing Theoretical Domains

final_holding_injective

theoremverifiedformalizationimported Lean

finalState holding is 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 final_holding_injective :
    ∀ j1 j2 : Fin n, ∀ i : Fin n,
      (finalState w m).holding j1 = some i → (finalState w m).holding j2 = some i → j1 = j2
Formalizes
EconCSLib, `final_holding_injective`
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_runOver daRun, 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.finalStatefinalState: run daRun with fuel n*n + 1 from initState.
  • GS.initStateInitial state: all women free, all men start at proposal index 0.
  • initState_injectiveinitState has trivially injective holding (all none).
Used by 3

Lean source view module on GitHub

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
/-- `finalState` holding is injective. -/
lemma final_holding_injective :
    ∀ j1 j2 : Fin n, ∀ i : Fin n,
      (finalState w m).holding j1 = some i → (finalState w m).holding j2 = some i → j1 = j2 :=
  holding_injective_run w m (n * n + 1) (initState n) (initState_injective (n := n))
See it in the graphDiscuss this resultChallenge it