AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearProgramming.dualAugA_inr

theoremverifiedformalizationimported Lean

EconCSLib.LinearProgramming.dualAugA_inr

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable {I : Type*} [Fintype I] [DecidableEq I] {n : โ„•} in
@[simp] theorem EconCSLib.LinearProgramming.dualAugA_inr (A : I โ†’ Fin n โ†’ ๐•œ) (j' j : Fin n) :
    dualAugA A (Sum.inr j') j = if j = j' then 1 else 0
Formalizes
EconCSLib, `EconCSLib.LinearProgramming.dualAugA_inr`
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 2
Used by 2

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 {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable {I : Type*} [Fintype I] [DecidableEq I] {n : โ„•} in
@[simp] theorem EconCSLib.LinearProgramming.dualAugA_inr (A : I โ†’ Fin n โ†’ ๐•œ) (j' j : Fin n) :
    dualAugA A (Sum.inr j') j = if j = j' then 1 else 0 := rfl
See it in the graphDiscuss this resultChallenge it