prdsdsval - Metamath Proof Explorer

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

Theorem prdsdsval 17410

Description: Value of the metric in a structure product. (Contributed by Mario Carneiro, 20-Aug-2015.)

**Hypotheses**
Ref	Expression
prdsbasmpt.y	⊢ 𝑌 = (𝑆X_s𝑅)
prdsbasmpt.b	⊢ 𝐵 = (Base‘𝑌)
prdsbasmpt.s	⊢ (𝜑 → 𝑆 ∈ 𝑉)
prdsbasmpt.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
prdsbasmpt.r	⊢ (𝜑 → 𝑅 Fn 𝐼)
prdsplusgval.f	⊢ (𝜑 → 𝐹 ∈ 𝐵)
prdsplusgval.g	⊢ (𝜑 → 𝐺 ∈ 𝐵)
prdsdsval.d	⊢ 𝐷 = (dist‘𝑌)

**Assertion**
Ref	Expression
prdsdsval	⊢ (𝜑 → (𝐹𝐷𝐺) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥))) ∪ {0}), ℝ^*, < ))

Distinct variable groups: 𝑥,𝐵 𝑥,𝐹 𝑥,𝐺 𝜑,𝑥 𝑥,𝐼 𝑥,𝑉 𝑥,𝑅 𝑥,𝑆 𝑥,𝑊 𝑥,𝑌 Allowed substitution hint: 𝐷(𝑥)

Proof of Theorem prdsdsval Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prdsbasmpt.y	. . 3 ⊢ 𝑌 = (𝑆X_s𝑅)
2		prdsbasmpt.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
3		prdsbasmpt.r	. . . 4 ⊢ (𝜑 → 𝑅 Fn 𝐼)
4		prdsbasmpt.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
5		fnex 7173	. . . 4 ⊢ ((𝑅 Fn 𝐼 ∧ 𝐼 ∈ 𝑊) → 𝑅 ∈ V)
6	3, 4, 5	syl2anc 585	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
7		prdsbasmpt.b	. . 3 ⊢ 𝐵 = (Base‘𝑌)
8		fndm 6603	. . . 4 ⊢ (𝑅 Fn 𝐼 → dom 𝑅 = 𝐼)
9	3, 8	syl 17	. . 3 ⊢ (𝜑 → dom 𝑅 = 𝐼)
10		prdsdsval.d	. . 3 ⊢ 𝐷 = (dist‘𝑌)
11	1, 2, 6, 7, 9, 10	prdsds 17396	. 2 ⊢ (𝜑 → 𝐷 = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}), ℝ^*, < )))
12		fveq1 6841	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
13		fveq1 6841	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝑔‘𝑥) = (𝐺‘𝑥))
14	12, 13	oveqan12d 7387	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥)) = ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥)))
15	14	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥)) = ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥)))
16	15	mpteq2dv 5194	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥))))
17	16	rneqd 5895	. . . 4 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) = ran (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥))))
18	17	uneq1d 4121	. . 3 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}) = (ran (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥))) ∪ {0}))
19	18	supeq1d 9361	. 2 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}), ℝ^, < ) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥))) ∪ {0}), ℝ^, < ))
20		prdsplusgval.f	. 2 ⊢ (𝜑 → 𝐹 ∈ 𝐵)
21		prdsplusgval.g	. 2 ⊢ (𝜑 → 𝐺 ∈ 𝐵)
22		xrltso 13067	. . . 4 ⊢ < Or ℝ^*
23	22	supex 9379	. . 3 ⊢ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥))) ∪ {0}), ℝ^*, < ) ∈ V
24	23	a1i 11	. 2 ⊢ (𝜑 → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥))) ∪ {0}), ℝ^*, < ) ∈ V)
25	11, 19, 20, 21, 24	ovmpod 7520	1 ⊢ (𝜑 → (𝐹𝐷𝐺) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(dist‘(𝑅‘𝑥))(𝐺‘𝑥))) ∪ {0}), ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∪ cun 3901 {csn 4582 ↦ cmpt 5181 dom cdm 5632 ran crn 5633 Fn wfn 6495 ‘cfv 6500 (class class class)co 7368 supcsup 9355 0cc0 11038 ℝ^*cxr 11177 < clt 11178 Basecbs 17148 distcds 17198 X_scprds 17377

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-er 8645 df-map 8777 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-z 12501 df-dec 12620 df-uz 12764 df-fz 13436 df-struct 17086 df-slot 17121 df-ndx 17133 df-base 17149 df-plusg 17202 df-mulr 17203 df-sca 17205 df-vsca 17206 df-ip 17207 df-tset 17208 df-ple 17209 df-ds 17211 df-hom 17213 df-cco 17214 df-prds 17379

This theorem is referenced by: prdsdsval2 17416 xpsdsval 24337

W3C validator