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 38024
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 6842 . . 3 (𝑋 = ∅ → (TotBnd‘𝑋) = (TotBnd‘∅))
21eleq2d 2823 . 2 (𝑋 = ∅ → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ (TotBnd‘∅)))
3 0elpw 5303 . . . . . . 7 ∅ ∈ 𝒫 ∅
4 0fi 8991 . . . . . . 7 ∅ ∈ Fin
5 elin 3919 . . . . . . 7 (∅ ∈ (𝒫 ∅ ∩ Fin) ↔ (∅ ∈ 𝒫 ∅ ∧ ∅ ∈ Fin))
63, 4, 5mpbir2an 712 . . . . . 6 ∅ ∈ (𝒫 ∅ ∩ Fin)
7 0iun 5020 . . . . . 6 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅
8 iuneq1 4965 . . . . . . . 8 (𝑣 = ∅ → 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟))
98eqeq1d 2739 . . . . . . 7 (𝑣 = ∅ → ( 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅ ↔ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅))
109rspcev 3578 . . . . . 6 ((∅ ∈ (𝒫 ∅ ∩ Fin) ∧ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅) → ∃𝑣 ∈ (𝒫 ∅ ∩ Fin) 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅)
116, 7, 10mp2an 693 . . . . 5 𝑣 ∈ (𝒫 ∅ ∩ Fin) 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅
1211rgenw 3056 . . . 4 𝑟 ∈ ℝ+𝑣 ∈ (𝒫 ∅ ∩ Fin) 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅
13 istotbnd3 38022 . . . 4 (𝑀 ∈ (TotBnd‘∅) ↔ (𝑀 ∈ (Met‘∅) ∧ ∀𝑟 ∈ ℝ+𝑣 ∈ (𝒫 ∅ ∩ Fin) 𝑥𝑣 (𝑥(ball‘𝑀)𝑟) = ∅))
1412, 13mpbiran2 711 . . 3 (𝑀 ∈ (TotBnd‘∅) ↔ 𝑀 ∈ (Met‘∅))
15 fveq2 6842 . . . 4 (𝑋 = ∅ → (Met‘𝑋) = (Met‘∅))
1615eleq2d 2823 . . 3 (𝑋 = ∅ → (𝑀 ∈ (Met‘𝑋) ↔ 𝑀 ∈ (Met‘∅)))
1714, 16bitr4id 290 . 2 (𝑋 = ∅ → (𝑀 ∈ (TotBnd‘∅) ↔ 𝑀 ∈ (Met‘𝑋)))
182, 17bitrd 279 1 (𝑋 = ∅ → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ (Met‘𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1542  wcel 2114  wral 3052  wrex 3062  cin 3902  c0 4287  𝒫 cpw 4556   ciun 4948  cfv 6500  (class class class)co 7368  Fincfn 8895  +crp 12917  Metcmet 21307  ballcbl 21308  TotBndctotbnd 38017
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-om 7819  df-1st 7943  df-2nd 7944  df-1o 8407  df-en 8896  df-dom 8897  df-fin 8899  df-totbnd 38019
This theorem is referenced by:  prdsbnd2  38046
  Copyright terms: Public domain W3C validator