AFTD Auto-Formalizing Theoretical Domains

Bornology.IsBounded.continuous_sInf

theoremverifiedformalizationimported Lean

Similar to IsCompact.continuous_sInf, but taking a bounded set in the bornology instead of a compact set.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Bornology Bornology.IsBounded in
variable {α β γ : Type*} {S : Set β} {f : γ → β → α} in
variable [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] in
variable [TopologicalSpace γ] in
variable [PseudoMetricSpace β] [ProperSpace β] in
theorem Bornology.IsBounded.continuous_sInf (hS : Bornology.IsBounded S) (hf : Continuous ↿f) :
    Continuous fun x ↦ sInf (f x '' S)
Formalizes
QuantumInfo, `Bornology.IsBounded.continuous_sInf`
Lean proof
By Alex Meiburg, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Alex Meiburg. 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
17 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • IsCompact.closure_continuous_sInfA version of IsCompact.continuous_sInf with a slightly weaker hypothesis on the set K, that its closure is compact (but the set itself…
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Bornology Bornology.IsBounded in
variable {α β γ : Type*} {S : Set β} {f : γ → β → α} in
variable [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] in
variable [TopologicalSpace γ] in
variable [PseudoMetricSpace β] [ProperSpace β] in
/-- Similar to `IsCompact.continuous_sInf`, but taking a bounded set in the bornology instead of a compact set. -/
theorem Bornology.IsBounded.continuous_sInf (hS : Bornology.IsBounded S) (hf : Continuous ↿f) :
    Continuous fun x ↦ sInf (f x '' S) :=
  hS.isCompact_closure.closure_continuous_sInf hf
See it in the graphDiscuss this resultChallenge it