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

Theorem xmetunirn 15081
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 6823 . . . . . . 7 𝑚 Fn (V × V)
2 xrex 10090 . . . . . . 7 * ∈ V
3 sqxpexg 4843 . . . . . . . 8 (𝑥 ∈ V → (𝑥 × 𝑥) ∈ V)
43elv 2806 . . . . . . 7 (𝑥 × 𝑥) ∈ V
5 fnovex 6050 . . . . . . 7 (( ↑𝑚 Fn (V × V) ∧ ℝ* ∈ V ∧ (𝑥 × 𝑥) ∈ V) → (ℝ*𝑚 (𝑥 × 𝑥)) ∈ V)
61, 2, 4, 5mp3an 1373 . . . . . 6 (ℝ*𝑚 (𝑥 × 𝑥)) ∈ V
76rabex 4234 . . . . 5 {𝑑 ∈ (ℝ*𝑚 (𝑥 × 𝑥)) ∣ ∀𝑦𝑥𝑧𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +𝑒 (𝑤𝑑𝑧)))} ∈ V
8 df-xmet 14557 . . . . 5 ∞Met = (𝑥 ∈ V ↦ {𝑑 ∈ (ℝ*𝑚 (𝑥 × 𝑥)) ∣ ∀𝑦𝑥𝑧𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +𝑒 (𝑤𝑑𝑧)))})
97, 8fnmpti 5461 . . . 4 ∞Met Fn V
10 fnunirn 5907 . . . 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 15079 . . . . . 6 (𝐷 ∈ (∞Met‘𝑥) → 𝑥 = dom dom 𝐷)
1413fveq2d 5643 . . . . 5 (𝐷 ∈ (∞Met‘𝑥) → (∞Met‘𝑥) = (∞Met‘dom dom 𝐷))
1512, 14eleqtrd 2310 . . . 4 (𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
1615rexlimivw 2646 . . 3 (∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
1711, 16sylbi 121 . 2 (𝐷 ran ∞Met → 𝐷 ∈ (∞Met‘dom dom 𝐷))
18 elex 2814 . . . . . 6 (𝐷 ∈ (∞Met‘dom dom 𝐷) → 𝐷 ∈ V)
19 dmexg 4996 . . . . . 6 (𝐷 ∈ V → dom 𝐷 ∈ V)
20 dmexg 4996 . . . . . 6 (dom 𝐷 ∈ V → dom dom 𝐷 ∈ V)
2118, 19, 203syl 17 . . . . 5 (𝐷 ∈ (∞Met‘dom dom 𝐷) → dom dom 𝐷 ∈ V)
22 fvssunirng 5654 . . . . 5 (dom dom 𝐷 ∈ V → (∞Met‘dom dom 𝐷) ⊆ ran ∞Met)
2321, 22syl 14 . . . 4 (𝐷 ∈ (∞Met‘dom dom 𝐷) → (∞Met‘dom dom 𝐷) ⊆ ran ∞Met)
2423sseld 3226 . . 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 1397  wcel 2202  wral 2510  wrex 2511  {crab 2514  Vcvv 2802  wss 3200   cuni 3893   class class class wbr 4088   × cxp 4723  dom cdm 4725  ran crn 4726   Fn wfn 5321  cfv 5326  (class class class)co 6017  𝑚 cmap 6816  0cc0 8031  *cxr 8212  cle 8214   +𝑒 cxad 10004  ∞Metcxmet 14549
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-map 6818  df-pnf 8215  df-mnf 8216  df-xr 8217  df-xmet 14557
This theorem is referenced by:  isxms2  15175
  Copyright terms: Public domain W3C validator