AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.dropEquiv

defimported Lean

The equivalence J ≃ Option {j // j ≠ j₀}: j₀ ↦ none, other j ↦ some j.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
noncomputable def MinimaxLoomis.dropEquiv [DecidableEq J] (j₀ : J) : J ≃ Option {j : J // j ≠ j₀}
Defined in
EconCSLib, `MinimaxLoomis.dropEquiv`
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
none listed
Used by 1
  • MinimaxLoomis.sum_split_atSum-splitting lemma: any function on J decomposes as the value at j₀ plus the sum over {j // j ≠ j₀}.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
/-- The equivalence `J ≃ Option {j // j ≠ j₀}`: `j₀ ↦ none`, other `j ↦ some j`. -/
noncomputable def MinimaxLoomis.dropEquiv [DecidableEq J] (j₀ : J) : J ≃ Option {j : J // j ≠ j₀} where
  toFun j := if h : j = j₀ then none else some ⟨j, h⟩
  invFun o := match o with | none => j₀ | some j => j.val
  left_inv j := by by_cases h : j = j₀ <;> simp [h]
  right_inv o := by cases o with
    | none => simp
    | some j => simp [j.property]
See it in the graphDiscuss this resultChallenge it