AFTD Auto-Formalizing Theoretical Domains

ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_le

theoremverifiedformalizationimported Lean

Any order-unit bound on A is an upper bound for A's order-unit norm.

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.orderUnitNorm_le {A : E} {r : ℝ} (hr : r ∈ orderUnitBounds A) :
    orderUnitNorm A ≤ r
Formalizes
Physlib, `ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_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 6
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open ProbabilisticTheory ProbabilisticTheory.ArchimedeanOrderUnitSpace in
variable {E : Type*} [OrderUnitSpace E] in
/-- Any order-unit bound on `A` is an upper bound for `A`'s order-unit norm. -/
lemma ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_le {A : E} {r : ℝ} (hr : r ∈ orderUnitBounds A) :
    orderUnitNorm A ≤ r :=
  csInf_le (orderUnitBounds_bddBelow A) hr
See it in the graphDiscuss this resultChallenge it