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 19239 | . . . . 5 ⊢ (𝑥 ∈ CRing → 𝑥 ∈ Ring) | |
6 | 5 | ssriv 3970 | . . . 4 ⊢ CRing ⊆ Ring |
7 | fss 6521 | . . . 4 ⊢ ((𝑅:𝐼⟶CRing ∧ CRing ⊆ Ring) → 𝑅:𝐼⟶Ring) | |
8 | 4, 6, 7 | sylancl 586 | . . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Ring) |
9 | 1, 2, 3, 8 | prdsringd 19293 | . 2 ⊢ (𝜑 → 𝑌 ∈ Ring) |
10 | eqid 2821 | . . . 4 ⊢ (𝑆Xs(mulGrp ∘ 𝑅)) = (𝑆Xs(mulGrp ∘ 𝑅)) | |
11 | fnmgp 19172 | . . . . . . 7 ⊢ mulGrp Fn V | |
12 | ssv 3990 | . . . . . . 7 ⊢ CRing ⊆ V | |
13 | fnssres 6464 | . . . . . . 7 ⊢ ((mulGrp Fn V ∧ CRing ⊆ V) → (mulGrp ↾ CRing) Fn CRing) | |
14 | 11, 12, 13 | mp2an 688 | . . . . . 6 ⊢ (mulGrp ↾ CRing) Fn CRing |
15 | fvres 6683 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) = (mulGrp‘𝑥)) | |
16 | eqid 2821 | . . . . . . . . 9 ⊢ (mulGrp‘𝑥) = (mulGrp‘𝑥) | |
17 | 16 | crngmgp 19236 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → (mulGrp‘𝑥) ∈ CMnd) |
18 | 15, 17 | eqeltrd 2913 | . . . . . . 7 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd) |
19 | 18 | rgen 3148 | . . . . . 6 ⊢ ∀𝑥 ∈ CRing ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd |
20 | ffnfv 6875 | . . . . . 6 ⊢ ((mulGrp ↾ CRing):CRing⟶CMnd ↔ ((mulGrp ↾ CRing) Fn CRing ∧ ∀𝑥 ∈ CRing ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd)) | |
21 | 14, 19, 20 | mpbir2an 707 | . . . . 5 ⊢ (mulGrp ↾ CRing):CRing⟶CMnd |
22 | fco2 6527 | . . . . 5 ⊢ (((mulGrp ↾ CRing):CRing⟶CMnd ∧ 𝑅:𝐼⟶CRing) → (mulGrp ∘ 𝑅):𝐼⟶CMnd) | |
23 | 21, 4, 22 | sylancr 587 | . . . 4 ⊢ (𝜑 → (mulGrp ∘ 𝑅):𝐼⟶CMnd) |
24 | 10, 2, 3, 23 | prdscmnd 18912 | . . 3 ⊢ (𝜑 → (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd) |
25 | eqidd 2822 | . . . 4 ⊢ (𝜑 → (Base‘(mulGrp‘𝑌)) = (Base‘(mulGrp‘𝑌))) | |
26 | eqid 2821 | . . . . . 6 ⊢ (mulGrp‘𝑌) = (mulGrp‘𝑌) | |
27 | 4 | ffnd 6509 | . . . . . 6 ⊢ (𝜑 → 𝑅 Fn 𝐼) |
28 | 1, 26, 10, 2, 3, 27 | prdsmgp 19291 | . . . . 5 ⊢ (𝜑 → ((Base‘(mulGrp‘𝑌)) = (Base‘(𝑆Xs(mulGrp ∘ 𝑅))) ∧ (+g‘(mulGrp‘𝑌)) = (+g‘(𝑆Xs(mulGrp ∘ 𝑅))))) |
29 | 28 | simpld 495 | . . . 4 ⊢ (𝜑 → (Base‘(mulGrp‘𝑌)) = (Base‘(𝑆Xs(mulGrp ∘ 𝑅)))) |
30 | 28 | simprd 496 | . . . . 5 ⊢ (𝜑 → (+g‘(mulGrp‘𝑌)) = (+g‘(𝑆Xs(mulGrp ∘ 𝑅)))) |
31 | 30 | oveqdr 7173 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(mulGrp‘𝑌)) ∧ 𝑦 ∈ (Base‘(mulGrp‘𝑌)))) → (𝑥(+g‘(mulGrp‘𝑌))𝑦) = (𝑥(+g‘(𝑆Xs(mulGrp ∘ 𝑅)))𝑦)) |
32 | 25, 29, 31 | cmnpropd 18847 | . . 3 ⊢ (𝜑 → ((mulGrp‘𝑌) ∈ CMnd ↔ (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd)) |
33 | 24, 32 | mpbird 258 | . 2 ⊢ (𝜑 → (mulGrp‘𝑌) ∈ CMnd) |
34 | 26 | iscrng 19235 | . 2 ⊢ (𝑌 ∈ CRing ↔ (𝑌 ∈ Ring ∧ (mulGrp‘𝑌) ∈ CMnd)) |
35 | 9, 33, 34 | sylanbrc 583 | 1 ⊢ (𝜑 → 𝑌 ∈ CRing) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ∀wral 3138 Vcvv 3495 ⊆ wss 3935 ↾ cres 5551 ∘ ccom 5553 Fn wfn 6344 ⟶wf 6345 ‘cfv 6349 (class class class)co 7145 Basecbs 16473 +gcplusg 16555 Xscprds 16709 CMndccmn 18837 mulGrpcmgp 19170 Ringcrg 19228 CRingccrg 19229 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7450 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-uni 4833 df-int 4870 df-iun 4914 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7569 df-1st 7680 df-2nd 7681 df-wrecs 7938 df-recs 7999 df-rdg 8037 df-1o 8093 df-oadd 8097 df-er 8279 df-map 8398 df-ixp 8451 df-en 8499 df-dom 8500 df-sdom 8501 df-fin 8502 df-sup 8895 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11628 df-2 11689 df-3 11690 df-4 11691 df-5 11692 df-6 11693 df-7 11694 df-8 11695 df-9 11696 df-n0 11887 df-z 11971 df-dec 12088 df-uz 12233 df-fz 12883 df-struct 16475 df-ndx 16476 df-slot 16477 df-base 16479 df-sets 16480 df-plusg 16568 df-mulr 16569 df-sca 16571 df-vsca 16572 df-ip 16573 df-tset 16574 df-ple 16575 df-ds 16577 df-hom 16579 df-cco 16580 df-0g 16705 df-prds 16711 df-mgm 17842 df-sgrp 17891 df-mnd 17902 df-grp 18046 df-minusg 18047 df-cmn 18839 df-mgp 19171 df-ring 19230 df-cring 19231 |
This theorem is referenced by: pwscrng 19298 |
Copyright terms: Public domain | W3C validator |