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

Theorem istotbnd 37770
Description: The predicate "is a totally bounded metric space". (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
istotbnd (𝑀 ∈ (TotBnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
Distinct variable groups:   𝑏,𝑑,𝑣,𝑥,𝑀   𝑋,𝑏,𝑑,𝑣,𝑥

Proof of Theorem istotbnd
Dummy variables 𝑚 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elfvex 6899 . 2 (𝑀 ∈ (TotBnd‘𝑋) → 𝑋 ∈ V)
2 elfvex 6899 . . 3 (𝑀 ∈ (Met‘𝑋) → 𝑋 ∈ V)
32adantr 480 . 2 ((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))) → 𝑋 ∈ V)
4 fveq2 6861 . . . . . 6 (𝑦 = 𝑋 → (Met‘𝑦) = (Met‘𝑋))
5 eqeq2 2742 . . . . . . . . 9 (𝑦 = 𝑋 → ( 𝑣 = 𝑦 𝑣 = 𝑋))
6 rexeq 3297 . . . . . . . . . 10 (𝑦 = 𝑋 → (∃𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
76ralbidv 3157 . . . . . . . . 9 (𝑦 = 𝑋 → (∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
85, 7anbi12d 632 . . . . . . . 8 (𝑦 = 𝑋 → (( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
98rexbidv 3158 . . . . . . 7 (𝑦 = 𝑋 → (∃𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
109ralbidv 3157 . . . . . 6 (𝑦 = 𝑋 → (∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
114, 10rabeqbidv 3427 . . . . 5 (𝑦 = 𝑋 → {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))} = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
12 df-totbnd 37769 . . . . 5 TotBnd = (𝑦 ∈ V ↦ {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))})
13 fvex 6874 . . . . . 6 (Met‘𝑋) ∈ V
1413rabex 5297 . . . . 5 {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))} ∈ V
1511, 12, 14fvmpt 6971 . . . 4 (𝑋 ∈ V → (TotBnd‘𝑋) = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
1615eleq2d 2815 . . 3 (𝑋 ∈ V → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))}))
17 fveq2 6861 . . . . . . . . . . 11 (𝑚 = 𝑀 → (ball‘𝑚) = (ball‘𝑀))
1817oveqd 7407 . . . . . . . . . 10 (𝑚 = 𝑀 → (𝑥(ball‘𝑚)𝑑) = (𝑥(ball‘𝑀)𝑑))
1918eqeq2d 2741 . . . . . . . . 9 (𝑚 = 𝑀 → (𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2019rexbidv 3158 . . . . . . . 8 (𝑚 = 𝑀 → (∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2120ralbidv 3157 . . . . . . 7 (𝑚 = 𝑀 → (∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2221anbi2d 630 . . . . . 6 (𝑚 = 𝑀 → (( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2322rexbidv 3158 . . . . 5 (𝑚 = 𝑀 → (∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2423ralbidv 3157 . . . 4 (𝑚 = 𝑀 → (∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2524elrab 3662 . . 3 (𝑀 ∈ {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))} ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2616, 25bitrdi 287 . 2 (𝑋 ∈ V → (𝑀 ∈ (TotBnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))))
271, 3, 26pm5.21nii 378 1 (𝑀 ∈ (TotBnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1540  wcel 2109  wral 3045  wrex 3054  {crab 3408  Vcvv 3450   cuni 4874  cfv 6514  (class class class)co 7390  Fincfn 8921  +crp 12958  Metcmet 21257  ballcbl 21258  TotBndctotbnd 37767
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-iota 6467  df-fun 6516  df-fv 6522  df-ov 7393  df-totbnd 37769
This theorem is referenced by:  istotbnd2  37771  istotbnd3  37772  totbndmet  37773  totbndss  37778  heibor1  37811  heibor  37822
  Copyright terms: Public domain W3C validator