| 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 20384 | . . . . 5 ⊢ (𝑥 ∈ CRing → 𝑥 ∈ Ring) | |
| 6 | 5 | ssriv 3935 | . . . 4 ⊢ CRing ⊆ Ring |
| 7 | fss 6719 | . . . 4 ⊢ ((𝑅:𝐼⟶CRing ∧ CRing ⊆ Ring) → 𝑅:𝐼⟶Ring) | |
| 8 | 4, 6, 7 | sylancl 598 | . . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Ring) |
| 9 | 1, 2, 3, 8 | prdsringd 20461 | . 2 ⊢ (𝜑 → 𝑌 ∈ Ring) |
| 10 | eqid 2760 | . . . 4 ⊢ (𝑆Xs(mulGrp ∘ 𝑅)) = (𝑆Xs(mulGrp ∘ 𝑅)) | |
| 11 | fnmgp 20275 | . . . . . . 7 ⊢ mulGrp Fn V | |
| 12 | ssv 3955 | . . . . . . 7 ⊢ CRing ⊆ V | |
| 13 | fnssres 6655 | . . . . . . 7 ⊢ ((mulGrp Fn V ∧ CRing ⊆ V) → (mulGrp ↾ CRing) Fn CRing) | |
| 14 | 11, 12, 13 | mp2an 705 | . . . . . 6 ⊢ (mulGrp ↾ CRing) Fn CRing |
| 15 | fvres 6897 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) = (mulGrp‘𝑥)) | |
| 16 | eqid 2760 | . . . . . . . . 9 ⊢ (mulGrp‘𝑥) = (mulGrp‘𝑥) | |
| 17 | 16 | crngmgp 20380 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → (mulGrp‘𝑥) ∈ CMnd) |
| 18 | 15, 17 | eqeltrd 2860 | . . . . . . 7 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd) |
| 19 | 18 | rgen 3078 | . . . . . 6 ⊢ ∀𝑥 ∈ CRing ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd |
| 20 | ffnfv 7112 | . . . . . 6 ⊢ ((mulGrp ↾ CRing):CRing⟶CMnd ↔ ((mulGrp ↾ CRing) Fn CRing ∧ ∀𝑥 ∈ CRing ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd)) | |
| 21 | 14, 19, 20 | mpbir2an 724 | . . . . 5 ⊢ (mulGrp ↾ CRing):CRing⟶CMnd |
| 22 | fco2 6729 | . . . . 5 ⊢ (((mulGrp ↾ CRing):CRing⟶CMnd ∧ 𝑅:𝐼⟶CRing) → (mulGrp ∘ 𝑅):𝐼⟶CMnd) | |
| 23 | 21, 4, 22 | sylancr 599 | . . . 4 ⊢ (𝜑 → (mulGrp ∘ 𝑅):𝐼⟶CMnd) |
| 24 | 10, 2, 3, 23 | prdscmnd 19988 | . . 3 ⊢ (𝜑 → (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd) |
| 25 | eqidd 2761 | . . . 4 ⊢ (𝜑 → (Base‘(mulGrp‘𝑌)) = (Base‘(mulGrp‘𝑌))) | |
| 26 | eqid 2760 | . . . . . 6 ⊢ (mulGrp‘𝑌) = (mulGrp‘𝑌) | |
| 27 | 4 | ffnd 6703 | . . . . . 6 ⊢ (𝜑 → 𝑅 Fn 𝐼) |
| 28 | 1, 26, 10, 2, 3, 27 | prdsmgp 20284 | . . . . 5 ⊢ (𝜑 → ((Base‘(mulGrp‘𝑌)) = (Base‘(𝑆Xs(mulGrp ∘ 𝑅))) ∧ (+g‘(mulGrp‘𝑌)) = (+g‘(𝑆Xs(mulGrp ∘ 𝑅))))) |
| 29 | 28 | simpld 500 | . . . 4 ⊢ (𝜑 → (Base‘(mulGrp‘𝑌)) = (Base‘(𝑆Xs(mulGrp ∘ 𝑅)))) |
| 30 | 28 | simprd 501 | . . . . 5 ⊢ (𝜑 → (+g‘(mulGrp‘𝑌)) = (+g‘(𝑆Xs(mulGrp ∘ 𝑅)))) |
| 31 | 30 | oveqdr 7441 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(mulGrp‘𝑌)) ∧ 𝑦 ∈ (Base‘(mulGrp‘𝑌)))) → (𝑥(+g‘(mulGrp‘𝑌))𝑦) = (𝑥(+g‘(𝑆Xs(mulGrp ∘ 𝑅)))𝑦)) |
| 32 | 25, 29, 31 | cmnpropd 19918 | . . 3 ⊢ (𝜑 → ((mulGrp‘𝑌) ∈ CMnd ↔ (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd)) |
| 33 | 24, 32 | mpbird 260 | . 2 ⊢ (𝜑 → (mulGrp‘𝑌) ∈ CMnd) |
| 34 | 26 | iscrng 20379 | . 2 ⊢ (𝑌 ∈ CRing ↔ (𝑌 ∈ Ring ∧ (mulGrp‘𝑌) ∈ CMnd)) |
| 35 | 9, 33, 34 | sylanbrc 595 | 1 ⊢ (𝜑 → 𝑌 ∈ CRing) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 Vcvv 3450 ⊆ wss 3899 ↾ cres 5657 ∘ ccom 5659 Fn wfn 6528 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 Basecbs 17301 +gcplusg 17342 Xscprds 17530 CMndccmn 19907 mulGrpcmgp 20273 Ringcrg 20372 CRingccrg 20373 |
| 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-map 8828 df-ixp 8905 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 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-sets 17256 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-hom 17366 df-cco 17367 df-0g 17526 df-prds 17532 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-grp 19060 df-minusg 19061 df-cmn 19909 df-abl 19910 df-mgp 20274 df-rng 20288 df-ur 20321 df-ring 20374 df-cring 20375 |
| This theorem is used by: pwscrng 20466 |
| Copyright terms: Public domain | W3C validator |