le_zero_of_add_le_self
theoremverifiedformalizationimported Lean
In a zero-sum comparison: if a + b ≤ a then b ≤ 0.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in theorem le_zero_of_add_le_self {a b : U} (h : a + b ≤ a) : b ≤ 0
- Formalizes
- EconCSLib, `le_zero_of_add_le_self`
- 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.le_zero_of_add_le_self← le_zero_of_add_le_self (EconCSLib/Foundation/OrderedGroup.lean:102): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in/-- In a zero-sum comparison: if `a + b ≤ a` then `b ≤ 0`. -/theorem le_zero_of_add_le_self {a b : U} (h : a + b ≤ a) : b ≤ 0 := by have := (add_le_add_iff_left a).mp (by rwa [add_zero] : a + b ≤ a + 0) exact this