AFTD Auto-Formalizing Theoretical Domains

ProbabilisticTheory.ArchimedeanOrderUnitSpace.add_mem_orderUnitBounds

theoremverifiedformalizationimported Lean

A bound for A and a bound for B add up to a bound for A + B.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open ProbabilisticTheory ProbabilisticTheory.ArchimedeanOrderUnitSpace in
variable {E : Type*} [OrderUnitSpace E] in
lemma ProbabilisticTheory.ArchimedeanOrderUnitSpace.add_mem_orderUnitBounds {A B : E} {r s : ℝ} (hr : r ∈ orderUnitBounds A)
    (hs : s ∈ orderUnitBounds B) : r + s ∈ orderUnitBounds (A + B)
Formalizes
Physlib, `ProbabilisticTheory.ArchimedeanOrderUnitSpace.add_mem_orderUnitBounds`
Lean proof
By Tom Ole Diem, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2026 Tom Ole Diem. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 7
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen ProbabilisticTheory ProbabilisticTheory.ArchimedeanOrderUnitSpace invariable {E : Type*} [OrderUnitSpace E] in/-- A bound for `A` and a bound for `B` add up to a bound for `A + B`. -/lemma ProbabilisticTheory.ArchimedeanOrderUnitSpace.add_mem_orderUnitBounds {A B : E} {r s : ℝ} (hr : r ∈ orderUnitBounds A)    (hs : s ∈ orderUnitBounds B) : r + s ∈ orderUnitBounds (A + B) := by  refine ⟨add_nonneg hr.1 hs.1, ?_, ?_⟩  · rw [add_smul, neg_add]    exact add_le_add hr.2.1 hs.2.1  · rw [add_smul]    exact add_le_add hr.2.2 hs.2.2
See it in the graphDiscuss this resultChallenge it