AFTD Auto-Formalizing Theoretical Domains

ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_add_le

theoremverifiedformalizationimported Lean

ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_add_le

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open ProbabilisticTheory ProbabilisticTheory.ArchimedeanOrderUnitSpace in
open ProbabilisticTheory.OrderUnitSpace in
variable {E : Type*} [ArchimedeanOrderUnitSpace E] in
lemma ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_add_le (A B : E) :
    orderUnitNorm (A + B) ≤ orderUnitNorm A + orderUnitNorm B
Formalizes
Physlib, `ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_add_le`
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 11

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen ProbabilisticTheory ProbabilisticTheory.ArchimedeanOrderUnitSpace inopen ProbabilisticTheory.OrderUnitSpace invariable {E : Type*} [ArchimedeanOrderUnitSpace E] inlemma ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_add_le (A B : E) :    orderUnitNorm (A + B) ≤ orderUnitNorm A + orderUnitNorm B := by  apply le_of_forall_pos_le_add  intro ε hε  obtain ⟨r, hr, hrlt⟩ := exists_orderUnitBound_lt A (half_pos hε)  obtain ⟨s, hs, hslt⟩ := exists_orderUnitBound_lt B (half_pos hε)  calc    orderUnitNorm (A + B) ≤ r + s := orderUnitNorm_le (add_mem_orderUnitBounds hr hs)    _ ≤ (orderUnitNorm A + ε / 2) + (orderUnitNorm B + ε / 2) :=      add_le_add hrlt.le hslt.le    _ = orderUnitNorm A + orderUnitNorm B + ε := by ring
See it in the graphDiscuss this resultChallenge it