Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  0totbnd Structured version   Visualization version   GIF version

Theorem 0totbnd 38973
Description: The metric (there is only one) on the empty set is totally bounded. (Contributed by Mario Carneiro, 16-Sep-2015.)
Assertion
Ref Expression
0totbnd (𝑋 = ∅ → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ (Met‘𝑋)))

Proof of Theorem 0totbnd
Dummy variables 𝑣 𝑟 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6916 . . 3 (𝑋 = ∅ → (TotBnd‘𝑋) = (TotBnd‘∅))
21eleq2d 2850 . 2 (𝑋 = ∅ → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ (TotBnd‘∅)))
3 0elpw 5324 . . . . . . 7 ∅ ∈ 𝒫 ∅
4 0fi 9108 . . . . . . 7 ∅ ∈ Fin
5 elin 4096 . . . . . . 7 (∅ ∈ (𝒫 ∅ ∩ Fin) ↔ (∅ ∈ 𝒫 ∅ ∧ ∅ ∈ Fin))
63, 4, 5mpbir2an 724 . . . . . 6 ∅ ∈ (𝒫 ∅ ∩ Fin)
7 0iun 5026 . . . . . 6 ∪ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅
8 iuneq1 4973 . . . . . . . 8 (𝑣 = ∅ → ∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∪ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟))
98eqeq1d 2765 . . . . . . 7 (𝑣 = ∅ → (∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅ ↔ ∪ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅))
109rspcev 3580 . . . . . 6 ((∅ ∈ (𝒫 ∅ ∩ Fin) ∧ ∪ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅) → ∃𝑣 ∈ (𝒫 ∅ ∩ Fin)∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅)
116, 7, 10mp2an 705 . . . . 5 ∃𝑣 ∈ (𝒫 ∅ ∩ Fin)∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅
1211rgenw 3084 . . . 4 ∀𝑟 ∈ ℝ+ ∃𝑣 ∈ (𝒫 ∅ ∩ Fin)∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅
13 istotbnd3 38971 . . . 4 (𝑀 ∈ (TotBnd‘∅) ↔ (𝑀 ∈ (Met‘∅) ∧ ∀𝑟 ∈ ℝ+ ∃𝑣 ∈ (𝒫 ∅ ∩ Fin)∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅))
1412, 13mpbiran2 723 . . 3 (𝑀 ∈ (TotBnd‘∅) ↔ 𝑀 ∈ (Met‘∅))
15 fveq2 6916 . . . 4 (𝑋 = ∅ → (Met‘𝑋) = (Met‘∅))
1615eleq2d 2850 . . 3 (𝑋 = ∅ → (𝑀 ∈ (Met‘𝑋) ↔ 𝑀 ∈ (Met‘∅)))
1714, 16bitr4id 293 . 2 (𝑋 = ∅ → (𝑀 ∈ (TotBnd‘∅) ↔ 𝑀 ∈ (Met‘𝑋)))
182, 17bitrd 282 1 (𝑋 = ∅ → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ (Met‘𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ∩ cin 4092  ∅c0 4281  𝒫 cpw 4560  ∪ ciun 4956  ‘cfv 6566  (class class class)co 7451  Fincfn 9011  ℝ+crp 13160  Metcmet 21715  ballcbl 21716  TotBndctotbnd 38966
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-om 7912  df-1st 8035  df-2nd 8036  df-1o 8514  df-en 9012  df-dom 9013  df-fin 9015  df-totbnd 38968
This theorem is used by:  prdsbnd2  38995
  Copyright terms: Public domain W3C validator