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 38017
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 6877 . 2 (𝑀 ∈ (TotBnd‘𝑋) → 𝑋 ∈ V)
2 elfvex 6877 . . 3 (𝑀 ∈ (Met‘𝑋) → 𝑋 ∈ V)
32adantr 480 . 2 ((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))) → 𝑋 ∈ V)
4 fveq2 6842 . . . . . 6 (𝑦 = 𝑋 → (Met‘𝑦) = (Met‘𝑋))
5 eqeq2 2749 . . . . . . . . 9 (𝑦 = 𝑋 → ( 𝑣 = 𝑦 𝑣 = 𝑋))
6 rexeq 3294 . . . . . . . . . 10 (𝑦 = 𝑋 → (∃𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
76ralbidv 3161 . . . . . . . . 9 (𝑦 = 𝑋 → (∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
85, 7anbi12d 633 . . . . . . . 8 (𝑦 = 𝑋 → (( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
98rexbidv 3162 . . . . . . 7 (𝑦 = 𝑋 → (∃𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
109ralbidv 3161 . . . . . 6 (𝑦 = 𝑋 → (∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
114, 10rabeqbidv 3419 . . . . 5 (𝑦 = 𝑋 → {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))} = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
12 df-totbnd 38016 . . . . 5 TotBnd = (𝑦 ∈ V ↦ {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))})
13 fvex 6855 . . . . . 6 (Met‘𝑋) ∈ V
1413rabex 5286 . . . . 5 {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))} ∈ V
1511, 12, 14fvmpt 6949 . . . 4 (𝑋 ∈ V → (TotBnd‘𝑋) = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
1615eleq2d 2823 . . 3 (𝑋 ∈ V → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))}))
17 fveq2 6842 . . . . . . . . . . 11 (𝑚 = 𝑀 → (ball‘𝑚) = (ball‘𝑀))
1817oveqd 7385 . . . . . . . . . 10 (𝑚 = 𝑀 → (𝑥(ball‘𝑚)𝑑) = (𝑥(ball‘𝑀)𝑑))
1918eqeq2d 2748 . . . . . . . . 9 (𝑚 = 𝑀 → (𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2019rexbidv 3162 . . . . . . . 8 (𝑚 = 𝑀 → (∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2120ralbidv 3161 . . . . . . 7 (𝑚 = 𝑀 → (∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2221anbi2d 631 . . . . . 6 (𝑚 = 𝑀 → (( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2322rexbidv 3162 . . . . 5 (𝑚 = 𝑀 → (∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2423ralbidv 3161 . . . 4 (𝑚 = 𝑀 → (∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2524elrab 3648 . . 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 1542  wcel 2114  wral 3052  wrex 3062  {crab 3401  Vcvv 3442   cuni 4865  cfv 6500  (class class class)co 7368  Fincfn 8895  +crp 12917  Metcmet 21307  ballcbl 21308  TotBndctotbnd 38014
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-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  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-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-ov 7371  df-totbnd 38016
This theorem is referenced by:  istotbnd2  38018  istotbnd3  38019  totbndmet  38020  totbndss  38025  heibor1  38058  heibor  38069
  Copyright terms: Public domain W3C validator