AFTD Auto-Formalizing Theoretical Domains

initState_injective

theoremverifiedformalizationimported Lean

initState has trivially injective holding (all none).

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 initState_injective :
    ∀ j1 j2 : Fin n, ∀ i : Fin n,
      (initState n).holding j1 = some i → (initState n).holding j2 = some i → j1 = j2
Formalizes
EconCSLib, `initState_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
propext
Built on 3
  • GS.initStateInitial state: all women free, all men start at proposal index 0.
  • 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 4

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/-- `initState` has trivially injective holding (all `none`). -/lemma initState_injective :    ∀ j1 j2 : Fin n, ∀ i : Fin n,      (initState n).holding j1 = some i → (initState n).holding j2 = some i → j1 = j2 := by  intro j1 j2 i h1; simp [initState] at h1
See it in the graphDiscuss this resultChallenge it