AFTD Auto-Formalizing Theoretical Domains

linear_comb_gt_left

theoremverifiedformalizationimported Lean

If x < y and α < 1, then α·x + (1-α)·y > x.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
variable {I : Type*} [Fintype I] in
set_option linter.unusedSectionVars false in
theorem linear_comb_gt_left {x y : 𝕜} (H : x < y) {α : 𝕜} (Hα : α < 1) :
    x < α * x + (1 - α) * y
Formalizes
EconCSLib, `linear_comb_gt_left`
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

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators Matrix invariable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] invariable {I : Type*} [Fintype I] inset_option linter.unusedSectionVars false in/-- If `x < y` and `α < 1`, then `α·x + (1-α)·y > x`. -/theorem linear_comb_gt_left {x y : 𝕜} (H : x < y) {α : 𝕜} (Hα : α < 1) :    x < α * x + (1 - α) * y := by  have hpos : 0 < 1 - α := by linarith  have : 0 < (1 - α) * (y - x) := mul_pos hpos (by linarith)  nlinarith
See it in the graphDiscuss this resultChallenge it