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 38671
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 6912 . 2 (𝑀 ∈ (TotBnd‘𝑋) → 𝑋 ∈ V)
2 elfvex 6912 . . 3 (𝑀 ∈ (Met‘𝑋) → 𝑋 ∈ V)
32adantr 486 . 2 ((𝑀 ∈ (Met‘𝑋) ∧ ∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))) → 𝑋 ∈ V)
4 fveq2 6877 . . . . . 6 (𝑦 = 𝑋 → (Met‘𝑦) = (Met‘𝑋))
5 eqeq2 2773 . . . . . . . . 9 (𝑦 = 𝑋 → (∪ 𝑣 = 𝑦 ↔ ∪ 𝑣 = 𝑋))
6 rexeq 3316 . . . . . . . . . 10 (𝑦 = 𝑋 → (∃𝑥 ∈ 𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
76ralbidv 3186 . . . . . . . . 9 (𝑦 = 𝑋 → (∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)))
85, 7anbi12d 644 . . . . . . . 8 (𝑦 = 𝑋 → ((∪ 𝑣 = 𝑦 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
98rexbidv 3187 . . . . . . 7 (𝑦 = 𝑋 → (∃𝑣 ∈ Fin (∪ 𝑣 = 𝑦 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
109ralbidv 3186 . . . . . 6 (𝑦 = 𝑋 → (∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑦 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))))
114, 10rabeqbidv 3430 . . . . 5 (𝑦 = 𝑋 → {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑦 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))} = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
12 df-totbnd 38670 . . . . 5 TotBnd = (𝑦 ∈ V ↦ {𝑚 ∈ (Met‘𝑦) ∣ ∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑦 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑦 𝑏 = (𝑥(ball‘𝑚)𝑑))})
13 fvex 6890 . . . . . 6 (Met‘𝑋) ∈ V
1413rabex 5300 . . . . 5 {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))} ∈ V
1511, 12, 14fvmpt 6985 . . . 4 (𝑋 ∈ V → (TotBnd‘𝑋) = {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))})
1615eleq2d 2847 . . 3 (𝑋 ∈ V → (𝑀 ∈ (TotBnd‘𝑋) ↔ 𝑀 ∈ {𝑚 ∈ (Met‘𝑋) ∣ ∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑))}))
17 fveq2 6877 . . . . . . . . . . 11 (𝑚 = 𝑀 → (ball‘𝑚) = (ball‘𝑀))
1817oveqd 7429 . . . . . . . . . 10 (𝑚 = 𝑀 → (𝑥(ball‘𝑚)𝑑) = (𝑥(ball‘𝑀)𝑑))
1918eqeq2d 2772 . . . . . . . . 9 (𝑚 = 𝑀 → (𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2019rexbidv 3187 . . . . . . . 8 (𝑚 = 𝑀 → (∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2120ralbidv 3186 . . . . . . 7 (𝑚 = 𝑀 → (∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑) ↔ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑)))
2221anbi2d 642 . . . . . 6 (𝑚 = 𝑀 → ((∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2322rexbidv 3187 . . . . 5 (𝑚 = 𝑀 → (∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2423ralbidv 3186 . . . 4 (𝑚 = 𝑀 → (∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑚)𝑑)) ↔ ∀𝑑 ∈ ℝ+ ∃𝑣 ∈ Fin (∪ 𝑣 = 𝑋 ∧ ∀𝑏 ∈ 𝑣 ∃𝑥 ∈ 𝑋 𝑏 = (𝑥(ball‘𝑀)𝑑))))
2524elrab 3645 . . 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
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  {crab 3413  Vcvv 3451  ∪ cuni 4867  ‘cfv 6531  (class class class)co 7412  Fincfn 8957  ℝ+crp 13101  Metcmet 21644  ballcbl 21645  TotBndctotbnd 38668
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-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-totbnd 38670
This theorem is used by:  istotbnd2  38672  istotbnd3  38673  totbndmet  38674  totbndss  38679  heibor1  38712  heibor  38723
  Copyright terms: Public domain W3C validator