Loogle!
Result
Found 283 declarations mentioning Bornology.IsBounded. Of these, only the first 200 are shown.
- Bornology.IsBounded 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] (s : Set α) : Prop - Bornology.isBounded_empty 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} : Bornology.IsBounded ∅ - BoundedSpace.bounded_univ 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_4} {inst✝ : Bornology α} [self : BoundedSpace α] : Bornology.IsBounded Set.univ - BoundedSpace.mk 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_4} [Bornology α] (bounded_univ : Bornology.IsBounded Set.univ) : BoundedSpace α - Bornology.isBounded_univ 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] : Bornology.IsBounded Set.univ ↔ BoundedSpace α - Bornology.IsBounded.all 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] [BoundedSpace α] (s : Set α) : Bornology.IsBounded s - Set.Finite.isBounded 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] {s : Set α} (hs : s.Finite) : Bornology.IsBounded s - Bornology.nonempty_of_not_isBounded 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} (h : ¬Bornology.IsBounded s) : s.Nonempty - Bornology.isBounded_singleton 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {x : α} : Bornology.IsBounded {x} - Bornology.IsBounded.compl 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} : Bornology.IsBounded s → Bornology.IsCobounded sᶜ - Bornology.IsBounded.of_compl 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} : Bornology.IsBounded sᶜ → Bornology.IsCobounded s - Bornology.IsCobounded.compl 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} : Bornology.IsCobounded s → Bornology.IsBounded sᶜ - Bornology.IsCobounded.of_compl 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} : Bornology.IsCobounded sᶜ → Bornology.IsBounded s - Bornology.isBounded_compl_iff 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} : Bornology.IsBounded sᶜ ↔ Bornology.IsCobounded s - Bornology.isCobounded_compl_iff 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} : Bornology.IsCobounded sᶜ ↔ Bornology.IsBounded s - Bornology.sUnion_bounded_univ 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} : ⋃₀ {s | Bornology.IsBounded s} = Set.univ - Bornology.IsBounded.insert 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} (h : Bornology.IsBounded s) (x : α) : Bornology.IsBounded (insert x s) - Bornology.ext_iff_isBounded 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {t t' : Bornology α} : t = t' ↔ ∀ (s : Set α), Bornology.IsBounded s ↔ Bornology.IsBounded s - Bornology.isBounded_insert 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} {x : α} : Bornology.IsBounded (insert x s) ↔ Bornology.IsBounded s - Bornology.IsBounded.subset 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s t : Set α} (ht : Bornology.IsBounded t) (hs : s ⊆ t) : Bornology.IsBounded s - Bornology.isBounded_iff_forall_mem 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} : Bornology.IsBounded s ↔ ∀ x ∈ s, Bornology.IsBounded s - Bornology.isBounded_iUnion 📋 Mathlib.Topology.Bornology.Basic
{ι : Type u_1} {α : Type u_2} [Bornology α] [Finite ι] {s : ι → Set α} : Bornology.IsBounded (⋃ i, s i) ↔ ∀ (i : ι), Bornology.IsBounded (s i) - Bornology.IsBounded.union 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s t : Set α} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) : Bornology.IsBounded (s ∪ t) - Bornology.isBounded_def 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s : Set α} : Bornology.IsBounded s ↔ sᶜ ∈ Bornology.cobounded α - Bornology.isBounded_union 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {x✝ : Bornology α} {s t : Set α} : Bornology.IsBounded (s ∪ t) ↔ Bornology.IsBounded s ∧ Bornology.IsBounded t - Bornology.isBounded_sUnion 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] {S : Set (Set α)} (hs : S.Finite) : Bornology.IsBounded (⋃₀ S) ↔ ∀ s ∈ S, Bornology.IsBounded s - Bornology.comap_cobounded_le_iff 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {β : Type u_3} {x✝ : Bornology α} [Bornology β] {f : α → β} : Filter.comap f (Bornology.cobounded β) ≤ Bornology.cobounded α ↔ ∀ ⦃s : Set α⦄, Bornology.IsBounded s → Bornology.IsBounded (f '' s) - OrderDual.isBounded_preimage_ofDual 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] {s : Set α} : Bornology.IsBounded (⇑OrderDual.ofDual ⁻¹' s) ↔ Bornology.IsBounded s - OrderDual.isBounded_preimage_toDual 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] {s : Set αᵒᵈ} : Bornology.IsBounded (⇑OrderDual.toDual ⁻¹' s) ↔ Bornology.IsBounded s - Bornology.IsBounded.disjoint_cobounded 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] {l : Filter α} {s : Set α} (hs : Bornology.IsBounded s) (hl : s ∈ l) : Disjoint l (Bornology.cobounded α) - Disjoint.exists_isBounded 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] {l : Filter α} : Disjoint l (Bornology.cobounded α) → ∃ s ∈ l, Bornology.IsBounded s - Filter.disjoint_cobounded_iff 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] {l : Filter α} : Disjoint l (Bornology.cobounded α) ↔ ∃ s ∈ l, Bornology.IsBounded s - Bornology.isBounded_biUnion 📋 Mathlib.Topology.Bornology.Basic
{ι : Type u_1} {α : Type u_2} [Bornology α] {s : Set ι} {f : ι → Set α} (hs : s.Finite) : Bornology.IsBounded (⋃ i ∈ s, f i) ↔ ∀ i ∈ s, Bornology.IsBounded (f i) - Filter.HasBasis.disjoint_cobounded_iff 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} [Bornology α] {ι : Sort u_4} {p : ι → Prop} {s : ι → Set α} {l : Filter α} (h : l.HasBasis p s) : Disjoint l (Bornology.cobounded α) ↔ ∃ i, p i ∧ Bornology.IsBounded (s i) - Bornology.isBounded_biUnion_finset 📋 Mathlib.Topology.Bornology.Basic
{ι : Type u_1} {α : Type u_2} [Bornology α] (s : Finset ι) {f : ι → Set α} : Bornology.IsBounded (⋃ i ∈ s, f i) ↔ ∀ i ∈ s, Bornology.IsBounded (f i) - Bornology.isBounded_ofBounded_iff 📋 Mathlib.Topology.Bornology.Basic
{α : Type u_2} {s : Set α} (B : Set (Set α)) {empty_mem : ∅ ∈ B} {subset_mem : ∀ s₁ ∈ B, ∀ s₂ ⊆ s₁, s₂ ∈ B} {union_mem : ∀ s₁ ∈ B, ∀ s₂ ∈ B, s₁ ∪ s₂ ∈ B} {sUnion_univ : ∀ (x : α), {x} ∈ B} : Bornology.IsBounded s ↔ s ∈ B - Bornology.inCompact.isBounded_iff 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] {s : Set X} : Bornology.IsBounded s ↔ ∃ t, IsCompact t ∧ s ⊆ t - Bornology.isBounded_image_of_isLocallyBounded_of_isCompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] {Y : Type u_2} [Bornology Y] {s : Set X} (hs : IsCompact s) {f : X → Y} (hf : ∀ (x : X), ∃ t ∈ nhds x, Bornology.IsBounded (f '' t)) : Bornology.IsBounded (f '' s) - Bornology.relativelyCompact.isBounded_iff 📋 Mathlib.Topology.Separation.Basic
{X : Type u_1} [TopologicalSpace X] [R0Space X] {s : Set X} : Bornology.IsBounded s ↔ IsCompact (closure s) - PseudoMetricSpace.replaceBornology 📋 Mathlib.Topology.MetricSpace.Pseudo.Defs
{α : Type u_3} [B : Bornology α] (m : PseudoMetricSpace α) (H : ∀ (s : Set α), Bornology.IsBounded s ↔ Bornology.IsBounded s) : PseudoMetricSpace α - PseudoMetricSpace.replaceBornology_eq 📋 Mathlib.Topology.MetricSpace.Pseudo.Defs
{α : Type u_3} [m : PseudoMetricSpace α] [B : Bornology α] (H : ∀ (s : Set α), Bornology.IsBounded s ↔ Bornology.IsBounded s) : m.replaceBornology H = m - Metric.isBounded_iff 📋 Mathlib.Topology.MetricSpace.Pseudo.Defs
{α : Type u} [PseudoMetricSpace α] {s : Set α} : Bornology.IsBounded s ↔ ∃ C, ∀ ⦃x : α⦄, x ∈ s → ∀ ⦃y : α⦄, y ∈ s → dist x y ≤ C - Metric.isBounded_iff_eventually 📋 Mathlib.Topology.MetricSpace.Pseudo.Defs
{α : Type u} [PseudoMetricSpace α] {s : Set α} : Bornology.IsBounded s ↔ ∀ᶠ (C : ℝ) in Filter.atTop, ∀ ⦃x : α⦄, x ∈ s → ∀ ⦃y : α⦄, y ∈ s → dist x y ≤ C - Metric.isBounded_iff_nndist 📋 Mathlib.Topology.MetricSpace.Pseudo.Defs
{α : Type u} [PseudoMetricSpace α] {s : Set α} : Bornology.IsBounded s ↔ ∃ C, ∀ ⦃x : α⦄, x ∈ s → ∀ ⦃y : α⦄, y ∈ s → nndist x y ≤ C - Metric.isBounded_iff_exists_ge 📋 Mathlib.Topology.MetricSpace.Pseudo.Defs
{α : Type u} [PseudoMetricSpace α] {s : Set α} (c : ℝ) : Bornology.IsBounded s ↔ ∃ C, c ≤ C ∧ ∀ ⦃x : α⦄, x ∈ s → ∀ ⦃y : α⦄, y ∈ s → dist x y ≤ C - MetricSpace.replaceBornology 📋 Mathlib.Topology.MetricSpace.Defs
{α : Type u_2} [B : Bornology α] (m : MetricSpace α) (H : ∀ (s : Set α), Bornology.IsBounded s ↔ Bornology.IsBounded s) : MetricSpace α - MetricSpace.replaceBornology_eq 📋 Mathlib.Topology.MetricSpace.Defs
{α : Type u_2} [m : MetricSpace α] [B : Bornology α] (H : ∀ (s : Set α), Bornology.IsBounded s ↔ Bornology.IsBounded s) : m.replaceBornology H = m - boundedSpace_induced_iff 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_5} {β : Type u_6} [Bornology β] {f : α → β} : BoundedSpace α ↔ Bornology.IsBounded (Set.range f) - Bornology.IsBounded.boundedSpace_subtype 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} [Bornology α] {p : α → Prop} : Bornology.IsBounded {x | p x} → BoundedSpace (Subtype p) - boundedSpace_subtype_iff 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} [Bornology α] {p : α → Prop} : BoundedSpace (Subtype p) ↔ Bornology.IsBounded {x | p x} - Bornology.isBounded_induced 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_5} {β : Type u_6} [Bornology β] {f : α → β} {s : Set α} : Bornology.IsBounded s ↔ Bornology.IsBounded (f '' s) - Bornology.IsBounded.boundedSpace_val 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} [Bornology α] {s : Set α} : Bornology.IsBounded s → BoundedSpace ↑s - boundedSpace_val_set_iff 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} [Bornology α] {s : Set α} : BoundedSpace ↑s ↔ Bornology.IsBounded s - Bornology.IsBounded.image_fst 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} {β : Type u_2} [Bornology α] [Bornology β] {s : Set (α × β)} (hs : Bornology.IsBounded s) : Bornology.IsBounded (Prod.fst '' s) - Bornology.IsBounded.image_snd 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} {β : Type u_2} [Bornology α] [Bornology β] {s : Set (α × β)} (hs : Bornology.IsBounded s) : Bornology.IsBounded (Prod.snd '' s) - Bornology.isBounded_prod_self 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} [Bornology α] {s : Set α} : Bornology.IsBounded (s ×ˢ s) ↔ Bornology.IsBounded s - Bornology.IsBounded.pi 📋 Mathlib.Topology.Bornology.Constructions
{ι : Type u_3} {X : ι → Type u_4} [(i : ι) → Bornology (X i)] {S : (i : ι) → Set (X i)} (h : ∀ (i : ι), Bornology.IsBounded (S i)) : Bornology.IsBounded (Set.univ.pi S) - Bornology.IsBounded.image_eval 📋 Mathlib.Topology.Bornology.Constructions
{ι : Type u_3} {X : ι → Type u_4} [(i : ι) → Bornology (X i)] {s : Set ((i : ι) → X i)} (hs : Bornology.IsBounded s) (i : ι) : Bornology.IsBounded (Function.eval i '' s) - Bornology.forall_isBounded_image_eval_iff 📋 Mathlib.Topology.Bornology.Constructions
{ι : Type u_3} {X : ι → Type u_4} [(i : ι) → Bornology (X i)] {s : Set ((i : ι) → X i)} : (∀ (i : ι), Bornology.IsBounded (Function.eval i '' s)) ↔ Bornology.IsBounded s - Bornology.IsBounded.fst_of_prod 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} {β : Type u_2} [Bornology α] [Bornology β] {s : Set α} {t : Set β} (h : Bornology.IsBounded (s ×ˢ t)) (ht : t.Nonempty) : Bornology.IsBounded s - Bornology.IsBounded.snd_of_prod 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} {β : Type u_2} [Bornology α] [Bornology β] {s : Set α} {t : Set β} (h : Bornology.IsBounded (s ×ˢ t)) (hs : s.Nonempty) : Bornology.IsBounded t - Bornology.isBounded_image_subtype_val 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} [Bornology α] {p : α → Prop} {s : Set { x // p x }} : Bornology.IsBounded (Subtype.val '' s) ↔ Bornology.IsBounded s - Bornology.IsBounded.prod 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} {β : Type u_2} [Bornology α] [Bornology β] {s : Set α} {t : Set β} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) : Bornology.IsBounded (s ×ˢ t) - Bornology.isBounded_pi_of_nonempty 📋 Mathlib.Topology.Bornology.Constructions
{ι : Type u_3} {X : ι → Type u_4} [(i : ι) → Bornology (X i)] {S : (i : ι) → Set (X i)} (hne : (Set.univ.pi S).Nonempty) : Bornology.IsBounded (Set.univ.pi S) ↔ ∀ (i : ι), Bornology.IsBounded (S i) - Bornology.isBounded_image_fst_and_snd 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} {β : Type u_2} [Bornology α] [Bornology β] {s : Set (α × β)} : Bornology.IsBounded (Prod.fst '' s) ∧ Bornology.IsBounded (Prod.snd '' s) ↔ Bornology.IsBounded s - Bornology.isBounded_pi 📋 Mathlib.Topology.Bornology.Constructions
{ι : Type u_3} {X : ι → Type u_4} [(i : ι) → Bornology (X i)] {S : (i : ι) → Set (X i)} : Bornology.IsBounded (Set.univ.pi S) ↔ (∃ i, S i = ∅) ∨ ∀ (i : ι), Bornology.IsBounded (S i) - Bornology.isBounded_prod_of_nonempty 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} {β : Type u_2} [Bornology α] [Bornology β] {s : Set α} {t : Set β} (hne : (s ×ˢ t).Nonempty) : Bornology.IsBounded (s ×ˢ t) ↔ Bornology.IsBounded s ∧ Bornology.IsBounded t - Bornology.isBounded_prod 📋 Mathlib.Topology.Bornology.Constructions
{α : Type u_1} {β : Type u_2} [Bornology α] [Bornology β] {s : Set α} {t : Set β} : Bornology.IsBounded (s ×ˢ t) ↔ s = ∅ ∨ t = ∅ ∨ Bornology.IsBounded s ∧ Bornology.IsBounded t - Bornology.IsBounded.bddAbove 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} {s : Set α} [Bornology α] [Preorder α] [IsOrderBornology α] (hs : Bornology.IsBounded s) : BddAbove s - Bornology.IsBounded.bddBelow 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} {s : Set α} [Bornology α] [Preorder α] [IsOrderBornology α] (hs : Bornology.IsBounded s) : BddBelow s - BddAbove.isBounded 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} {s : Set α} [Bornology α] [Preorder α] [IsOrderBornology α] (hs₀ : BddAbove s) (hs₁ : BddBelow s) : Bornology.IsBounded s - BddBelow.isBounded 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} {s : Set α} [Bornology α] [Preorder α] [IsOrderBornology α] (hs₀ : BddBelow s) (hs₁ : BddAbove s) : Bornology.IsBounded s - isBounded_iff_bddBelow_bddAbove 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} {s : Set α} [Bornology α] [Preorder α] [IsOrderBornology α] : Bornology.IsBounded s ↔ BddBelow s ∧ BddAbove s - IsOrderBornology.isBounded_iff_bddBelow_bddAbove 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} {inst✝ : Bornology α} {inst✝¹ : Preorder α} [self : IsOrderBornology α] (s : Set α) : Bornology.IsBounded s ↔ BddBelow s ∧ BddAbove s - IsOrderBornology.mk 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} [Bornology α] [Preorder α] (isBounded_iff_bddBelow_bddAbove : ∀ (s : Set α), Bornology.IsBounded s ↔ BddBelow s ∧ BddAbove s) : IsOrderBornology α - BddAbove.isBounded_inter 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} {s t : Set α} [Bornology α] [Preorder α] [IsOrderBornology α] (hs : BddAbove s) (ht : BddBelow t) : Bornology.IsBounded (s ∩ t) - BddBelow.isBounded_inter 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} {s t : Set α} [Bornology α] [Preorder α] [IsOrderBornology α] (hs : BddBelow s) (ht : BddAbove t) : Bornology.IsBounded (s ∩ t) - orderBornology_isBounded 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} {s : Set α} [Lattice α] [Nonempty α] : Bornology.IsBounded s ↔ BddBelow s ∧ BddAbove s - Bornology.IsBounded.subset_Icc_sInf_sSup 📋 Mathlib.Topology.Order.Bornology
{α : Type u_1} [Bornology α] [ConditionallyCompleteLattice α] [IsOrderBornology α] {s : Set α} (hs : Bornology.IsBounded s) : s ⊆ Set.Icc (sInf s) (sSup s) - Metric.isBounded_ball 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {x : α} {r : ℝ} [PseudoMetricSpace α] : Bornology.IsBounded (Metric.ball x r) - Metric.isBounded_closedBall 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {x : α} {r : ℝ} [PseudoMetricSpace α] : Bornology.IsBounded (Metric.closedBall x r) - Metric.isBounded_sphere 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {x : α} {r : ℝ} [PseudoMetricSpace α] : Bornology.IsBounded (Metric.sphere x r) - TotallyBounded.isBounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] {s : Set α} (h : TotallyBounded s) : Bornology.IsBounded s - Metric.isBounded_of_compactSpace 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] [CompactSpace α] : Bornology.IsBounded s - IsCompact.isBounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] {s : Set α} (h : IsCompact s) : Bornology.IsBounded s - Metric.compactSpace_iff_isBounded_univ 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [ProperSpace α] : CompactSpace α ↔ Bornology.IsBounded Set.univ - CauchySeq.isBounded_range 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] {f : ℕ → α} (hf : CauchySeq f) : Bornology.IsBounded (Set.range f) - Metric.diam_eq_zero_of_unbounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (h : ¬Bornology.IsBounded s) : Metric.diam s = 0 - Metric.isBounded_closure_of_isBounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (h : Bornology.IsBounded s) : Bornology.IsBounded (closure s) - Bornology.IsBounded.closure 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (h : Bornology.IsBounded s) : Bornology.IsBounded (closure s) - Metric.isBounded_Icc 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [Preorder α] [CompactIccSpace α] (a b : α) : Bornology.IsBounded (Set.Icc a b) - Metric.isBounded_Ico 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [Preorder α] [CompactIccSpace α] (a b : α) : Bornology.IsBounded (Set.Ico a b) - Metric.isBounded_Ioc 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [Preorder α] [CompactIccSpace α] (a b : α) : Bornology.IsBounded (Set.Ioc a b) - Metric.isBounded_Ioo 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [Preorder α] [CompactIccSpace α] (a b : α) : Bornology.IsBounded (Set.Ioo a b) - Metric.isBounded_closure_iff 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] : Bornology.IsBounded (closure s) ↔ Bornology.IsBounded s - Metric.isBounded_range_of_cauchy_map_cofinite 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] {f : β → α} (hf : Cauchy (Filter.map f Filter.cofinite)) : Bornology.IsBounded (Set.range f) - Bornology.IsBounded.subset_ball 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (h : Bornology.IsBounded s) (c : α) : ∃ r, s ⊆ Metric.ball c r - Bornology.IsBounded.subset_closedBall 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (h : Bornology.IsBounded s) (c : α) : ∃ r, s ⊆ Metric.closedBall c r - Metric.isBounded_iff_subset_ball 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (c : α) : Bornology.IsBounded s ↔ ∃ r, s ⊆ Metric.ball c r - Metric.isBounded_iff_subset_closedBall 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (c : α) : Bornology.IsBounded s ↔ ∃ r, s ⊆ Metric.closedBall c r - Bornology.IsBounded.isCompact_closure 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] [ProperSpace α] (h : Bornology.IsBounded s) : IsCompact (closure s) - Metric.isBounded_range_of_tendsto 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] (u : ℕ → α) {x : α} (hu : Filter.Tendsto u Filter.atTop (nhds x)) : Bornology.IsBounded (Set.range u) - Metric.isBounded_range_of_tendsto_cofinite 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] {f : β → α} {a : α} (hf : Filter.Tendsto f Filter.cofinite (nhds a)) : Bornology.IsBounded (Set.range f) - Metric.isCompact_of_isClosed_isBounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] [ProperSpace α] (hc : IsClosed s) (hb : Bornology.IsBounded s) : IsCompact s - Metric.diam_mono 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] {s t : Set α} (h : s ⊆ t) (ht : Bornology.IsBounded t) : Metric.diam s ≤ Metric.diam t - Metric.diam_pos 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [MetricSpace α] (hs1 : s.Nontrivial) (hs2 : Bornology.IsBounded s) : 0 < Metric.diam s - Metric.isBounded_of_bddAbove_of_bddBelow 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [Preorder α] [CompactIccSpace α] {s : Set α} (h₁ : BddAbove s) (h₂ : BddBelow s) : Bornology.IsBounded s - Bornology.IsBounded.ediam_ne_top 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] : Bornology.IsBounded s → Metric.ediam s ≠ ⊤ - Bornology.IsBounded.subset_ball_lt 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (h : Bornology.IsBounded s) (a : ℝ) (c : α) : ∃ r, a < r ∧ s ⊆ Metric.ball c r - Bornology.IsBounded.subset_closedBall_lt 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (h : Bornology.IsBounded s) (a : ℝ) (c : α) : ∃ r, a < r ∧ s ⊆ Metric.closedBall c r - Metric.ediam_of_unbounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] (h : ¬Bornology.IsBounded s) : Metric.ediam s = ⊤ - Metric.isBounded_iff_ediam_ne_top 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] : Bornology.IsBounded s ↔ Metric.ediam s ≠ ⊤ - Metric.isBounded_range_iff 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] {f : β → α} : Bornology.IsBounded (Set.range f) ↔ ∃ C, ∀ (x y : β), dist (f x) (f y) ≤ C - Metric.ediam_eq_top_iff_unbounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] : Metric.ediam s = ⊤ ↔ ¬Bornology.IsBounded s - Metric.isCompact_iff_isClosed_bounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u_2} {s : Set α} [MetricSpace α] [ProperSpace α] : IsCompact s ↔ IsClosed s ∧ Bornology.IsBounded s - Metric.finite_isBounded_inter_isClosed 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [ProperSpace α] {K s : Set α} (hsd : IsDiscrete s) (hK : Bornology.IsBounded K) (hs : IsClosed s) : (K ∩ s).Finite - Metric.dist_le_diam_of_mem 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} {x y : α} [PseudoMetricSpace α] (h : Bornology.IsBounded s) (hx : x ∈ s) (hy : y ∈ s) : dist x y ≤ Metric.diam s - Metric.hasBasis_nhds_isOpen_isBounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] (x : α) : (nhds x).HasBasis (fun a => x ∈ a ∧ IsOpen a ∧ Bornology.IsBounded a) id - Metric.exists_isBounded_image_of_tendsto 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u_2} {β : Type u_3} [PseudoMetricSpace β] {l : Filter α} {f : α → β} {x : β} (hf : Filter.Tendsto f l (nhds x)) : ∃ s ∈ l, Bornology.IsBounded (f '' s) - Metric.isBounded_range_of_tendsto_cofinite_uniformity 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] {f : β → α} (hf : Filter.Tendsto (Prod.map f f) (Filter.cofinite ×ˢ Filter.cofinite) (uniformity α)) : Bornology.IsBounded (Set.range f) - Metric.isBounded_image_iff 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] {f : β → α} {s : Set β} : Bornology.IsBounded (f '' s) ↔ ∃ C, ∀ x ∈ s, ∀ y ∈ s, dist (f x) (f y) ≤ C - Metric.exists_isOpen_isBounded_image_of_isCompact_of_forall_continuousAt 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] [TopologicalSpace β] {k : Set β} {f : β → α} (hk : IsCompact k) (hf : ∀ x ∈ k, ContinuousAt f x) : ∃ t, k ⊆ t ∧ IsOpen t ∧ Bornology.IsBounded (f '' t) - Metric.exists_isOpen_isBounded_image_of_isCompact_of_continuousOn 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] [TopologicalSpace β] {k s : Set β} {f : β → α} (hk : IsCompact k) (hs : IsOpen s) (hks : k ⊆ s) (hf : ContinuousOn f s) : ∃ t, k ⊆ t ∧ IsOpen t ∧ Bornology.IsBounded (f '' t) - Metric.exists_isOpen_isBounded_image_inter_of_isCompact_of_continuousOn 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] [TopologicalSpace β] {k s : Set β} {f : β → α} (hk : IsCompact k) (hks : k ⊆ s) (hf : ContinuousOn f s) : ∃ t, k ⊆ t ∧ IsOpen t ∧ Bornology.IsBounded (f '' (t ∩ s)) - Metric.exists_isOpen_isBounded_image_inter_of_isCompact_of_forall_continuousWithinAt 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] [TopologicalSpace β] {k s : Set β} {f : β → α} (hk : IsCompact k) (hf : ∀ x ∈ k, ContinuousWithinAt f s x) : ∃ t, k ⊆ t ∧ IsOpen t ∧ Bornology.IsBounded (f '' (t ∩ s)) - Metric.isBounded_of_abs_le 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u_2} [AddCommGroup α] [LinearOrder α] [IsOrderedAddMonoid α] [PseudoMetricSpace α] [CompactIccSpace α] (C : α) : Bornology.IsBounded {x | |x| ≤ C} - Metric.isBounded_of_abs_lt 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u_2} [AddCommGroup α] [LinearOrder α] [IsOrderedAddMonoid α] [PseudoMetricSpace α] [CompactIccSpace α] (C : α) : Bornology.IsBounded {x | |x| < C} - Metric.eq_countable_union_of_isBounded_of_isOpen 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] {U : Set α} (hU : IsOpen U) : ∃ f, Monotone f ∧ ⋃ i, f i = U ∧ ∀ (i : ℕ), Bornology.IsBounded (f i) ∧ IsOpen (f i) - Metric.nonempty_iInter_of_nonempty_biInter 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [CompleteSpace α] {s : ℕ → Set α} (hs : ∀ (n : ℕ), IsClosed (s n)) (h's : ∀ (n : ℕ), Bornology.IsBounded (s n)) (h : ∀ (N : ℕ), (⋂ n, ⋂ (_ : n ≤ N), s n).Nonempty) (h' : Filter.Tendsto (fun n => Metric.diam (s n)) Filter.atTop (nhds 0)) : (⋂ n, s n).Nonempty - Continuous.exists_forall_ge_of_isBounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u_2} {β : Type u_3} [LinearOrder α] [TopologicalSpace α] [OrderClosedTopology α] [PseudoMetricSpace β] [ProperSpace β] {f : β → α} (hf : Continuous f) (x₀ : β) (h : Bornology.IsBounded {x | f x₀ ≤ f x}) : ∃ x, ∀ (y : β), f y ≤ f x - Continuous.exists_forall_le_of_isBounded 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u_2} {β : Type u_3} [LinearOrder α] [TopologicalSpace α] [OrderClosedTopology α] [PseudoMetricSpace β] [ProperSpace β] {f : β → α} (hf : Continuous f) (x₀ : β) (h : Bornology.IsBounded {x | f x ≤ f x₀}) : ∃ x, ∀ (y : β), f x ≤ f y - IsComplete.nonempty_iInter_of_nonempty_biInter 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] {s : ℕ → Set α} (h0 : IsComplete (s 0)) (hs : ∀ (n : ℕ), IsClosed (s n)) (h's : ∀ (n : ℕ), Bornology.IsBounded (s n)) (h : ∀ (N : ℕ), (⋂ n, ⋂ (_ : n ≤ N), s n).Nonempty) (h' : Filter.Tendsto (fun n => Metric.diam (s n)) Filter.atTop (nhds 0)) : (⋂ n, s n).Nonempty - AntilipschitzWith.isBounded_preimage 📋 Mathlib.Topology.MetricSpace.Antilipschitz
{α : Type u_1} {β : Type u_2} [PseudoMetricSpace α] [PseudoMetricSpace β] {K : NNReal} {f : α → β} (hf : AntilipschitzWith K f) {s : Set β} (hs : Bornology.IsBounded s) : Bornology.IsBounded (f ⁻¹' s) - AntilipschitzWith.isBounded_of_image2_right 📋 Mathlib.Topology.MetricSpace.Antilipschitz
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [PseudoMetricSpace α] [PseudoMetricSpace β] [PseudoMetricSpace γ] {f : α → β → γ} {K₂ : NNReal} (hf : ∀ (a : α), AntilipschitzWith K₂ (f a)) {s : Set α} {t : Set β} (hst : Bornology.IsBounded (Set.image2 f s t)) : Bornology.IsBounded s ∨ Bornology.IsBounded t - AntilipschitzWith.isBounded_of_image2_left 📋 Mathlib.Topology.MetricSpace.Antilipschitz
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [PseudoMetricSpace α] [PseudoMetricSpace β] [PseudoMetricSpace γ] (f : α → β → γ) {K₁ : NNReal} (hf : ∀ (b : β), AntilipschitzWith K₁ fun a => f a b) {s : Set α} {t : Set β} (hst : Bornology.IsBounded (Set.image2 f s t)) : Bornology.IsBounded s ∨ Bornology.IsBounded t - Real.diam_eq 📋 Mathlib.Topology.Instances.ENNReal.Lemmas
{s : Set ℝ} (h : Bornology.IsBounded s) : Metric.diam s = sSup s - sInf s - Real.ediam_eq 📋 Mathlib.Topology.Instances.ENNReal.Lemmas
{s : Set ℝ} (h : Bornology.IsBounded s) : Metric.ediam s = ENNReal.ofReal (sSup s - sInf s) - LocallyBoundedMap.ofMapBounded 📋 Mathlib.Topology.Bornology.Hom
{α : Type u_2} {β : Type u_3} [Bornology α] [Bornology β] (f : α → β) (h : ∀ ⦃s : Set α⦄, Bornology.IsBounded s → Bornology.IsBounded (f '' s)) : LocallyBoundedMap α β - Bornology.IsBounded.image 📋 Mathlib.Topology.Bornology.Hom
{F : Type u_1} {α : Type u_2} {β : Type u_3} [FunLike F α β] [Bornology α] [Bornology β] [LocallyBoundedMapClass F α β] (f : F) {s : Set α} (hs : Bornology.IsBounded s) : Bornology.IsBounded (⇑f '' s) - LocallyBoundedMap.coe_ofMapBounded 📋 Mathlib.Topology.Bornology.Hom
{α : Type u_2} {β : Type u_3} [Bornology α] [Bornology β] (f : α → β) {h : ∀ ⦃s : Set α⦄, Bornology.IsBounded s → Bornology.IsBounded (f '' s)} : ⇑(LocallyBoundedMap.ofMapBounded f h) = f - LocallyBoundedMap.ofMapBounded_apply 📋 Mathlib.Topology.Bornology.Hom
{α : Type u_2} {β : Type u_3} [Bornology α] [Bornology β] (f : α → β) {h : ∀ ⦃s : Set α⦄, Bornology.IsBounded s → Bornology.IsBounded (f '' s)} (a : α) : (LocallyBoundedMap.ofMapBounded f h) a = f a - LipschitzWith.isBounded_image 📋 Mathlib.Topology.MetricSpace.Lipschitz
{α : Type u} {β : Type v} [PseudoMetricSpace α] [PseudoMetricSpace β] {K : NNReal} {f : α → β} (hf : LipschitzWith K f) {s : Set α} (hs : Bornology.IsBounded s) : Bornology.IsBounded (f '' s) - LipschitzWith.diam_image_le 📋 Mathlib.Topology.MetricSpace.Lipschitz
{α : Type u} {β : Type v} [PseudoMetricSpace α] [PseudoMetricSpace β] {K : NNReal} {f : α → β} (hf : LipschitzWith K f) (s : Set α) (hs : Bornology.IsBounded s) : Metric.diam (f '' s) ≤ ↑K * Metric.diam s - LipschitzOnWith.isBounded_image2 📋 Mathlib.Topology.MetricSpace.Lipschitz
{α : Type u} {β : Type v} {γ : Type w} [PseudoMetricSpace α] [PseudoMetricSpace β] [PseudoMetricSpace γ] (f : α → β → γ) {K₁ K₂ : NNReal} {s : Set α} {t : Set β} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) (hf₁ : ∀ b ∈ t, LipschitzOnWith K₁ (fun a => f a b) s) (hf₂ : ∀ a ∈ s, LipschitzOnWith K₂ (f a) t) : Bornology.IsBounded (Set.image2 f s t) - Bornology.IsBounded.uniformContinuousOn_smul 📋 Mathlib.Topology.MetricSpace.Algebra
{α : Type u_1} {β : Type u_2} [PseudoMetricSpace α] [PseudoMetricSpace β] [Zero α] [Zero β] [SMul α β] [IsBoundedSMul α β] {s : Set (α × β)} (hs : Bornology.IsBounded s) : UniformContinuousOn (Function.uncurry fun x1 x2 => x1 • x2) s - Bornology.IsBounded.smul 📋 Mathlib.Topology.MetricSpace.IsometricSMul
{G : Type v} {X : Type w} [PseudoMetricSpace X] [SMul G X] [IsIsometricSMul G X] {s : Set X} (hs : Bornology.IsBounded s) (c : G) : Bornology.IsBounded (c • s) - Bornology.IsBounded.vadd 📋 Mathlib.Topology.MetricSpace.IsometricSMul
{G : Type v} {X : Type w} [PseudoMetricSpace X] [VAdd G X] [IsIsometricVAdd G X] {s : Set X} (hs : Bornology.IsBounded s) (c : G) : Bornology.IsBounded (c +ᵥ s) - Bornology.IsBounded.exists_norm_le 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedAddGroup E] {s : Set E} : Bornology.IsBounded s → ∃ C, ∀ x ∈ s, ‖x‖ ≤ C - Bornology.IsBounded.exists_norm_le' 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedGroup E] {s : Set E} : Bornology.IsBounded s → ∃ C, ∀ x ∈ s, ‖x‖ ≤ C - isBounded_iff_forall_norm_le 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedAddGroup E] {s : Set E} : Bornology.IsBounded s ↔ ∃ C, ∀ x ∈ s, ‖x‖ ≤ C - isBounded_iff_forall_norm_le' 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedGroup E] {s : Set E} : Bornology.IsBounded s ↔ ∃ C, ∀ x ∈ s, ‖x‖ ≤ C - Bornology.IsBounded.exists_pos_norm_le 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedAddGroup E] {s : Set E} (hs : Bornology.IsBounded s) : ∃ R > 0, ∀ x ∈ s, ‖x‖ ≤ R - Bornology.IsBounded.exists_pos_norm_le' 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedGroup E] {s : Set E} (hs : Bornology.IsBounded s) : ∃ R > 0, ∀ x ∈ s, ‖x‖ ≤ R - Bornology.IsBounded.exists_pos_norm_lt 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedAddGroup E] {s : Set E} (hs : Bornology.IsBounded s) : ∃ R > 0, ∀ x ∈ s, ‖x‖ < R - Bornology.IsBounded.exists_pos_norm_lt' 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedGroup E] {s : Set E} (hs : Bornology.IsBounded s) : ∃ R > 0, ∀ x ∈ s, ‖x‖ < R - NormedSpace.unbounded_univ 📋 Mathlib.Analysis.Normed.Module.Basic
(𝕜 : Type u_1) (E : Type u_3) [NontriviallyNormedField 𝕜] [NormedAddCommGroup E] [NormedSpace 𝕜 E] [Nontrivial E] : ¬Bornology.IsBounded Set.univ - PseudoMetricSpace.ofSeminormedSpaceCoreReplaceAll 📋 Mathlib.Analysis.Normed.Module.Basic
{𝕜 : Type u_6} {E : Type u_7} [NormedField 𝕜] [AddCommGroup E] [Norm E] [Module 𝕜 E] [U : UniformSpace E] [B : Bornology E] (core : SeminormedSpace.Core 𝕜 E) (HU : uniformity E = uniformity E) (HB : ∀ (s : Set E), Bornology.IsBounded s ↔ Bornology.IsBounded s) : PseudoMetricSpace E - SeminormedAddCommGroup.ofCoreReplaceAll 📋 Mathlib.Analysis.Normed.Module.Basic
{𝕜 : Type u_6} {E : Type u_7} [NormedField 𝕜] [AddCommGroup E] [Norm E] [Module 𝕜 E] [U : UniformSpace E] [B : Bornology E] (core : SeminormedSpace.Core 𝕜 E) (HU : uniformity E = uniformity E) (HB : ∀ (s : Set E), Bornology.IsBounded s ↔ Bornology.IsBounded s) : SeminormedAddCommGroup E - NormedAddCommGroup.ofCoreReplaceAll 📋 Mathlib.Analysis.Normed.Module.Basic
{𝕜 : Type u_6} {E : Type u_7} [NormedField 𝕜] [AddCommGroup E] [Module 𝕜 E] [Norm E] [U : UniformSpace E] [B : Bornology E] (core : NormedSpace.Core 𝕜 E) (HU : uniformity E = uniformity E) (HB : ∀ (s : Set E), Bornology.IsBounded s ↔ Bornology.IsBounded s) : NormedAddCommGroup E - AddMonoidHom.continuous_of_isBounded_nhds_zero 📋 Mathlib.Analysis.Normed.Module.Basic
{G : Type u_6} {H : Type u_7} [SeminormedAddCommGroup G] [SeminormedAddCommGroup H] [NormedSpace ℝ H] {s : Set G} (f : G →+ H) (hs : s ∈ nhds 0) (hbounded : Bornology.IsBounded (⇑f '' s)) : Continuous ⇑f - Bornology.IsBounded.measure_lt_top 📋 Mathlib.MeasureTheory.Measure.Typeclasses.Finite
{α : Type u_1} {m0 : MeasurableSpace α} [PseudoMetricSpace α] [ProperSpace α] {μ : MeasureTheory.Measure α} [MeasureTheory.IsFiniteMeasureOnCompacts μ] ⦃s : Set α⦄ (hs : Bornology.IsBounded s) : μ s < ⊤ - Metric.hausdorffEDist_ne_top_of_nonempty_of_bounded 📋 Mathlib.Topology.MetricSpace.HausdorffDistance
{α : Type u} [PseudoMetricSpace α] {s t : Set α} (hs : s.Nonempty) (ht : t.Nonempty) (bs : Bornology.IsBounded s) (bt : Bornology.IsBounded t) : Metric.hausdorffEDist s t ≠ ⊤ - Metric.hausdorffDist_le_diam 📋 Mathlib.Topology.MetricSpace.HausdorffDistance
{α : Type u} [PseudoMetricSpace α] {s t : Set α} (hs : s.Nonempty) (bs : Bornology.IsBounded s) (ht : t.Nonempty) (bt : Bornology.IsBounded t) : Metric.hausdorffDist s t ≤ Metric.diam (s ∪ t) - Metric.dist_le_infDist_add_diam 📋 Mathlib.Topology.MetricSpace.HausdorffDistance
{α : Type u} [PseudoMetricSpace α] {s : Set α} {x y : α} (hs : Bornology.IsBounded s) (hy : y ∈ s) : dist x y ≤ Metric.infDist x s + Metric.diam s - Bornology.IsBounded.cthickening 📋 Mathlib.Topology.MetricSpace.Thickening
{α : Type u_2} [PseudoMetricSpace α] {δ : ℝ} {E : Set α} (h : Bornology.IsBounded E) : Bornology.IsBounded (Metric.cthickening δ E) - Bornology.IsBounded.thickening 📋 Mathlib.Topology.MetricSpace.Thickening
{X : Type u} [PseudoMetricSpace X] {δ : ℝ} {E : Set X} (h : Bornology.IsBounded E) : Bornology.IsBounded (Metric.thickening δ E) - Function.Periodic.isBounded_of_continuous 📋 Mathlib.Topology.Instances.Real.Lemmas
{α : Type u} [PseudoMetricSpace α] {f : ℝ → α} {c : ℝ} (hp : Function.Periodic f c) (hc : c ≠ 0) (hf : Continuous f) : Bornology.IsBounded (Set.range f) - MeasureTheory.Measure.OuterRegular.ext_isOpen_isBounded 📋 Mathlib.MeasureTheory.Measure.Regular
{α : Type u_3} [PseudoMetricSpace α] {mα : MeasurableSpace α} {μ ν : MeasureTheory.Measure α} [μ.OuterRegular] [ν.OuterRegular] (hμν : ∀ (U : Set α), IsOpen U → Bornology.IsBounded U → μ U = ν U) : μ = ν - Bornology.IsBounded.inv 📋 Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedGroup E] {s : Set E} : Bornology.IsBounded s → Bornology.IsBounded s⁻¹ - Bornology.IsBounded.neg 📋 Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddGroup E] {s : Set E} : Bornology.IsBounded s → Bornology.IsBounded (-s) - Bornology.IsBounded.div 📋 Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedGroup E] {s t : Set E} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) : Bornology.IsBounded (s / t) - Bornology.IsBounded.sub 📋 Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddGroup E] {s t : Set E} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) : Bornology.IsBounded (s - t) - Bornology.IsBounded.add 📋 Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddGroup E] {s t : Set E} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) : Bornology.IsBounded (s + t) - Bornology.IsBounded.mul 📋 Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedGroup E] {s t : Set E} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) : Bornology.IsBounded (s * t) - Bornology.IsBounded.of_add 📋 Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddGroup E] {s t : Set E} (hst : Bornology.IsBounded (s + t)) : Bornology.IsBounded s ∨ Bornology.IsBounded t - Bornology.IsBounded.of_mul 📋 Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedGroup E] {s t : Set E} (hst : Bornology.IsBounded (s * t)) : Bornology.IsBounded s ∨ Bornology.IsBounded t - Bornology.IsBounded.smul₀ 📋 Mathlib.Analysis.Normed.Module.Ball.Pointwise
{𝕜 : Type u_1} {E : Type u_2} [NormedField 𝕜] [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] {s : Set E} (hs : Bornology.IsBounded s) (c : 𝕜) : Bornology.IsBounded (c • s) - eventually_singleton_add_smul_subset 📋 Mathlib.Analysis.Normed.Module.Ball.Pointwise
{𝕜 : Type u_1} {E : Type u_2} [NormedField 𝕜] [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] {x : E} {s : Set E} (hs : Bornology.IsBounded s) {u : Set E} (hu : u ∈ nhds x) : ∀ᶠ (r : 𝕜) in nhds 0, {x} + r • s ⊆ u - NormedSpace.isVonNBounded_of_isBounded 📋 Mathlib.Analysis.LocallyConvex.Bounded
(𝕜 : Type u_1) {E : Type u_3} [NormedField 𝕜] [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] {s : Set E} (h : Bornology.IsBounded s) : Bornology.IsVonNBounded 𝕜 s - NormedSpace.isVonNBounded_iff 📋 Mathlib.Analysis.LocallyConvex.Bounded
(𝕜 : Type u_1) {E : Type u_3} [NontriviallyNormedField 𝕜] [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] {s : Set E} : Bornology.IsVonNBounded 𝕜 s ↔ Bornology.IsBounded s - NormedSpace.isBounded_iff_subset_smul_ball 📋 Mathlib.Analysis.LocallyConvex.Bounded
(𝕜 : Type u_1) {E : Type u_3} [NontriviallyNormedField 𝕜] [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] {s : Set E} : Bornology.IsBounded s ↔ ∃ a, s ⊆ a • Metric.ball 0 1 - NormedSpace.isBounded_iff_subset_smul_closedBall 📋 Mathlib.Analysis.LocallyConvex.Bounded
(𝕜 : Type u_1) {E : Type u_3} [NontriviallyNormedField 𝕜] [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] {s : Set E} : Bornology.IsBounded s ↔ ∃ a, s ⊆ a • Metric.closedBall 0 1 - Bornology.isBounded_iff_isVonNBounded 📋 Mathlib.Analysis.LocallyConvex.Bounded
(𝕜 : Type u_1) {E : Type u_3} [NormedField 𝕜] [AddCommGroup E] [Module 𝕜 E] [TopologicalSpace E] [ContinuousSMul 𝕜 E] {s : Set E} : Bornology.IsBounded s ↔ Bornology.IsVonNBounded 𝕜 s - bounded_stdSimplex 📋 Mathlib.Analysis.Convex.StdSimplex
(ι : Type u_1) [Fintype ι] : Bornology.IsBounded (stdSimplex ℝ ι) - isBounded_convexHull 📋 Mathlib.Analysis.Normed.Module.Convex
{E : Type u_1} [SeminormedAddCommGroup E] [NormedSpace ℝ E] {s : Set E} : Bornology.IsBounded ((convexHull ℝ) s) ↔ Bornology.IsBounded s - isBounded_add 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_1} [Bornology R] [Add R] [BoundedAdd R] {s t : Set R} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) : Bornology.IsBounded (s + t) - isBounded_mul 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_1} [Bornology R] [Mul R] [BoundedMul R] {s t : Set R} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) : Bornology.IsBounded (s * t) - isBounded_sub 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_1} [Bornology R] [Sub R] [BoundedSub R] {s t : Set R} (hs : Bornology.IsBounded s) (ht : Bornology.IsBounded t) : Bornology.IsBounded (s - t) - BoundedAdd.isBounded_add 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_1} {inst✝ : Bornology R} {inst✝¹ : Add R} [self : BoundedAdd R] {s t : Set R} : Bornology.IsBounded s → Bornology.IsBounded t → Bornology.IsBounded (s + t) - BoundedAdd.mk 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_1} [Bornology R] [Add R] (isBounded_add : ∀ {s t : Set R}, Bornology.IsBounded s → Bornology.IsBounded t → Bornology.IsBounded (s + t)) : BoundedAdd R - BoundedMul.isBounded_mul 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_1} {inst✝ : Bornology R} {inst✝¹ : Mul R} [self : BoundedMul R] {s t : Set R} : Bornology.IsBounded s → Bornology.IsBounded t → Bornology.IsBounded (s * t) - BoundedMul.mk 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_1} [Bornology R] [Mul R] (isBounded_mul : ∀ {s t : Set R}, Bornology.IsBounded s → Bornology.IsBounded t → Bornology.IsBounded (s * t)) : BoundedMul R - BoundedSub.isBounded_sub 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_1} {inst✝ : Bornology R} {inst✝¹ : Sub R} [self : BoundedSub R] {s t : Set R} : Bornology.IsBounded s → Bornology.IsBounded t → Bornology.IsBounded (s - t) - BoundedSub.mk 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_1} [Bornology R] [Sub R] (isBounded_sub : ∀ {s t : Set R}, Bornology.IsBounded s → Bornology.IsBounded t → Bornology.IsBounded (s - t)) : BoundedSub R - isBounded_nsmul 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_2} [Bornology R] [AddMonoid R] [BoundedAdd R] {s : Set R} (s_bdd : Bornology.IsBounded s) (n : ℕ) : Bornology.IsBounded ((fun x => n • x) '' s) - isBounded_pow 📋 Mathlib.Topology.Bornology.BoundedOperation
{R : Type u_2} [Bornology R] [Monoid R] [BoundedMul R] {s : Set R} (s_bdd : Bornology.IsBounded s) (n : ℕ) : Bornology.IsBounded ((fun x => x ^ n) '' s) - BoundedContinuousFunction.isBounded_range 📋 Mathlib.Topology.ContinuousMap.Bounded.Basic
{α : Type u} {β : Type v} [TopologicalSpace α] [PseudoMetricSpace β] (f : BoundedContinuousFunction α β) : Bornology.IsBounded (Set.range ⇑f) - BoundedContinuousFunction.isBounded_image 📋 Mathlib.Topology.ContinuousMap.Bounded.Basic
{α : Type u} {β : Type v} [TopologicalSpace α] [PseudoMetricSpace β] (f : BoundedContinuousFunction α β) (s : Set α) : Bornology.IsBounded (⇑f '' s) - MeasureTheory.Measure.addHaar_eq_zero_of_disjoint_translates 📋 Mathlib.MeasureTheory.Measure.Lebesgue.EqHaar
{E : Type u_1} [NormedAddCommGroup E] [NormedSpace ℝ E] [MeasurableSpace E] [BorelSpace E] [FiniteDimensional ℝ E] (μ : MeasureTheory.Measure E) [μ.IsAddHaarMeasure] {s : Set E} (u : ℕ → E) (hu : Bornology.IsBounded (Set.range u)) (hs : Pairwise (Function.onFun Disjoint fun n => {u n} + s)) (h's : MeasurableSet s) : μ s = 0 - MeasureTheory.Measure.addHaar_eq_zero_of_disjoint_translates_aux 📋 Mathlib.MeasureTheory.Measure.Lebesgue.EqHaar
{E : Type u_1} [NormedAddCommGroup E] [NormedSpace ℝ E] [MeasurableSpace E] [BorelSpace E] [FiniteDimensional ℝ E] (μ : MeasureTheory.Measure E) [μ.IsAddHaarMeasure] {s : Set E} (u : ℕ → E) (sb : Bornology.IsBounded s) (hu : Bornology.IsBounded (Set.range u)) (hs : Pairwise (Function.onFun Disjoint fun n => {u n} + s)) (h's : MeasurableSet s) : μ s = 0
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59