Theorem xmetunirn 13943

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.

Step	Hyp	Ref	Expression
1		fnmap 6657	. . . . . . 7 ⊢ ↑𝑚 Fn (V × V)
2		xrex 9858	. . . . . . 7 ⊢ ℝ* ∈ V
3		sqxpexg 4744	. . . . . . . 8 ⊢ (𝑥 ∈ V → (𝑥 × 𝑥) ∈ V)
4	3	elv 2743	. . . . . . 7 ⊢ (𝑥 × 𝑥) ∈ V
5		fnovex 5910	. . . . . . 7 ⊢ (( ↑𝑚 Fn (V × V) ∧ ℝ* ∈ V ∧ (𝑥 × 𝑥) ∈ V) → (ℝ* ↑𝑚 (𝑥 × 𝑥)) ∈ V)
6	1, 2, 4, 5	mp3an 1337	. . . . . 6 ⊢ (ℝ* ↑𝑚 (𝑥 × 𝑥)) ∈ V
7	6	rabex 4149	. . . . 5 ⊢ {𝑑 ∈ (ℝ* ↑𝑚 (𝑥 × 𝑥)) ∣ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤 ∈ 𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +𝑒 (𝑤𝑑𝑧)))} ∈ V
8		df-xmet 13533	. . . . 5 ⊢ ∞Met = (𝑥 ∈ V ↦ {𝑑 ∈ (ℝ* ↑𝑚 (𝑥 × 𝑥)) ∣ ∀𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 (((𝑦𝑑𝑧) = 0 ↔ 𝑦 = 𝑧) ∧ ∀𝑤 ∈ 𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +𝑒 (𝑤𝑑𝑧)))})
9	7, 8	fnmpti 5346	. . . 4 ⊢ ∞Met Fn V
10		fnunirn 5770	. . . 4 ⊢ (∞Met Fn V → (𝐷 ∈ ∪ ran ∞Met ↔ ∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥)))
11	9, 10	ax-mp 5	. . 3 ⊢ (𝐷 ∈ ∪ ran ∞Met ↔ ∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥))
12		id 19	. . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘𝑥))
13		xmetdmdm 13941	. . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑥) → 𝑥 = dom dom 𝐷)
14	13	fveq2d 5521	. . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑥) → (∞Met‘𝑥) = (∞Met‘dom dom 𝐷))
15	12, 14	eleqtrd 2256	. . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
16	15	rexlimivw 2590	. . 3 ⊢ (∃𝑥 ∈ V 𝐷 ∈ (∞Met‘𝑥) → 𝐷 ∈ (∞Met‘dom dom 𝐷))
17	11, 16	sylbi 121	. 2 ⊢ (𝐷 ∈ ∪ ran ∞Met → 𝐷 ∈ (∞Met‘dom dom 𝐷))
18		elex 2750	. . . . . 6 ⊢ (𝐷 ∈ (∞Met‘dom dom 𝐷) → 𝐷 ∈ V)
19		dmexg 4893	. . . . . 6 ⊢ (𝐷 ∈ V → dom 𝐷 ∈ V)
20		dmexg 4893	. . . . . 6 ⊢ (dom 𝐷 ∈ V → dom dom 𝐷 ∈ V)
21	18, 19, 20	3syl 17	. . . . 5 ⊢ (𝐷 ∈ (∞Met‘dom dom 𝐷) → dom dom 𝐷 ∈ V)
22		fvssunirng 5532	. . . . 5 ⊢ (dom dom 𝐷 ∈ V → (∞Met‘dom dom 𝐷) ⊆ ∪ ran ∞Met)
23	21, 22	syl 14	. . . 4 ⊢ (𝐷 ∈ (∞Met‘dom dom 𝐷) → (∞Met‘dom dom 𝐷) ⊆ ∪ ran ∞Met)
24	23	sseld 3156	. . 3 ⊢ (𝐷 ∈ (∞Met‘dom dom 𝐷) → (𝐷 ∈ (∞Met‘dom dom 𝐷) → 𝐷 ∈ ∪ ran ∞Met))
25	24	pm2.43i 49	. 2 ⊢ (𝐷 ∈ (∞Met‘dom dom 𝐷) → 𝐷 ∈ ∪ ran ∞Met)
26	17, 25	impbii 126	1 ⊢ (𝐷 ∈ ∪ ran ∞Met ↔ 𝐷 ∈ (∞Met‘dom dom 𝐷))

Syntax hints:   ∧ wa 104   ↔ wb 105   = wceq 1353   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  {crab 2459  Vcvv 2739   ⊆ wss 3131  ∪ cuni 3811   class class class wbr 4005   × cxp 4626  dom cdm 4628  ran crn 4629   Fn wfn 5213  ‘cfv 5218  (class class class)co 5877   ↑_𝑚 cmap 6650  0cc0 7813  ℝ^*cxr 7993   ≤ cle 7995   +_𝑒 cxad 9772  ∞Metcxmet 13525

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-map 6652  df-pnf 7996  df-mnf 7997  df-xr 7998  df-xmet 13533

This theorem is referenced by:  isxms2  14037