| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > crngcom | GIF version | ||
| Description: A commutative ring's multiplication operation is commutative. (Contributed by Mario Carneiro, 7-Jan-2015.) |
| Ref | Expression |
|---|---|
| ringcl.b | ⊢ 𝐵 = (Base‘𝑅) |
| ringcl.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| crngcom | ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) = (𝑌 · 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2231 | . . . . 5 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 2 | 1 | crngmgp 14016 | . . . 4 ⊢ (𝑅 ∈ CRing → (mulGrp‘𝑅) ∈ CMnd) |
| 3 | 2 | 3ad2ant1 1044 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (mulGrp‘𝑅) ∈ CMnd) |
| 4 | simp2 1024 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 5 | ringcl.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | 1, 5 | mgpbasg 13938 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝐵 = (Base‘(mulGrp‘𝑅))) |
| 7 | 6 | 3ad2ant1 1044 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐵 = (Base‘(mulGrp‘𝑅))) |
| 8 | 4, 7 | eleqtrd 2310 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ (Base‘(mulGrp‘𝑅))) |
| 9 | simp3 1025 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 10 | 9, 7 | eleqtrd 2310 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ (Base‘(mulGrp‘𝑅))) |
| 11 | eqid 2231 | . . . 4 ⊢ (Base‘(mulGrp‘𝑅)) = (Base‘(mulGrp‘𝑅)) | |
| 12 | eqid 2231 | . . . 4 ⊢ (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅)) | |
| 13 | 11, 12 | cmncom 13888 | . . 3 ⊢ (((mulGrp‘𝑅) ∈ CMnd ∧ 𝑋 ∈ (Base‘(mulGrp‘𝑅)) ∧ 𝑌 ∈ (Base‘(mulGrp‘𝑅))) → (𝑋(+g‘(mulGrp‘𝑅))𝑌) = (𝑌(+g‘(mulGrp‘𝑅))𝑋)) |
| 14 | 3, 8, 10, 13 | syl3anc 1273 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(+g‘(mulGrp‘𝑅))𝑌) = (𝑌(+g‘(mulGrp‘𝑅))𝑋)) |
| 15 | ringcl.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 16 | 1, 15 | mgpplusgg 13936 | . . . 4 ⊢ (𝑅 ∈ CRing → · = (+g‘(mulGrp‘𝑅))) |
| 17 | 16 | 3ad2ant1 1044 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → · = (+g‘(mulGrp‘𝑅))) |
| 18 | 17 | oveqd 6034 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) = (𝑋(+g‘(mulGrp‘𝑅))𝑌)) |
| 19 | 17 | oveqd 6034 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 · 𝑋) = (𝑌(+g‘(mulGrp‘𝑅))𝑋)) |
| 20 | 14, 18, 19 | 3eqtr4d 2274 | 1 ⊢ ((𝑅 ∈ CRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) = (𝑌 · 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6017 Basecbs 13081 +gcplusg 13159 .rcmulr 13160 CMndccmn 13870 mulGrpcmgp 13932 CRingccrg 14009 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-pre-ltirr 8143 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-iota 5286 df-fun 5328 df-fn 5329 df-fv 5334 df-ov 6020 df-oprab 6021 df-mpo 6022 df-pnf 8215 df-mnf 8216 df-ltxr 8218 df-inn 9143 df-2 9201 df-3 9202 df-ndx 13084 df-slot 13085 df-base 13087 df-sets 13088 df-plusg 13172 df-mulr 13173 df-cmn 13872 df-mgp 13933 df-cring 14011 |
| This theorem is referenced by: crngoppr 14084 unitmulclb 14127 rdivmuldivd 14157 rmodislmodlem 14363 quscrng 14546 |
| Copyright terms: Public domain | W3C validator |