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

Theorem xmetunirn 24686
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 7476 . . . . . 6 (ℝ* ↑m (𝑥 × 𝑥)) ∈ V
21rabex 5304 . . . . 5 {𝑑 ∈ (ℝ* ↑m (𝑥 × 𝑥)) ∣ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤 ∈ 𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +e (𝑤𝑑𝑧)))} ∈ V
3 df-xmet 21701 . . . . 5 ∞Met = (𝑥 ∈ V ↦ {𝑑 ∈ (ℝ* ↑m (𝑥 × 𝑥)) ∣ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤 ∈ 𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +e (𝑤𝑑𝑧)))})
42, 3fnmpti 6704 . . . 4 ∞Met Fn V
5 fnunirn 7280 . . . 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 24684 . . . . . 6 (𝐷 ∈ (∞Met‘𝑥) → 𝑥 = dom dom 𝐷)
98fveq2d 6912 . . . . 5 (𝐷 ∈ (∞Met‘𝑥) → (∞Met‘𝑥) = (∞Met‘dom dom 𝐷))
107, 9eleqtrd 2866 . . . 4 (𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
1110rexlimivw 3163 . . 3 (∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
126, 11sylbi 220 . 2 (𝐷 ∈ ∪ ran ∞Met → 𝐷 ∈ (∞Met‘dom dom 𝐷))
13 fvssunirn 6939 . . 3 (∞Met‘dom dom 𝐷) ⊆ ∪ ran ∞Met
1413sseli 3909 . 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 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454  ∪ cuni 4870   class class class wbr 5106   × cxp 5653  dom cdm 5655  ran crn 5656   Fn wfn 6553  ‘cfv 6558  (class class class)co 7443   ↑m cmap 8875  0cc0 11227  ℝ*cxr 11369   ≤ cle 11371   +e cxad 13266  ∞Metcxmet 21693
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-map 8877  df-xr 11374  df-xmet 21701
This theorem is used by:  isxms2  24797  setsmstopn  24827  tngtopn  24999  cfili  25619  cfilfcls  25625
  Copyright terms: Public domain W3C validator