ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xmetunirn GIF version

Theorem xmetunirn 15382
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 fnmap 6919 . . . . . . 7 𝑚 Fn (V × V)
2 xrex 10237 . . . . . . 7 * ∈ V
3 sqxpexg 4888 . . . . . . . 8 (𝑥 ∈ V → (𝑥 × 𝑥) ∈ V)
43elv 2825 . . . . . . 7 (𝑥 × 𝑥) ∈ V
5 fnovex 6108 . . . . . . 7 (( ↑𝑚 Fn (V × V) ∧ ℝ* ∈ V ∧ (𝑥 × 𝑥) ∈ V) → (ℝ*𝑚 (𝑥 × 𝑥)) ∈ V)
61, 2, 4, 5mp3an 1378 . . . . . 6 (ℝ*𝑚 (𝑥 × 𝑥)) ∈ V
76rabex 4275 . . . . 5 {𝑑 ∈ (ℝ*𝑚 (𝑥 × 𝑥)) ∣ ∀𝑦𝑥𝑧𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +𝑒 (𝑤𝑑𝑧)))} ∈ V
8 df-xmet 14853 . . . . 5 ∞Met = (𝑥 ∈ V ↦ {𝑑 ∈ (ℝ*𝑚 (𝑥 × 𝑥)) ∣ ∀𝑦𝑥𝑧𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +𝑒 (𝑤𝑑𝑧)))})
97, 8fnmpti 5507 . . . 4 ∞Met Fn V
10 fnunirn 5963 . . . 4 (∞Met Fn V → (𝐷 ran ∞Met ↔ ∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥)))
119, 10ax-mp 5 . . 3 (𝐷 ran ∞Met ↔ ∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥))
12 id 19 . . . . 5 (𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘𝑥))
13 xmetdmdm 15380 . . . . . 6 (𝐷 ∈ (∞Met‘𝑥) → 𝑥 = dom dom 𝐷)
1413fveq2d 5694 . . . . 5 (𝐷 ∈ (∞Met‘𝑥) → (∞Met‘𝑥) = (∞Met‘dom dom 𝐷))
1512, 14eleqtrd 2317 . . . 4 (𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
1615rexlimivw 2664 . . 3 (∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
1711, 16sylbi 121 . 2 (𝐷 ran ∞Met → 𝐷 ∈ (∞Met‘dom dom 𝐷))
18 elex 2833 . . . . . 6 (𝐷 ∈ (∞Met‘dom dom 𝐷) → 𝐷 ∈ V)
19 dmexg 5041 . . . . . 6 (𝐷 ∈ V → dom 𝐷 ∈ V)
20 dmexg 5041 . . . . . 6 (dom 𝐷 ∈ V → dom dom 𝐷 ∈ V)
2118, 19, 203syl 17 . . . . 5 (𝐷 ∈ (∞Met‘dom dom 𝐷) → dom dom 𝐷 ∈ V)
22 fvssunirng 5705 . . . . 5 (dom dom 𝐷 ∈ V → (∞Met‘dom dom 𝐷) ⊆ ran ∞Met)
2321, 22syl 14 . . . 4 (𝐷 ∈ (∞Met‘dom dom 𝐷) → (∞Met‘dom dom 𝐷) ⊆ ran ∞Met)
2423sseld 3247 . . 3 (𝐷 ∈ (∞Met‘dom dom 𝐷) → (𝐷 ∈ (∞Met‘dom dom 𝐷) → 𝐷 ran ∞Met))
2524pm2.43i 49 . 2 (𝐷 ∈ (∞Met‘dom dom 𝐷) → 𝐷 ran ∞Met)
2617, 25impbii 126 1 (𝐷 ran ∞Met ↔ 𝐷 ∈ (∞Met‘dom dom 𝐷))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1402  wcel 2209  wral 2528  wrex 2529  {crab 2532  Vcvv 2821  wss 3220   cuni 3930   class class class wbr 4125   × cxp 4767  dom cdm 4769  ran crn 4770   Fn wfn 5367  cfv 5372  (class class class)co 6075  𝑚 cmap 6912  0cc0 8169  *cxr 8349  cle 8351   +𝑒 cxad 10151  ∞Metcxmet 14845
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-map 6914  df-pnf 8352  df-mnf 8353  df-xr 8354  df-xmet 14853
This theorem is referenced by:  isxms2  15476
  Copyright terms: Public domain W3C validator