| 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 20465 | . . . . 5 ⊢ (𝑥 ∈ CRing → 𝑥 ∈ Ring) | |
| 6 | 5 | ssriv 3935 | . . . 4 ⊢ CRing ⊆ Ring |
| 7 | fss 6724 | . . . 4 ⊢ ((𝑅:𝐼⟶CRing ∧ CRing ⊆ Ring) → 𝑅:𝐼⟶Ring) | |
| 8 | 4, 6, 7 | sylancl 598 | . . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Ring) |
| 9 | 1, 2, 3, 8 | prdsringd 20543 | . 2 ⊢ (𝜑 → 𝑌 ∈ Ring) |
| 10 | eqid 2761 | . . . 4 ⊢ (𝑆Xs(mulGrp ∘ 𝑅)) = (𝑆Xs(mulGrp ∘ 𝑅)) | |
| 11 | fnmgp 20355 | . . . . . . 7 ⊢ mulGrp Fn V | |
| 12 | ssv 3955 | . . . . . . 7 ⊢ CRing ⊆ V | |
| 13 | fnssres 6660 | . . . . . . 7 ⊢ ((mulGrp Fn V ∧ CRing ⊆ V) → (mulGrp ↾ CRing) Fn CRing) | |
| 14 | 11, 12, 13 | mp2an 705 | . . . . . 6 ⊢ (mulGrp ↾ CRing) Fn CRing |
| 15 | fvres 6902 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) = (mulGrp‘𝑥)) | |
| 16 | eqid 2761 | . . . . . . . . 9 ⊢ (mulGrp‘𝑥) = (mulGrp‘𝑥) | |
| 17 | 16 | crngmgp 20460 | . . . . . . . 8 ⊢ (𝑥 ∈ CRing → (mulGrp‘𝑥) ∈ CMnd) |
| 18 | 15, 17 | eqeltrd 2861 | . . . . . . 7 ⊢ (𝑥 ∈ CRing → ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd) |
| 19 | 18 | rgen 3079 | . . . . . 6 ⊢ ∀𝑥 ∈ CRing ((mulGrp ↾ CRing)‘𝑥) ∈ CMnd |
| 20 | ffnfv 7117 | . . . . . 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 6734 | . . . . 5 ⊢ (((mulGrp ↾ CRing):CRing⟶CMnd ∧ 𝑅:𝐼⟶CRing) → (mulGrp ∘ 𝑅):𝐼⟶CMnd) | |
| 23 | 21, 4, 22 | sylancr 599 | . . . 4 ⊢ (𝜑 → (mulGrp ∘ 𝑅):𝐼⟶CMnd) |
| 24 | 10, 2, 3, 23 | prdscmnd 20068 | . . 3 ⊢ (𝜑 → (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd) |
| 25 | eqidd 2762 | . . . 4 ⊢ (𝜑 → (Base‘(mulGrp‘𝑌)) = (Base‘(mulGrp‘𝑌))) | |
| 26 | eqid 2761 | . . . . . 6 ⊢ (mulGrp‘𝑌) = (mulGrp‘𝑌) | |
| 27 | 4 | ffnd 6708 | . . . . . 6 ⊢ (𝜑 → 𝑅 Fn 𝐼) |
| 28 | 1, 26, 10, 2, 3, 27 | prdsmgp 20364 | . . . . 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 7446 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(mulGrp‘𝑌)) ∧ 𝑦 ∈ (Base‘(mulGrp‘𝑌)))) → (𝑥(+g‘(mulGrp‘𝑌))𝑦) = (𝑥(+g‘(𝑆Xs(mulGrp ∘ 𝑅)))𝑦)) |
| 32 | 25, 29, 31 | cmnpropd 19998 | . . 3 ⊢ (𝜑 → ((mulGrp‘𝑌) ∈ CMnd ↔ (𝑆Xs(mulGrp ∘ 𝑅)) ∈ CMnd)) |
| 33 | 24, 32 | mpbird 260 | . 2 ⊢ (𝜑 → (mulGrp‘𝑌) ∈ CMnd) |
| 34 | 26 | iscrng 20459 | . 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 3077 Vcvv 3451 ⊆ wss 3899 ↾ cres 5653 ∘ ccom 5655 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 (class class class)co 7418 Basecbs 17380 +gcplusg 17421 Xscprds 17609 CMndccmn 19987 mulGrpcmgp 20353 Ringcrg 20452 CRingccrg 20453 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-er 8710 df-map 8842 df-ixp 8919 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-sup 9427 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-3 12399 df-4 12400 df-5 12401 df-6 12402 df-7 12403 df-8 12404 df-9 12405 df-n0 12600 df-z 12687 df-dec 12808 df-uz 12959 df-fz 13633 df-struct 17318 df-sets 17335 df-slot 17353 df-ndx 17365 df-base 17381 df-plusg 17434 df-mulr 17435 df-sca 17437 df-vsca 17438 df-ip 17439 df-tset 17440 df-ple 17441 df-ds 17443 df-hom 17445 df-cco 17446 df-0g 17605 df-prds 17611 df-mgm 18809 df-sgrp 18901 df-mnd 18917 df-grp 19140 df-minusg 19141 df-cmn 19989 df-abl 19990 df-mgp 20354 df-rng 20368 df-ur 20401 df-ring 20454 df-cring 20455 |
| This theorem is used by: pwscrng 20548 |
| Copyright terms: Public domain | W3C validator |