psrassa - Metamath Proof Explorer

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

Theorem psrassa 21964

Description: The ring of power series is an associative algebra. (Contributed by Mario Carneiro, 29-Dec-2014.)

**Hypotheses**
Ref	Expression
psrcnrg.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
psrcnrg.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
psrcnrg.r	⊢ (𝜑 → 𝑅 ∈ CRing)

**Assertion**
Ref	Expression
psrassa	⊢ (𝜑 → 𝑆 ∈ AssAlg)

Proof of Theorem psrassa Dummy variables 𝑓 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2738	. 2 ⊢ (𝜑 → (Base‘𝑆) = (Base‘𝑆))
2		psrcnrg.s	. . 3 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
3		psrcnrg.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
4		psrcnrg.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ CRing)
5	2, 3, 4	psrsca 21939	. 2 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑆))
6		eqidd 2738	. 2 ⊢ (𝜑 → (Base‘𝑅) = (Base‘𝑅))
7		eqidd 2738	. 2 ⊢ (𝜑 → ( ·_𝑠 ‘𝑆) = ( ·_𝑠 ‘𝑆))
8		eqidd 2738	. 2 ⊢ (𝜑 → (._r‘𝑆) = (._r‘𝑆))
9	4	crngringd 20221	. . 3 ⊢ (𝜑 → 𝑅 ∈ Ring)
10	2, 3, 9	psrlmod 21951	. 2 ⊢ (𝜑 → 𝑆 ∈ LMod)
11	2, 3, 9	psrring 21961	. 2 ⊢ (𝜑 → 𝑆 ∈ Ring)
12	3	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑆) ∧ 𝑧 ∈ (Base‘𝑆))) → 𝐼 ∈ 𝑉)
13	9	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑆) ∧ 𝑧 ∈ (Base‘𝑆))) → 𝑅 ∈ Ring)
14		eqid 2737	. . . 4 ⊢ {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}
15		eqid 2737	. . . 4 ⊢ (._r‘𝑆) = (._r‘𝑆)
16		eqid 2737	. . . 4 ⊢ (Base‘𝑆) = (Base‘𝑆)
17		simpr2 1197	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑆) ∧ 𝑧 ∈ (Base‘𝑆))) → 𝑦 ∈ (Base‘𝑆))
18		simpr3 1198	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑆) ∧ 𝑧 ∈ (Base‘𝑆))) → 𝑧 ∈ (Base‘𝑆))
19	4	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑆) ∧ 𝑧 ∈ (Base‘𝑆))) → 𝑅 ∈ CRing)
20		eqid 2737	. . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅)
21		eqid 2737	. . . 4 ⊢ ( ·_𝑠 ‘𝑆) = ( ·_𝑠 ‘𝑆)
22		simpr1 1196	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑆) ∧ 𝑧 ∈ (Base‘𝑆))) → 𝑥 ∈ (Base‘𝑅))
23	2, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22	psrass23 21960	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑆) ∧ 𝑧 ∈ (Base‘𝑆))) → (((𝑥( ·_𝑠 ‘𝑆)𝑦)(._r‘𝑆)𝑧) = (𝑥( ·_𝑠 ‘𝑆)(𝑦(._r‘𝑆)𝑧)) ∧ (𝑦(._r‘𝑆)(𝑥( ·_𝑠 ‘𝑆)𝑧)) = (𝑥( ·_𝑠 ‘𝑆)(𝑦(._r‘𝑆)𝑧))))
24	23	simpld 494	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑆) ∧ 𝑧 ∈ (Base‘𝑆))) → ((𝑥( ·_𝑠 ‘𝑆)𝑦)(._r‘𝑆)𝑧) = (𝑥( ·_𝑠 ‘𝑆)(𝑦(._r‘𝑆)𝑧)))
25	23	simprd 495	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑆) ∧ 𝑧 ∈ (Base‘𝑆))) → (𝑦(._r‘𝑆)(𝑥( ·_𝑠 ‘𝑆)𝑧)) = (𝑥( ·_𝑠 ‘𝑆)(𝑦(._r‘𝑆)𝑧)))
26	1, 5, 6, 7, 8, 10, 11, 24, 25	isassad 21858	1 ⊢ (𝜑 → 𝑆 ∈ AssAlg)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 {crab 3390 ^◡ccnv 5624 “ cima 5628 ‘cfv 6493 (class class class)co 7361 ↑_m cmap 8767 Fincfn 8887 ℕcn 12168 ℕ₀cn0 12431 Basecbs 17173 ._rcmulr 17215 ·_𝑠 cvsca 17218 Ringcrg 20208 CRingccrg 20209 AssAlgcasa 21843 mPwSer cmps 21897

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 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109

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 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-of 7625 df-ofr 7626 df-om 7812 df-1st 7936 df-2nd 7937 df-supp 8105 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-er 8637 df-map 8769 df-pm 8770 df-ixp 8840 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fsupp 9269 df-sup 9349 df-oi 9419 df-card 9857 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-9 12245 df-n0 12432 df-z 12519 df-dec 12639 df-uz 12783 df-fz 13456 df-fzo 13603 df-seq 13958 df-hash 14287 df-struct 17111 df-sets 17128 df-slot 17146 df-ndx 17158 df-base 17174 df-ress 17195 df-plusg 17227 df-mulr 17228 df-sca 17230 df-vsca 17231 df-ip 17232 df-tset 17233 df-ple 17234 df-ds 17236 df-hom 17238 df-cco 17239 df-0g 17398 df-gsum 17399 df-prds 17404 df-pws 17406 df-mre 17542 df-mrc 17543 df-acs 17545 df-mgm 18602 df-sgrp 18681 df-mnd 18697 df-mhm 18745 df-submnd 18746 df-grp 18906 df-minusg 18907 df-mulg 19038 df-ghm 19182 df-cntz 19286 df-cmn 19751 df-abl 19752 df-mgp 20116 df-rng 20128 df-ur 20157 df-ring 20210 df-cring 20211 df-lmod 20851 df-assa 21846 df-psr 21902

This theorem is referenced by: mplassa 22013 mplbas2 22033 opsrassa 22051 mplind 22061 evlseu 22074

W3C validator