AFTD Auto-Formalizing Theoretical Domains

nonneg_of_self_le_add

theoremverifiedformalizationimported Lean

In a zero-sum comparison: if a ≤ a + b then 0 ≤ b.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in
theorem nonneg_of_self_le_add {a b : U} (h : a ≤ a + b) : 0 ≤ b
Formalizes
EconCSLib, `nonneg_of_self_le_add`
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 invariable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in/-- In a zero-sum comparison: if `a ≤ a + b` then `0 ≤ b`. -/theorem nonneg_of_self_le_add {a b : U} (h : a ≤ a + b) : 0 ≤ b := by  have := (add_le_add_iff_left a).mp (by rwa [add_zero] : a + 0 ≤ a + b)  exact this
See it in the graphDiscuss this resultChallenge it