pl_free_props
theoremverifiedformalizationimported Lean
Helper: membership in the proposerList implies freedom and proposal target.
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 pl_free_props {n : ℕ} (s : DAState n) (m : Preferences n) (j k : Fin n) : let pl : Fin n → List (Fin n) := fun j' => (Finset.univ.filter (fun i => isFree s i && (propTarget m i (s.nextChoice i) == some j'))).val.toList k ∈ pl j → isFree s k = true ∧ propTarget m k (s.nextChoice k) = some j
- Formalizes
- EconCSLib, `pl_free_props`
- 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.pl_free_props← pl_free_props (EconCSLib/MarketDesign/Matching/GaleShapley.lean:368): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
- GS.PreferencesList-based preferences:
prefs iis a full permutation ofFin n, ordered from most to least preferred. - GS.isFreeMan
iis free insiff no woman holds him. - GS.propTargetThe woman man
iproposes to at cursor indexk(none if out of bounds).
- Used by 2
- holdinv_step
HoldInvis preserved by one DA step. Proof structure: case-analyze on the pair(s.holding p, bestNew p)that drivesdaStep's… - holding_injective_stepIn
daStep,holdingremains injective.
- 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 inopen GS invariable {n : ℕ} [NeZero n] invariable (w m : Preferences n) in/-- Helper: membership in the proposerList implies freedom and proposal target. -/lemma pl_free_props {n : ℕ} (s : DAState n) (m : Preferences n) (j k : Fin n) : let pl : Fin n → List (Fin n) := fun j' => (Finset.univ.filter (fun i => isFree s i && (propTarget m i (s.nextChoice i) == some j'))).val.toList k ∈ pl j → isFree s k = true ∧ propTarget m k (s.nextChoice k) = some j := by intro pl hk change k ∈ (Finset.univ.filter (fun i => isFree s i && (propTarget m i (s.nextChoice i) == some j))).val.toList at hk simp only [Multiset.mem_toList, Finset.mem_val, Finset.mem_filter, Finset.mem_univ, true_and, Bool.and_eq_true, beq_iff_eq] at hk exact hk