AFTD Auto-Formalizing Theoretical Domains

mix_lt_of_lt_nbh

theoremverifiedformalizationimported Lean

Dual: strictly interior t keeping t·x + (1-t)·y < c, given x < c. Obtained from mix_gt_of_gt_nbh by negating x, y, c.

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 mix_lt_of_lt_nbh (x y c : 𝕜) (H : x < c) :
    ∃ t : 𝕜, 0 < t ∧ t < 1 ∧ t * x + (1 - t) * y < c
Formalizes
EconCSLib, `mix_lt_of_lt_nbh`
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 1
  • mix_gt_of_gt_nbhExistence of a strictly interior t keeping t·x + (1-t)·y > c, given c < x. Constructive over any ordered field: pick t just above…

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/-- Dual: strictly interior `t` keeping `t·x + (1-t)·y < c`, given `x < c`. Obtained from `mix_gt_of_gt_nbh` by negating `x, y, c`. -/theorem mix_lt_of_lt_nbh (x y c : 𝕜) (H : x < c) :    ∃ t : 𝕜, 0 < t ∧ t < 1 ∧ t * x + (1 - t) * y < c := by  obtain ⟨t, ht0, ht1, hgt⟩ := mix_gt_of_gt_nbh (-x) (-y) (-c) (by linarith)  refine ⟨t, ht0, ht1, ?_⟩  have hneg : t * (-x) + (1 - t) * (-y) = -(t * x + (1 - t) * y) := by ring  rw [hneg] at hgt  linarith
See it in the graphDiscuss this resultChallenge it