GS.isFree_iff
theoremverifiedformalizationimported Lean
GS.isFree_iff
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open List Finset in lemma GS.isFree_iff {n : ℕ} (s : DAState n) (i : Fin n) : isFree s i = true ↔ ∀ j : Fin n, s.holding j ≠ some i
- Formalizes
- EconCSLib, `GS.isFree_iff`
- 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.GS.isFree_iff← GS.isFree_iff (EconCSLib/MarketDesign/Matching/GaleShapley.lean:134): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 2
- GS.isFreeMan
iis free insiff no woman holds him. - GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
- GS.isFreeMan
- Used by 2
- GS.daStep_NoAchievableRejectionInductive step (KEY LEMMA).
NoAchievableRejectionis preserved by onedaStep. Also threadsHoldInv(for the old-holder index… - holding_injective_stepIn
daStep,holdingremains injective.
- GS.daStep_NoAchievableRejectionInductive step (KEY LEMMA).
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 inlemma GS.isFree_iff {n : ℕ} (s : DAState n) (i : Fin n) : isFree s i = true ↔ ∀ j : Fin n, s.holding j ≠ some i := by simp [isFree]