imasdsval - Metamath Proof Explorer

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

Theorem imasdsval 17601

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)))))}

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

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

Proof of Theorem imasdsval Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

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	1, 2, 3, 4, 5, 6	imasds 17599	. 2 ⊢ (𝜑 → 𝐷 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑥 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑦 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))} ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))), ℝ^, < )))
8		simplrl 789	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) ∧ 𝑛 ∈ ℕ) → 𝑥 = 𝑋)
9	8	eqeq2d 2771	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) ∧ 𝑛 ∈ ℕ) → ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑥 ↔ (𝐹‘(1^st ‘(ℎ‘1))) = 𝑋))
10		simplrr 790	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) ∧ 𝑛 ∈ ℕ) → 𝑦 = 𝑌)
11	10	eqeq2d 2771	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) ∧ 𝑛 ∈ ℕ) → ((𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑦 ↔ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑌))
12	9, 11	3anbi12d 1465	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) ∧ 𝑛 ∈ ℕ) → (((𝐹‘(1^st ‘(ℎ‘1))) = 𝑥 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑦 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1))))) ↔ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑋 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑌 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))))
13	12	rabbidv 3419	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) ∧ 𝑛 ∈ ℕ) → {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑥 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑦 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))} = {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑋 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑌 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))})
14		imasdsval.s	. . . . . . 7 ⊢ 𝑆 = {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑋 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑌 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))}
15	13, 14	eqtr4di 2813	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) ∧ 𝑛 ∈ ℕ) → {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑥 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑦 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))} = 𝑆)
16	15	mpteq1d 5195	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) ∧ 𝑛 ∈ ℕ) → (𝑔 ∈ {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑥 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑦 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))} ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))) = (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))))
17	16	rneqd 5922	. . . 4 ⊢ (((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) ∧ 𝑛 ∈ ℕ) → ran (𝑔 ∈ {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑥 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑦 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))} ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))) = ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))))
18	17	iuneq2dv 4976	. . 3 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ∪ 𝑛 ∈ ℕ ran (𝑔 ∈ {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑥 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑦 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))} ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))) = ∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))))
19	18	infeq1d 9448	. 2 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ {ℎ ∈ ((𝑉 × 𝑉) ↑_m (1...𝑛)) ∣ ((𝐹‘(1^st ‘(ℎ‘1))) = 𝑥 ∧ (𝐹‘(2^nd ‘(ℎ‘𝑛))) = 𝑦 ∧ ∀𝑖 ∈ (1...(𝑛 − 1))(𝐹‘(2^nd ‘(ℎ‘𝑖))) = (𝐹‘(1^st ‘(ℎ‘(𝑖 + 1)))))} ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))), ℝ^, < ) = inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))), ℝ^, < ))
20		imasdsval.x	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
21		imasdsval.y	. 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
22		xrltso 13192	. . . 4 ⊢ < Or ℝ^*
23	22	infex 9465	. . 3 ⊢ inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))), ℝ^, < ) ∈ V
24	23	a1i 11	. 2 ⊢ (𝜑 → inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))), ℝ^, < ) ∈ V)
25	7, 19, 20, 21, 24	ovmpod 7565	1 ⊢ (𝜑 → (𝑋𝐷𝑌) = inf(∪ 𝑛 ∈ ℕ ran (𝑔 ∈ 𝑆 ↦ (ℝ^_𝑠 Σ_g (𝐸 ∘ 𝑔))), ℝ^, < ))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∀wral 3076 {crab 3412 Vcvv 3450 ∪ ciun 4951 ↦ cmpt 5186 × cxp 5653 ran crn 5656 ∘ ccom 5659 –onto→wfo 6531 ‘cfv 6533 (class class class)co 7413 1^st c1st 7984 2^nd c2nd 7985 ↑_m cmap 8826 infcinf 9411 1c1 11125 + caddc 11127 ℝ^*cxr 11266 < clt 11267 − cmin 11465 ℕcn 12257 ...cfz 13561 Basecbs 17301 distcds 17351 Σ_g cgsu 17525 ℝ^*_𝑠cxrs 17586 “_s cimas 17590

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-inf 9413 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12529 df-z 12616 df-dec 12737 df-uz 12888 df-fz 13562 df-struct 17239 df-slot 17274 df-ndx 17286 df-base 17302 df-plusg 17355 df-mulr 17356 df-sca 17358 df-vsca 17359 df-ip 17360 df-tset 17361 df-ple 17362 df-ds 17364 df-imas 17594

This theorem is used by: imasdsval2 17602

W3C validator