AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 10
Used by 1

Lean source view module on GitHub

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 _
See it in the graphDiscuss this resultChallenge it