Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iscrng2 | Structured version Visualization version GIF version |
Description: A commutative ring is a ring whose multiplication is a commutative monoid. (Contributed by Mario Carneiro, 15-Jun-2015.) |
Ref | Expression |
---|---|
ringcl.b | ⊢ 𝐵 = (Base‘𝑅) |
ringcl.t | ⊢ · = (.r‘𝑅) |
Ref | Expression |
---|---|
iscrng2 | ⊢ (𝑅 ∈ CRing ↔ (𝑅 ∈ Ring ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 · 𝑦) = (𝑦 · 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2823 | . . 3 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
2 | 1 | iscrng 19306 | . 2 ⊢ (𝑅 ∈ CRing ↔ (𝑅 ∈ Ring ∧ (mulGrp‘𝑅) ∈ CMnd)) |
3 | 1 | ringmgp 19305 | . . . 4 ⊢ (𝑅 ∈ Ring → (mulGrp‘𝑅) ∈ Mnd) |
4 | ringcl.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
5 | 1, 4 | mgpbas 19247 | . . . . . 6 ⊢ 𝐵 = (Base‘(mulGrp‘𝑅)) |
6 | ringcl.t | . . . . . . 7 ⊢ · = (.r‘𝑅) | |
7 | 1, 6 | mgpplusg 19245 | . . . . . 6 ⊢ · = (+g‘(mulGrp‘𝑅)) |
8 | 5, 7 | iscmn 18916 | . . . . 5 ⊢ ((mulGrp‘𝑅) ∈ CMnd ↔ ((mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 · 𝑦) = (𝑦 · 𝑥))) |
9 | 8 | baib 538 | . . . 4 ⊢ ((mulGrp‘𝑅) ∈ Mnd → ((mulGrp‘𝑅) ∈ CMnd ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 · 𝑦) = (𝑦 · 𝑥))) |
10 | 3, 9 | syl 17 | . . 3 ⊢ (𝑅 ∈ Ring → ((mulGrp‘𝑅) ∈ CMnd ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 · 𝑦) = (𝑦 · 𝑥))) |
11 | 10 | pm5.32i 577 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (mulGrp‘𝑅) ∈ CMnd) ↔ (𝑅 ∈ Ring ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 · 𝑦) = (𝑦 · 𝑥))) |
12 | 2, 11 | bitri 277 | 1 ⊢ (𝑅 ∈ CRing ↔ (𝑅 ∈ Ring ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 · 𝑦) = (𝑦 · 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3140 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 .rcmulr 16568 Mndcmnd 17913 CMndccmn 18908 mulGrpcmgp 19241 Ringcrg 19299 CRingccrg 19300 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-plusg 16580 df-cmn 18910 df-mgp 19242 df-ring 19301 df-cring 19302 |
This theorem is referenced by: primefld 19586 quscrng 20015 mat0dimcrng 21081 mat1dimcrng 21088 dmatcrng 21113 scmatcrng 21132 |
Copyright terms: Public domain | W3C validator |