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 38482
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 6885 . . 3 (𝑋 = ∅ → (TotBnd‘𝑋) = (TotBnd‘∅))
21eleq2d 2851 . 2 (𝑋 = ∅ → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ (TotBnd‘∅)))
3 0elpw 5328 . . . . . . 7 ∅ ∈ 𝒫 ∅
4 0fi 9046 . . . . . . 7 ∅ ∈ Fin
5 elin 3922 . . . . . . 7 (∅ ∈ (𝒫 ∅ ∩ Fin) ↔ (∅ ∈ 𝒫 ∅ ∧ ∅ ∈ Fin))
63, 4, 5mpbir2an 724 . . . . . 6 ∅ ∈ (𝒫 ∅ ∩ Fin)
7 0iun 5029 . . . . . 6 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅
8 iuneq1 4975 . . . . . . . 8 (𝑣 = ∅ → 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟))
98eqeq1d 2767 . . . . . . 7 (𝑣 = ∅ → ( 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅ ↔ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅))
109rspcev 3583 . . . . . 6 ((∅ ∈ (𝒫 ∅ ∩ Fin) ∧ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅) → ∃𝑣 ∈ (𝒫 ∅ ∩ Fin) 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅)
116, 7, 10mp2an 705 . . . . 5 𝑣 ∈ (𝒫 ∅ ∩ Fin) 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅
1211rgenw 3085 . . . 4 𝑟 ∈ ℝ+𝑣 ∈ (𝒫 ∅ ∩ Fin) 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅
13 istotbnd3 38480 . . . 4 (𝑀 ∈ (TotBnd‘∅) ↔ (𝑀 ∈ (Met‘∅) ∧ ∀𝑟 ∈ ℝ+𝑣 ∈ (𝒫 ∅ ∩ Fin) 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅))
1412, 13mpbiran2 723 . . 3 (𝑀 ∈ (TotBnd‘∅) ↔ 𝑀 ∈ (Met‘∅))
15 fveq2 6885 . . . 4 (𝑋 = ∅ → (Met‘𝑋) = (Met‘∅))
1615eleq2d 2851 . . 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 2146  wral 3081  wrex 3091  cin 3905  c0 4286  𝒫 cpw 4564   ciun 4958  cfv 6540  (class class class)co 7419  Fincfn 8949  +crp 13032  Metcmet 21558  ballcbl 21559  TotBndctotbnd 38475
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-om 7869  df-1st 7992  df-2nd 7993  df-1o 8459  df-en 8950  df-dom 8951  df-fin 8953  df-totbnd 38477
This theorem is used by:  prdsbnd2  38504
  Copyright terms: Public domain W3C validator