| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prdscrngd | Structured version Visualization version GIF version | ||
| Description: A product of commutative rings is a commutative ring. Since the resulting ring will have zero divisors in all nontrivial cases, this cannot be strengthened much further. (Contributed by Mario Carneiro, 11-Mar-2015.) |
| Ref | Expression |
|---|---|
| prdscrngd.y | ⊢ 𝑌 = (𝑆Xs𝑅) |
| prdscrngd.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| prdscrngd.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
| prdscrngd.r | ⊢ (𝜑 → 𝑅:𝐼⟶CRing) |
| Ref | Expression |
|---|---|
| prdscrngd | ⊢ (𝜑 → 𝑌 ∈ CRing) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prdscrngd.y | . . 3 ⊢ 𝑌 = (𝑆Xs𝑅) | |
| 2 | prdscrngd.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 3 | prdscrngd.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 4 | prdscrngd.r | . . . 4 ⊢ (𝜑 → 𝑅:𝐼⟶CRing) | |
| 5 | crngring 20180 | . . . . 5 ⊢ (𝑥 ∈ CRing → 𝑥 ∈ Ring) | |
| 6 | 5 | ssriv 3937 | . . . 4 ⊢ CRing ⊆ Ring |
| 7 | fss 6678 | . . . 4 ⊢ ((𝑅:𝐼⟶CRing ∧ CRing ⊆ Ring) → 𝑅:𝐼⟶Ring) | |
| 8 | 4, 6, 7 | sylancl 586 | . . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Ring) |
| 9 | 1, 2, 3, 8 | prdsringd 20256 | . 2 ⊢ (𝜑 → 𝑌 ∈ Ring) |
| 10 | eqid 2736 | . . . 4 ⊢ (𝑆Xs(mulGrp ∘ 𝑅)) = (𝑆Xs(mulGrp ∘ 𝑅)) | |
| 11 | fnmgp 20077 | . . . . . . 7 ⊢ mulGrp Fn V | |
| 12 | ssv 3958 | . . . . . . 7 ⊢ CRing ⊆ V | |
| 13 | fnssres 6615 | . . . . . . 7 ⊢ ((mulGrp Fn V ∧ CRing ⊆ V) → (mulGrp ↾ CRing) Fn CRing) | |
| 14 | 11, 12, 13 | mp2an 692 | . . . . . 6 ⊢ (mulGrp ↾ CRing) Fn CRing |
| 15 | fvres 6853 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) = (mulGrp‘𝑥)) | |
| 16 | eqid 2736 | . . . . . . . . 9 ⊢ (mulGrp‘𝑥) = (mulGrp‘𝑥) | |
| 17 | 16 | crngmgp 20176 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → (mulGrp‘𝑥) ∈ CMnd) |
| 18 | 15, 17 | eqeltrd 2836 | . . . . . . 7 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd) |
| 19 | 18 | rgen 3053 | . . . . . 6 ⊢ ∀𝑥 ∈ CRing ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd |
| 20 | ffnfv 7064 | . . . . . 6 ⊢ ((mulGrp ↾ CRing):CRing⟶CMnd ↔ ((mulGrp ↾ CRing) Fn CRing ∧ ∀𝑥 ∈ CRing ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd)) | |
| 21 | 14, 19, 20 | mpbir2an 711 | . . . . 5 ⊢ (mulGrp ↾ CRing):CRing⟶CMnd |
| 22 | fco2 6688 | . . . . 5 ⊢ (((mulGrp ↾ CRing):CRing⟶CMnd ∧ 𝑅:𝐼⟶CRing) → (mulGrp ∘ 𝑅):𝐼⟶CMnd) | |
| 23 | 21, 4, 22 | sylancr 587 | . . . 4 ⊢ (𝜑 → (mulGrp ∘ 𝑅):𝐼⟶CMnd) |
| 24 | 10, 2, 3, 23 | prdscmnd 19790 | . . 3 ⊢ (𝜑 → (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd) |
| 25 | eqidd 2737 | . . . 4 ⊢ (𝜑 → (Base‘(mulGrp‘𝑌)) = (Base‘(mulGrp‘𝑌))) | |
| 26 | eqid 2736 | . . . . . 6 ⊢ (mulGrp‘𝑌) = (mulGrp‘𝑌) | |
| 27 | 4 | ffnd 6663 | . . . . . 6 ⊢ (𝜑 → 𝑅 Fn 𝐼) |
| 28 | 1, 26, 10, 2, 3, 27 | prdsmgp 20086 | . . . . 5 ⊢ (𝜑 → ((Base‘(mulGrp‘𝑌)) = (Base‘(𝑆Xs(mulGrp ∘ 𝑅))) ∧ (+g‘(mulGrp‘𝑌)) = (+g‘(𝑆Xs(mulGrp ∘ 𝑅))))) |
| 29 | 28 | simpld 494 | . . . 4 ⊢ (𝜑 → (Base‘(mulGrp‘𝑌)) = (Base‘(𝑆Xs(mulGrp ∘ 𝑅)))) |
| 30 | 28 | simprd 495 | . . . . 5 ⊢ (𝜑 → (+g‘(mulGrp‘𝑌)) = (+g‘(𝑆Xs(mulGrp ∘ 𝑅)))) |
| 31 | 30 | oveqdr 7386 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(mulGrp‘𝑌)) ∧ 𝑦 ∈ (Base‘(mulGrp‘𝑌)))) → (𝑥(+g‘(mulGrp‘𝑌))𝑦) = (𝑥(+g‘(𝑆Xs(mulGrp ∘ 𝑅)))𝑦)) |
| 32 | 25, 29, 31 | cmnpropd 19720 | . . 3 ⊢ (𝜑 → ((mulGrp‘𝑌) ∈ CMnd ↔ (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd)) |
| 33 | 24, 32 | mpbird 257 | . 2 ⊢ (𝜑 → (mulGrp‘𝑌) ∈ CMnd) |
| 34 | 26 | iscrng 20175 | . 2 ⊢ (𝑌 ∈ CRing ↔ (𝑌 ∈ Ring ∧ (mulGrp‘𝑌) ∈ CMnd)) |
| 35 | 9, 33, 34 | sylanbrc 583 | 1 ⊢ (𝜑 → 𝑌 ∈ CRing) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 Vcvv 3440 ⊆ wss 3901 ↾ cres 5626 ∘ ccom 5628 Fn wfn 6487 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +gcplusg 17177 Xscprds 17365 CMndccmn 19709 mulGrpcmgp 20075 Ringcrg 20168 CRingccrg 20169 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8765 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-7 12213 df-8 12214 df-9 12215 df-n0 12402 df-z 12489 df-dec 12608 df-uz 12752 df-fz 13424 df-struct 17074 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-mulr 17191 df-sca 17193 df-vsca 17194 df-ip 17195 df-tset 17196 df-ple 17197 df-ds 17199 df-hom 17201 df-cco 17202 df-0g 17361 df-prds 17367 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-cring 20171 |
| This theorem is referenced by: pwscrng 20261 |
| Copyright terms: Public domain | W3C validator |