| 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 20217 | . . . . 5 ⊢ (𝑥 ∈ CRing → 𝑥 ∈ Ring) | |
| 6 | 5 | ssriv 3926 | . . . 4 ⊢ CRing ⊆ Ring |
| 7 | fss 6678 | . . . 4 ⊢ ((𝑅:𝐼⟶CRing ∧ CRing ⊆ Ring) → 𝑅:𝐼⟶Ring) | |
| 8 | 4, 6, 7 | sylancl 587 | . . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Ring) |
| 9 | 1, 2, 3, 8 | prdsringd 20291 | . 2 ⊢ (𝜑 → 𝑌 ∈ Ring) |
| 10 | eqid 2737 | . . . 4 ⊢ (𝑆Xs(mulGrp ∘ 𝑅)) = (𝑆Xs(mulGrp ∘ 𝑅)) | |
| 11 | fnmgp 20114 | . . . . . . 7 ⊢ mulGrp Fn V | |
| 12 | ssv 3947 | . . . . . . 7 ⊢ CRing ⊆ V | |
| 13 | fnssres 6615 | . . . . . . 7 ⊢ ((mulGrp Fn V ∧ CRing ⊆ V) → (mulGrp ↾ CRing) Fn CRing) | |
| 14 | 11, 12, 13 | mp2an 693 | . . . . . 6 ⊢ (mulGrp ↾ CRing) Fn CRing |
| 15 | fvres 6853 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) = (mulGrp‘𝑥)) | |
| 16 | eqid 2737 | . . . . . . . . 9 ⊢ (mulGrp‘𝑥) = (mulGrp‘𝑥) | |
| 17 | 16 | crngmgp 20213 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → (mulGrp‘𝑥) ∈ CMnd) |
| 18 | 15, 17 | eqeltrd 2837 | . . . . . . 7 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd) |
| 19 | 18 | rgen 3054 | . . . . . 6 ⊢ ∀𝑥 ∈ CRing ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd |
| 20 | ffnfv 7065 | . . . . . 6 ⊢ ((mulGrp ↾ CRing):CRing⟶CMnd ↔ ((mulGrp ↾ CRing) Fn CRing ∧ ∀𝑥 ∈ CRing ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd)) | |
| 21 | 14, 19, 20 | mpbir2an 712 | . . . . 5 ⊢ (mulGrp ↾ CRing):CRing⟶CMnd |
| 22 | fco2 6688 | . . . . 5 ⊢ (((mulGrp ↾ CRing):CRing⟶CMnd ∧ 𝑅:𝐼⟶CRing) → (mulGrp ∘ 𝑅):𝐼⟶CMnd) | |
| 23 | 21, 4, 22 | sylancr 588 | . . . 4 ⊢ (𝜑 → (mulGrp ∘ 𝑅):𝐼⟶CMnd) |
| 24 | 10, 2, 3, 23 | prdscmnd 19827 | . . 3 ⊢ (𝜑 → (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd) |
| 25 | eqidd 2738 | . . . 4 ⊢ (𝜑 → (Base‘(mulGrp‘𝑌)) = (Base‘(mulGrp‘𝑌))) | |
| 26 | eqid 2737 | . . . . . 6 ⊢ (mulGrp‘𝑌) = (mulGrp‘𝑌) | |
| 27 | 4 | ffnd 6663 | . . . . . 6 ⊢ (𝜑 → 𝑅 Fn 𝐼) |
| 28 | 1, 26, 10, 2, 3, 27 | prdsmgp 20123 | . . . . 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 7388 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(mulGrp‘𝑌)) ∧ 𝑦 ∈ (Base‘(mulGrp‘𝑌)))) → (𝑥(+g‘(mulGrp‘𝑌))𝑦) = (𝑥(+g‘(𝑆Xs(mulGrp ∘ 𝑅)))𝑦)) |
| 32 | 25, 29, 31 | cmnpropd 19757 | . . 3 ⊢ (𝜑 → ((mulGrp‘𝑌) ∈ CMnd ↔ (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd)) |
| 33 | 24, 32 | mpbird 257 | . 2 ⊢ (𝜑 → (mulGrp‘𝑌) ∈ CMnd) |
| 34 | 26 | iscrng 20212 | . 2 ⊢ (𝑌 ∈ CRing ↔ (𝑌 ∈ Ring ∧ (mulGrp‘𝑌) ∈ CMnd)) |
| 35 | 9, 33, 34 | sylanbrc 584 | 1 ⊢ (𝜑 → 𝑌 ∈ CRing) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 Vcvv 3430 ⊆ wss 3890 ↾ cres 5626 ∘ ccom 5628 Fn wfn 6487 ⟶wf 6488 ‘cfv 6492 (class class class)co 7360 Basecbs 17170 +gcplusg 17211 Xscprds 17399 CMndccmn 19746 mulGrpcmgp 20112 Ringcrg 20205 CRingccrg 20206 |
| 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 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| 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-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 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 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-er 8636 df-map 8768 df-ixp 8839 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-sup 9348 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-dec 12636 df-uz 12780 df-fz 13453 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-plusg 17224 df-mulr 17225 df-sca 17227 df-vsca 17228 df-ip 17229 df-tset 17230 df-ple 17231 df-ds 17233 df-hom 17235 df-cco 17236 df-0g 17395 df-prds 17401 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18903 df-minusg 18904 df-cmn 19748 df-abl 19749 df-mgp 20113 df-rng 20125 df-ur 20154 df-ring 20207 df-cring 20208 |
| This theorem is referenced by: pwscrng 20296 |
| Copyright terms: Public domain | W3C validator |