imasdsval2 - Metamath Proof Explorer

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

Theorem imasdsval2 16781

Description: The distance function of an image structure. (Contributed by Mario Carneiro, 20-Aug-2015.) (Revised by AV, 6-Oct-2020.)

**Hypotheses**
Ref	Expression
imasbas.u	⊢ (𝜑 → 𝑈 = (𝐹 “_s 𝑅))
imasbas.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
imasbas.f	⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
imasbas.r	⊢ (𝜑 → 𝑅 ∈ 𝑍)
imasds.e	⊢ 𝐸 = (dist‘𝑅)
imasds.d	⊢ 𝐷 = (dist‘𝑈)
imasdsval.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
imasdsval.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
imasdsval.s	⊢ 𝑆 = {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑋 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑌 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))}
imasds.u	⊢ 𝑇 = (𝐸 ↾ (𝑉 × 𝑉))

**Assertion**
Ref	Expression
imasdsval2	⊢ (𝜑 → (𝑋𝐷𝑌) = inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝑇 ∘ 𝑔))), ℝ^, < ))

Distinct variable groups: 𝑔,ℎ,𝑖,𝑛,𝐹 𝑅,𝑔,ℎ,𝑖,𝑛 𝜑,𝑔,ℎ,𝑖,𝑛 ℎ,𝑋,𝑛 𝑆,𝑔 𝑔,𝑉,ℎ ℎ,𝑌,𝑛 Allowed substitution hints: 𝐵(𝑔,ℎ,𝑖,𝑛) 𝐷(𝑔,ℎ,𝑖,𝑛) 𝑆(ℎ,𝑖,𝑛) 𝑇(𝑔,ℎ,𝑖,𝑛) 𝑈(𝑔,ℎ,𝑖,𝑛) 𝐸(𝑔,ℎ,𝑖,𝑛) 𝑉(𝑖,𝑛) 𝑋(𝑔,𝑖) 𝑌(𝑔,𝑖) 𝑍(𝑔,ℎ,𝑖,𝑛)

**Proof of Theorem imasdsval2**
Step	Hyp	Ref	Expression
1		imasbas.u	. . 3 ⊢ (𝜑 → 𝑈 = (𝐹 “_s 𝑅))
2		imasbas.v	. . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
3		imasbas.f	. . 3 ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
4		imasbas.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑍)
5		imasds.e	. . 3 ⊢ 𝐸 = (dist‘𝑅)
6		imasds.d	. . 3 ⊢ 𝐷 = (dist‘𝑈)
7		imasdsval.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
8		imasdsval.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
9		imasdsval.s	. . 3 ⊢ 𝑆 = {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑋 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑌 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))}
10	1, 2, 3, 4, 5, 6, 7, 8, 9	imasdsval 16780	. 2 ⊢ (𝜑 → (𝑋𝐷𝑌) = inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))), ℝ^, < ))
11		imasds.u	. . . . . . . . . 10 ⊢ 𝑇 = (𝐸 ↾ (𝑉 × 𝑉))
12	11	coeq1i 5694	. . . . . . . . 9 ⊢ (𝑇 ∘ 𝑔) = ((𝐸 ↾ (𝑉 × 𝑉)) ∘ 𝑔)
13	9	ssrab3 4008	. . . . . . . . . . 11 ⊢ 𝑆 ⊆ ((𝑉 × 𝑉) ↑_m (1...𝑛))
14	13	sseli 3911	. . . . . . . . . 10 ⊢ (𝑔 ∈ 𝑆 → 𝑔 ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)))
15		elmapi 8411	. . . . . . . . . 10 ⊢ (𝑔 ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) → 𝑔:(1...𝑛)⟶(𝑉 × 𝑉))
16		frn 6493	. . . . . . . . . 10 ⊢ (𝑔:(1...𝑛)⟶(𝑉 × 𝑉) → ran 𝑔 ⊆ (𝑉 × 𝑉))
17		cores 6069	. . . . . . . . . 10 ⊢ (ran 𝑔 ⊆ (𝑉 × 𝑉) → ((𝐸 ↾ (𝑉 × 𝑉)) ∘ 𝑔) = (𝐸 ∘ 𝑔))
18	14, 15, 16, 17	4syl 19	. . . . . . . . 9 ⊢ (𝑔 ∈ 𝑆 → ((𝐸 ↾ (𝑉 × 𝑉)) ∘ 𝑔) = (𝐸 ∘ 𝑔))
19	12, 18	syl5eq 2845	. . . . . . . 8 ⊢ (𝑔 ∈ 𝑆 → (𝑇 ∘ 𝑔) = (𝐸 ∘ 𝑔))
20	19	oveq2d 7151	. . . . . . 7 ⊢ (𝑔 ∈ 𝑆 → (ℝ^_𝑠 Σ_g (𝑇 ∘ 𝑔)) = (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔)))
21	20	mpteq2ia 5121	. . . . . 6 ⊢ (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝑇 ∘ 𝑔))) = (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔)))
22	21	rneqi 5771	. . . . 5 ⊢ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝑇 ∘ 𝑔))) = ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔)))
23	22	a1i 11	. . . 4 ⊢ (𝑛 ∈ ℕ → ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝑇 ∘ 𝑔))) = ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))))
24	23	iuneq2i 4902	. . 3 ⊢ ∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝑇 ∘ 𝑔))) = ∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔)))
25	24	infeq1i 8926	. 2 ⊢ inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝑇 ∘ 𝑔))), ℝ^, < ) = inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))), ℝ^, < )
26	10, 25	eqtr4di 2851	1 ⊢ (𝜑 → (𝑋𝐷𝑌) = inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝑇 ∘ 𝑔))), ℝ^, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ∀wral 3106 {crab 3110 ⊆ wss 3881 ∪ ciun 4881 ↦ cmpt 5110 × cxp 5517 ran crn 5520 ↾ cres 5521 ∘ ccom 5523 ⟶wf 6320 –onto→wfo 6322 ‘cfv 6324 (class class class)co 7135 1^st c1st 7669 2^nd c2nd 7670 ↑_m cmap 8389 infcinf 8889 1c1 10527 + caddc 10529 ℝ^*cxr 10663 < clt 10664 − cmin 10859 ℕcn 11625 ...cfz 12885 Basecbs 16475 distcds 16566 Σ_g cgsu 16706 ℝ^*_𝑠cxrs 16765 “_s cimas 16769

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-fz 12886 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-plusg 16570 df-mulr 16571 df-sca 16573 df-vsca 16574 df-ip 16575 df-tset 16576 df-ple 16577 df-ds 16579 df-imas 16773

This theorem is referenced by: imasdsf1olem 22980

W3C validator