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 38275
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 6906 . 2 (𝑀 ∈ (TotBnd‘𝑋) → 𝑋 ∈ V)
2 elfvex 6906 . . 3 (𝑀 ∈ (Met‘𝑋) → 𝑋 ∈ V)
32adantr 485 . 2 ((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))) → 𝑋 ∈ V)
4 fveq2 6871 . . . . . 6 (𝑦 = 𝑋 → (Met‘𝑦) = (Met‘𝑋))
5 eqeq2 2777 . . . . . . . . 9 (𝑦 = 𝑋 → ( 𝑣 = 𝑦 𝑣 = 𝑋))
6 rexeq 3319 . . . . . . . . . 10 (𝑦 = 𝑋 → (∃𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
76ralbidv 3188 . . . . . . . . 9 (𝑦 = 𝑋 → (∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
85, 7anbi12d 643 . . . . . . . 8 (𝑦 = 𝑋 → (( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
98rexbidv 3189 . . . . . . 7 (𝑦 = 𝑋 → (∃𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
109ralbidv 3188 . . . . . 6 (𝑦 = 𝑋 → (∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
114, 10rabeqbidv 3435 . . . . 5 (𝑦 = 𝑋 → {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))} = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
12 df-totbnd 38274 . . . . 5 TotBnd = (𝑦 ∈ V ↦ {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑦 ∧ ∀𝑏𝑣𝑥𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))})
13 fvex 6884 . . . . . 6 (Met‘𝑋) ∈ V
1413rabex 5299 . . . . 5 {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))} ∈ V
1511, 12, 14fvmpt 6979 . . . 4 (𝑋 ∈ V → (TotBnd‘𝑋) = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
1615eleq2d 2851 . . 3 (𝑋 ∈ V → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))}))
17 fveq2 6871 . . . . . . . . . . 11 (𝑚 = 𝑀 → (ball‘𝑚) = (ball‘𝑀))
1817oveqd 7417 . . . . . . . . . 10 (𝑚 = 𝑀 → (𝑥(ball‘𝑚)𝑑) = (𝑥(ball‘𝑀)𝑑))
1918eqeq2d 2776 . . . . . . . . 9 (𝑚 = 𝑀 → (𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2019rexbidv 3189 . . . . . . . 8 (𝑚 = 𝑀 → (∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2120ralbidv 3188 . . . . . . 7 (𝑚 = 𝑀 → (∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2221anbi2d 641 . . . . . 6 (𝑚 = 𝑀 → (( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2322rexbidv 3189 . . . . 5 (𝑚 = 𝑀 → (∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2423ralbidv 3188 . . . 4 (𝑚 = 𝑀 → (∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2524elrab 3653 . . 3 (𝑀 ∈ {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))} ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2616, 25bitrdi 290 . 2 (𝑋 ∈ V → (𝑀 ∈ (TotBnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))))
271, 3, 26pm5.21nii 381 1 (𝑀 ∈ (TotBnd‘𝑋) ↔ (𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+𝑣 ∈ Fin ( 𝑣 = 𝑋 ∧ ∀𝑏𝑣𝑥𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1563  wcel 2145  wral 3079  wrex 3089  {crab 3417  Vcvv 3457   cuni 4867  cfv 6525  (class class class)co 7400  Fincfn 8931  +crp 13004  Metcmet 21465  ballcbl 21466  TotBndctotbnd 38272
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5250  ax-nul 5260  ax-pr 5394
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6481  df-fun 6527  df-fv 6533  df-ov 7403  df-totbnd 38274
This theorem is referenced by:  istotbnd2  38276  istotbnd3  38277  totbndmet  38278  totbndss  38283  heibor1  38316  heibor  38327
  Copyright terms: Public domain W3C validator