AFTD Auto-Formalizing Theoretical Domains

holdinv_init

theoremverifiedformalizationimported Lean

holdinv_init

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
open GS in
variable {n : ℕ} [NeZero n] in
lemma holdinv_init (m : Preferences n) : HoldInv m (initState n)
Formalizes
EconCSLib, `holdinv_init`
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 4
  • 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.
  • HoldInvHoldInv (Held → Proposed): if woman p currently holds man j, then j must already have proposed to p — i.e., p is in the…
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] inlemma holdinv_init (m : Preferences n) : HoldInv m (initState n) := by  intro j p hp; simp [initState] at hp
See it in the graphDiscuss this resultChallenge it