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

Theorem istotbnd 33900
 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 6384 . 2 (𝑀 ∈ (TotBnd‘𝑋) → 𝑋 ∈ V)
2 elfvex 6384 . . 3 (𝑀 ∈ (Met‘𝑋) → 𝑋 ∈ V)
32adantr 472 . 2 ((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))) → 𝑋 ∈ V)
4 fveq2 6354 . . . . . 6 (𝑦 = 𝑋 → (Met‘𝑦) = (Met‘𝑋))
5 eqeq2 2772 . . . . . . . . 9 (𝑦 = 𝑋 → ( 𝑣 = 𝑦 𝑣 = 𝑋))
6 rexeq 3279 . . . . . . . . . 10 (𝑦 = 𝑋 → (∃𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
76ralbidv 3125 . . . . . . . . 9 (𝑦 = 𝑋 → (∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
85, 7anbi12d 749 . . . . . . . 8 (𝑦 = 𝑋 → (( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
98rexbidv 3191 . . . . . . 7 (𝑦 = 𝑋 → (∃𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
109ralbidv 3125 . . . . . 6 (𝑦 = 𝑋 → (∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
114, 10rabeqbidv 3336 . . . . 5 (𝑦 = 𝑋 → {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))} = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
12 df-totbnd 33899 . . . . 5 TotBnd = (𝑦 ∈ V ↦ {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))})
13 fvex 6364 . . . . . 6 (Met‘𝑋) ∈ V
1413rabex 4965 . . . . 5 {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))} ∈ V
1511, 12, 14fvmpt 6446 . . . 4 (𝑋 ∈ V → (TotBnd‘𝑋) = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
1615eleq2d 2826 . . 3 (𝑋 ∈ V → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))}))
17 fveq2 6354 . . . . . . . . . . 11 (𝑚 = 𝑀 → (ball‘𝑚) = (ball‘𝑀))
1817oveqd 6832 . . . . . . . . . 10 (𝑚 = 𝑀 → (𝑥(ball‘𝑚)𝑑) = (𝑥(ball‘𝑀)𝑑))
1918eqeq2d 2771 . . . . . . . . 9 (𝑚 = 𝑀 → (𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2019rexbidv 3191 . . . . . . . 8 (𝑚 = 𝑀 → (∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2120ralbidv 3125 . . . . . . 7 (𝑚 = 𝑀 → (∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2221anbi2d 742 . . . . . 6 (𝑚 = 𝑀 → (( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2322rexbidv 3191 . . . . 5 (𝑚 = 𝑀 → (∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2423ralbidv 3125 . . . 4 (𝑚 = 𝑀 → (∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2524elrab 3505 . . 3 (𝑀 ∈ {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))} ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2616, 25syl6bb 276 . 2 (𝑋 ∈ V → (𝑀 ∈ (TotBnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))))
271, 3, 26pm5.21nii 367 1 (𝑀 ∈ (TotBnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 383   = wceq 1632   ∈ wcel 2140  ∀wral 3051  ∃wrex 3052  {crab 3055  Vcvv 3341  ∪ cuni 4589  ‘cfv 6050  (class class class)co 6815  Fincfn 8124  ℝ+crp 12046  Metcme 19955  ballcbl 19956  TotBndctotbnd 33897 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1989  ax-6 2055  ax-7 2091  ax-8 2142  ax-9 2149  ax-10 2169  ax-11 2184  ax-12 2197  ax-13 2392  ax-ext 2741  ax-sep 4934  ax-nul 4942  ax-pow 4993  ax-pr 5056 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2048  df-eu 2612  df-mo 2613  df-clab 2748  df-cleq 2754  df-clel 2757  df-nfc 2892  df-ne 2934  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3343  df-sbc 3578  df-dif 3719  df-un 3721  df-in 3723  df-ss 3730  df-nul 4060  df-if 4232  df-sn 4323  df-pr 4325  df-op 4329  df-uni 4590  df-br 4806  df-opab 4866  df-mpt 4883  df-id 5175  df-xp 5273  df-rel 5274  df-cnv 5275  df-co 5276  df-dm 5277  df-iota 6013  df-fun 6052  df-fv 6058  df-ov 6818  df-totbnd 33899 This theorem is referenced by:  istotbnd2  33901  istotbnd3  33902  totbndmet  33903  totbndss  33908  heibor1  33941  heibor  33952
 Copyright terms: Public domain W3C validator