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 38687
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 6883 . . 3 (𝑋 = ∅ → (TotBnd‘𝑋) = (TotBnd‘∅))
21eleq2d 2847 . 2 (𝑋 = ∅ → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ (TotBnd‘∅)))
3 0elpw 5317 . . . . . . 7 ∅ ∈ 𝒫 ∅
4 0fi 9063 . . . . . . 7 ∅ ∈ Fin
5 elin 3915 . . . . . . 7 (∅ ∈ (𝒫 ∅ ∩ Fin) ↔ (∅ ∈ 𝒫 ∅ ∧ ∅ ∈ Fin))
63, 4, 5mpbir2an 724 . . . . . 6 ∅ ∈ (𝒫 ∅ ∩ Fin)
7 0iun 5021 . . . . . 6 ∪ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅
8 iuneq1 4968 . . . . . . . 8 (𝑣 = ∅ → ∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∪ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟))
98eqeq1d 2763 . . . . . . 7 (𝑣 = ∅ → (∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅ ↔ ∪ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅))
109rspcev 3577 . . . . . 6 ((∅ ∈ (𝒫 ∅ ∩ Fin) ∧ ∪ 𝑥 ∈ ∅ (𝑥(ball‘𝑀)𝑟) = ∅) → ∃𝑣 ∈ (𝒫 ∅ ∩ Fin)∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅)
116, 7, 10mp2an 705 . . . . 5 ∃𝑣 ∈ (𝒫 ∅ ∩ Fin)∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅
1211rgenw 3081 . . . 4 ∀𝑟 ∈ ℝ+ ∃𝑣 ∈ (𝒫 ∅ ∩ Fin)∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅
13 istotbnd3 38685 . . . 4 (𝑀 ∈ (TotBnd‘∅) ↔ (𝑀 ∈ (Met‘∅) ∧ ∀𝑟 ∈ ℝ+ ∃𝑣 ∈ (𝒫 ∅ ∩ Fin)∪ 𝑥 ∈ 𝑣 (𝑥(ball‘𝑀)𝑟) = ∅))
1412, 13mpbiran2 723 . . 3 (𝑀 ∈ (TotBnd‘∅) ↔ 𝑀 ∈ (Met‘∅))
15 fveq2 6883 . . . 4 (𝑋 = ∅ → (Met‘𝑋) = (Met‘∅))
1615eleq2d 2847 . . 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 2145  ∀wral 3077  ∃wrex 3087   ∩ cin 3898  ∅c0 4279  𝒫 cpw 4557  ∪ ciun 4951  ‘cfv 6537  (class class class)co 7418  Fincfn 8966  ℝ+crp 13113  Metcmet 21657  ballcbl 21658  TotBndctotbnd 38680
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-om 7876  df-1st 7999  df-2nd 8000  df-1o 8469  df-en 8967  df-dom 8968  df-fin 8970  df-totbnd 38682
This theorem is used by:  prdsbnd2  38709
  Copyright terms: Public domain W3C validator