AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearAlgebra.farkasAugA_inr_true_last

theoremverifiedformalizationimported Lean

EconCSLib.LinearAlgebra.farkasAugA_inr_true_last

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.LinearAlgebra.farkasAugA_inr_true_last (A : I โ†’ Fin n โ†’ ๐•œ) (b : I โ†’ ๐•œ)
    (c : Fin n โ†’ ๐•œ) (d : ๐•œ) :
    farkasAugA A b c d (Sum.inr true) (Fin.last n) = d
Formalizes
EconCSLib, `EconCSLib.LinearAlgebra.farkasAugA_inr_true_last`
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 6
Used by 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] invariable {I : Type*} [Fintype I] [DecidableEq I] {n : โ„•} in@[simp] theorem EconCSLib.LinearAlgebra.farkasAugA_inr_true_last (A : I โ†’ Fin n โ†’ ๐•œ) (b : I โ†’ ๐•œ)    (c : Fin n โ†’ ๐•œ) (d : ๐•œ) :    farkasAugA A b c d (Sum.inr true) (Fin.last n) = d := by  simp [farkasAugA]
See it in the graphDiscuss this resultChallenge it