psrmulvalfi - Intuitionistic Logic Explorer

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

Theorem psrmulvalfi 15128

Description: The multiplication operation of the multivariate power series structure. (Contributed by Mario Carneiro, 28-Dec-2014.)

**Hypotheses**
Ref	Expression
psrmulr.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
psrmulr.b	⊢ 𝐵 = (Base‘𝑆)
psrmulr.m	⊢ · = (._r‘𝑅)
psrmulr.t	⊢ ∙ = (._r‘𝑆)
psrmulr.d	⊢ 𝐷 = {ℎ ∈ (ℕ₀ ↑_𝑚 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}
psrmulfval.i	⊢ (𝜑 → 𝐹 ∈ 𝐵)
psrmulfval.r	⊢ (𝜑 → 𝐺 ∈ 𝐵)
psrmulval.r	⊢ (𝜑 → 𝑋 ∈ 𝐷)
psrmulvalfi.fi	⊢ (𝜑 → 𝐼 ∈ Fin)
psrmulvalfi.ring	⊢ (𝜑 → 𝑅 ∈ Ring)

**Assertion**
Ref	Expression
psrmulvalfi	⊢ (𝜑 → ((𝐹 ∙ 𝐺)‘𝑋) = (𝑅 Σ_g (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘_𝑓 − 𝑘))))))

Distinct variable groups: · ,𝑘 𝐵,𝑘 𝐷,𝑘,𝑦 𝑘,𝐹 𝑘,𝐺 ℎ,𝐼,𝑘,𝑦 𝑅,𝑘 𝑘,𝑋,𝑦 𝜑,𝑘 ℎ,𝑋 Allowed substitution hints: 𝜑(𝑦, ℎ) 𝐵(𝑦, ℎ) 𝐷(ℎ) 𝑅(𝑦, ℎ) 𝑆(𝑦, ℎ, 𝑘) ∙ (𝑦, ℎ, 𝑘) · (𝑦, ℎ) 𝐹(𝑦, ℎ) 𝐺(𝑦, ℎ)

Proof of Theorem psrmulvalfi Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq2 4134	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝑦 ∘_𝑟 ≤ 𝑥 ↔ 𝑦 ∘_𝑟 ≤ 𝑋))
2	1	rabbidv 2810	. . . 4 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑥} = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋})
3		fvoveq1 6108	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝐺‘(𝑥 ∘_𝑓 − 𝑘)) = (𝐺‘(𝑋 ∘_𝑓 − 𝑘)))
4	3	oveq2d 6101	. . . 4 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘_𝑓 − 𝑘))) = ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘_𝑓 − 𝑘))))
5	2, 4	mpteq12dv 4213	. . 3 ⊢ (𝑥 = 𝑋 → (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘_𝑓 − 𝑘)))) = (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘_𝑓 − 𝑘)))))
6	5	oveq2d 6101	. 2 ⊢ (𝑥 = 𝑋 → (𝑅 Σ_g (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘_𝑓 − 𝑘))))) = (𝑅 Σ_g (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘_𝑓 − 𝑘))))))
7		psrmulr.s	. . 3 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
8		psrmulr.b	. . 3 ⊢ 𝐵 = (Base‘𝑆)
9		psrmulr.m	. . 3 ⊢ · = (._r‘𝑅)
10		psrmulr.t	. . 3 ⊢ ∙ = (._r‘𝑆)
11		psrmulr.d	. . 3 ⊢ 𝐷 = {ℎ ∈ (ℕ₀ ↑_𝑚 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}
12		psrmulfval.i	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵)
13		psrmulfval.r	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐵)
14	7, 8, 9, 10, 11, 12, 13	psrmulfval 15127	. 2 ⊢ (𝜑 → (𝐹 ∙ 𝐺) = (𝑥 ∈ 𝐷 ↦ (𝑅 Σ_g (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘_𝑓 − 𝑘)))))))
15		psrmulval.r	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝐷)
16		eqid 2238	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
17		eqid 2238	. . 3 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
18		psrmulvalfi.ring	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Ring)
19	18	ringcmnd 14392	. . 3 ⊢ (𝜑 → 𝑅 ∈ CMnd)
20		psrmulvalfi.fi	. . . 4 ⊢ (𝜑 → 𝐼 ∈ Fin)
21	11	psrbaglefifi 15115	. . . 4 ⊢ ((𝑋 ∈ 𝐷 ∧ 𝐼 ∈ Fin) → {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} ∈ Fin)
22	15, 20, 21	syl2anc 415	. . 3 ⊢ (𝜑 → {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} ∈ Fin)
23	18	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → 𝑅 ∈ Ring)
24	7, 16, 20, 8, 12	psrelbasfi 15120	. . . . . . 7 ⊢ (𝜑 → 𝐹:(ℕ₀ ↑_𝑚 𝐼)⟶(Base‘𝑅))
25	24	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → 𝐹:(ℕ₀ ↑_𝑚 𝐼)⟶(Base‘𝑅))
26		elrabi 2979	. . . . . . . 8 ⊢ (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} → 𝑘 ∈ 𝐷)
27	26	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → 𝑘 ∈ 𝐷)
28	11	psrbagfi 15111	. . . . . . . . 9 ⊢ (𝐼 ∈ Fin → 𝐷 = (ℕ₀ ↑_𝑚 𝐼))
29	20, 28	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝐷 = (ℕ₀ ↑_𝑚 𝐼))
30	29	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → 𝐷 = (ℕ₀ ↑_𝑚 𝐼))
31	27, 30	eleqtrd 2317	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → 𝑘 ∈ (ℕ₀ ↑_𝑚 𝐼))
32	25, 31	ffvelcdmd 5844	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → (𝐹‘𝑘) ∈ (Base‘𝑅))
33	7, 16, 20, 8, 13	psrelbasfi 15120	. . . . . . 7 ⊢ (𝜑 → 𝐺:(ℕ₀ ↑_𝑚 𝐼)⟶(Base‘𝑅))
34	33	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → 𝐺:(ℕ₀ ↑_𝑚 𝐼)⟶(Base‘𝑅))
35		eqid 2238	. . . . . . . . . 10 ⊢ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}
36	11, 35	psrbagconcl 15116	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐷 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → (𝑋 ∘_𝑓 − 𝑘) ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋})
37	15, 36	sylan 283	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → (𝑋 ∘_𝑓 − 𝑘) ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋})
38		elrabi 2979	. . . . . . . 8 ⊢ ((𝑋 ∘_𝑓 − 𝑘) ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} → (𝑋 ∘_𝑓 − 𝑘) ∈ 𝐷)
39	37, 38	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → (𝑋 ∘_𝑓 − 𝑘) ∈ 𝐷)
40	39, 30	eleqtrd 2317	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → (𝑋 ∘_𝑓 − 𝑘) ∈ (ℕ₀ ↑_𝑚 𝐼))
41	34, 40	ffvelcdmd 5844	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → (𝐺‘(𝑋 ∘_𝑓 − 𝑘)) ∈ (Base‘𝑅))
42	16, 9, 23, 32, 41	ringcld 14374	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}) → ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘_𝑓 − 𝑘))) ∈ (Base‘𝑅))
43	42	fmpttd 5863	. . 3 ⊢ (𝜑 → (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘_𝑓 − 𝑘)))):{𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋}⟶(Base‘𝑅))
44	16, 17, 19, 22, 43	gsumclfi 14211	. 2 ⊢ (𝜑 → (𝑅 Σ_g (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘_𝑓 − 𝑘))))) ∈ (Base‘𝑅))
45	6, 14, 15, 44	fvmptd4 5800	1 ⊢ (𝜑 → ((𝐹 ∙ 𝐺)‘𝑋) = (𝑅 Σ_g (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘_𝑟 ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘_𝑓 − 𝑘))))))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 {crab 2532 class class class wbr 4130 ↦ cmpt 4192 ^◡ccnv 4773 “ cima 4777 ⟶wf 5373 ‘cfv 5377 (class class class)co 6085 ∘_𝑓 cof 6300 ∘_𝑟 cofr 6301 ↑_𝑚 cmap 6922 Fincfn 7022 ≤ cle 8362 − cmin 8499 ℕcn 9307 ℕ₀cn0 9568 Basecbs 13404 ._rcmulr 13484 0_gc0g 13662 Σ_g cgsu 14202 Ringcrg 14352 mPwSer cmps 15097

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 ax-arch 8299 ax-caucvg 8300

This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-tp 3717 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-of 6302 df-ofr 6303 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-frec 6662 df-1o 6687 df-oadd 6691 df-er 6807 df-map 6924 df-ixp 6981 df-en 7023 df-dom 7024 df-fin 7025 df-sup 7325 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-5 9369 df-6 9370 df-7 9371 df-8 9372 df-9 9373 df-n0 9569 df-z 9650 df-uz 9932 df-rp 10066 df-fz 10423 df-fzo 10561 df-seqfrec 10900 df-exp 10991 df-ihash 11231 df-cj 11623 df-re 11624 df-im 11625 df-rsqrt 11780 df-abs 11781 df-struct 13406 df-ndx 13407 df-slot 13408 df-base 13410 df-sets 13411 df-plusg 13496 df-mulr 13497 df-sca 13499 df-vsca 13500 df-tset 13502 df-rest 13647 df-topn 13648 df-0g 13664 df-gzsum 13665 df-topgen 13666 df-pt 13667 df-mgm 13728 df-sgrp 13769 df-mnd 13782 df-grp 13860 df-minusg 13861 df-mulg 13975 df-cmn 14141 df-abl 14142 df-gsumfi 14203 df-mgp 14270 df-ur 14315 df-ring 14354 df-psr 15099

This theorem is used by: (None)

W3C validator