MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xmetunirn Structured version   Visualization version   GIF version

Theorem xmetunirn 24656
Description: Two ways to express an extended metric on an unspecified base. (Contributed by Mario Carneiro, 13-Oct-2015.)
Assertion
Ref Expression
xmetunirn (𝐷 ∈ ∪ ran ∞Met ↔ 𝐷 ∈ (∞Met‘dom dom 𝐷))

Proof of Theorem xmetunirn
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ovex 7453 . . . . . 6 (ℝ* ↑m (𝑥 × 𝑥)) ∈ V
21rabex 5299 . . . . 5 {𝑑 ∈ (ℝ* ↑m (𝑥 × 𝑥)) ∣ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤 ∈ 𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +e (𝑤𝑑𝑧)))} ∈ V
3 df-xmet 21671 . . . . 5 ∞Met = (𝑥 ∈ V ↦ {𝑑 ∈ (ℝ* ↑m (𝑥 × 𝑥)) ∣ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤 ∈ 𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +e (𝑤𝑑𝑧)))})
42, 3fnmpti 6682 . . . 4 ∞Met Fn V
5 fnunirn 7257 . . . 4 (∞Met Fn V → (𝐷 ∈ ∪ ran ∞Met ↔ ∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥)))
64, 5ax-mp 5 . . 3 (𝐷 ∈ ∪ ran ∞Met ↔ ∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥))
7 id 23 . . . . 5 (𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘𝑥))
8 xmetdmdm 24654 . . . . . 6 (𝐷 ∈ (∞Met‘𝑥) → 𝑥 = dom dom 𝐷)
98fveq2d 6889 . . . . 5 (𝐷 ∈ (∞Met‘𝑥) → (∞Met‘𝑥) = (∞Met‘dom dom 𝐷))
107, 9eleqtrd 2862 . . . 4 (𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
1110rexlimivw 3159 . . 3 (∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
126, 11sylbi 220 . 2 (𝐷 ∈ ∪ ran ∞Met → 𝐷 ∈ (∞Met‘dom dom 𝐷))
13 fvssunirn 6916 . . 3 (∞Met‘dom dom 𝐷) ⊆ ∪ ran ∞Met
1413sseli 3904 . 2 (𝐷 ∈ (∞Met‘dom dom 𝐷) → 𝐷 ∈ ∪ ran ∞Met)
1512, 14impbii 212 1 (𝐷 ∈ ∪ ran ∞Met ↔ 𝐷 ∈ (∞Met‘dom dom 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  {crab 3412  Vcvv 3450  ∪ cuni 4866   class class class wbr 5102   × cxp 5648  dom cdm 5650  ran crn 5651   Fn wfn 6533  ‘cfv 6538  (class class class)co 7420   ↑m cmap 8847  0cc0 11200  ℝ*cxr 11342   ≤ cle 11344   +e cxad 13239  ∞Metcxmet 21663
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11256  ax-resscn 11257
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-xr 11347  df-xmet 21671
This theorem is used by:  isxms2  24767  setsmstopn  24797  tngtopn  24969  cfili  25589  cfilfcls  25595
  Copyright terms: Public domain W3C validator