GS.propTarget_lt
theoremverifiedformalizationimported Lean
propTarget returns some when k < n.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open List Finset in lemma GS.propTarget_lt {n : ℕ} (m : Preferences n) (i : Fin n) {k : ℕ} (hk : k < n) : ∃ j, propTarget m i k = some j
- Formalizes
- EconCSLib, `GS.propTarget_lt`
- 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.propTarget_lt← GS.propTarget_lt (EconCSLib/MarketDesign/Matching/GaleShapley.lean:155): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 2
- GS.propTargetThe woman man
iproposes to at cursor indexk(none if out of bounds). - GS.PreferencesList-based preferences:
prefs iis a full permutation ofFin n, ordered from most to least preferred.
- GS.propTargetThe woman man
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 in/-- `propTarget` returns `some` when `k < n`. -/lemma GS.propTarget_lt {n : ℕ} (m : Preferences n) (i : Fin n) {k : ℕ} (hk : k < n) : ∃ j, propTarget m i k = some j := by have hlen : k < (m.prefs i).length := by rwa [(m.valid i).2] exact ⟨(m.prefs i)[k], List.getElem?_eq_getElem hlen⟩