GS.meetMan_le_right
theoremverifiedformalizationimported Lean
GS.meetMan_le_right
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GS in variable {n : ℕ} (w m : Preferences n) in variable {w m} in variable (μ ν : Matching (Fin n) (Fin n)) (hμ : Matching.IsStable (MatchingMarket.ofEquivData w m) μ) (hν : Matching.IsStable (MatchingMarket.ofEquivData w m) ν) in lemma GS.meetMan_le_right (i : Fin n) : (w.prefs i).idxOf (meetMan μ ν hμ hν i) ≤ (w.prefs i).idxOf (mPartner ν hν i)
- Formalizes
- EconCSLib, `GS.meetMan_le_right`
- 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.meetMan_le_right← GS.meetMan_le_right (EconCSLib/MarketDesign/Matching/Lattice.lean:436): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 10
- GS.mPartnerThe man partnered to woman
iunder a stable matchingμ. - Matching.IsStableA matching is stable if it has no blocking pair. [MSZ 22.5]
- GS.stableMeet_matchMGS.stableMeet_matchM
- MatchingA matching is a partial bijection between
MandW.matchM iis the partner ofi ∈ M(ornoneif unmatched).matchW jis the… - GS.matchM_mPartnerGS.matchM_mPartner
- instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp
- GS.matchW_wPartnerGS.matchW_wPartner
- GS.meetManWoman
i's more-preferred man acrossμandν. - GS.PreferencesList-based preferences:
prefs iis a full permutation ofFin n, ordered from most to least preferred. - MatchingMarket.ofEquivDataBuild a
MatchingMarket (Fin n) (Fin n)from list-based preference data.some j ≻ some kiffjappears earlier in the list;noneis…
- GS.mPartnerThe man partnered to woman
- Used by 1
- GS.stableMeet_isStableThe meet of two stable matchings is stable.
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 GS invariable {n : ℕ} (w m : Preferences n) invariable {w m} invariable (μ ν : Matching (Fin n) (Fin n)) (hμ : Matching.IsStable (MatchingMarket.ofEquivData w m) μ) (hν : Matching.IsStable (MatchingMarket.ofEquivData w m) ν) inlemma GS.meetMan_le_right (i : Fin n) : (w.prefs i).idxOf (meetMan μ ν hμ hν i) ≤ (w.prefs i).idxOf (mPartner ν hν i) := by unfold meetMan; split_ifs with h · exact h · exact le_refl _