GS.not_isFree_iff
theoremverifiedformalizationimported Lean
GS.not_isFree_iff
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open List Finset in lemma GS.not_isFree_iff {n : ℕ} (s : DAState n) (i : Fin n) : isFree s i = false ↔ ∃ j : Fin n, s.holding j = some i
- Formalizes
- EconCSLib, `GS.not_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.not_isFree_iff← GS.not_isFree_iff (EconCSLib/MarketDesign/Matching/GaleShapley.lean:137): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- 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 3
- holdinv_step
HoldInvis preserved by one DA step. Proof structure: case-analyze on the pair(s.holding p, bestNew p)that drivesdaStep's… - not_free_of_nc_ge
nextChoice i ≥ n+ injectivity +JInv→ maniis not free. - final_all_men_heldAt termination, every man is held by some woman.
- holdinv_step
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.not_isFree_iff {n : ℕ} (s : DAState n) (i : Fin n) : isFree s i = false ↔ ∃ j : Fin n, s.holding j = some i := by simp [isFree, decide_eq_false_iff_not, not_forall, ne_eq]