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

Theorem xmetunirn 24617
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 7441 . . . . . 6 (ℝ* ↑m (𝑥 × 𝑥)) ∈ V
21rabex 5299 . . . . 5 {𝑑 ∈ (ℝ* ↑m (𝑥 × 𝑥)) ∣ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤 ∈ 𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +𝑒 (𝑤𝑑𝑧)))} ∈ V
3 df-xmet 21632 . . . . 5 ∞Met = (𝑥 ∈ V ↦ {𝑑 ∈ (ℝ* ↑m (𝑥 × 𝑥)) ∣ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤 ∈ 𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +𝑒 (𝑤𝑑𝑧)))})
42, 3fnmpti 6670 . . . 4 ∞Met Fn V
5 fnunirn 7245 . . . 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 24615 . . . . . 6 (𝐷 ∈ (∞Met‘𝑥) → 𝑥 = dom dom 𝐷)
98fveq2d 6877 . . . . 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 6904 . . 3 (∞Met‘dom dom 𝐷) ⊆ ∪ ran ∞Met
1413sseli 3926 . 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 2145  ∀wral 3076  ∃wrex 3086  {crab 3412  Vcvv 3450  ∪ cuni 4866   class class class wbr 5102   × cxp 5645  dom cdm 5647  ran crn 5648   Fn wfn 6522  ‘cfv 6527  (class class class)co 7408   ↑m cmap 8825  0cc0 11171  ℝ*cxr 11313   ≤ cle 11315   +𝑒 cxad 13208  ∞Metcxmet 21624
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 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734  ax-cnex 11227  ax-resscn 11228
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 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-dif 3901  df-un 3903  df-in 3905  df-ss 3915  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 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-map 8827  df-xr 11318  df-xmet 21632
This theorem is used by:  isxms2  24728  setsmstopn  24758  tngtopn  24930  cfili  25550  cfilfcls  25556
  Copyright terms: Public domain W3C validator