| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dvdschrmulg | Structured version Visualization version GIF version | ||
| Description: In a ring, any multiple of the characteristics annihilates all elements. (Contributed by Thierry Arnoux, 6-Sep-2016.) |
| Ref | Expression |
|---|---|
| dvdschrmulg.1 | ⊢ 𝐶 = (chr‘𝑅) |
| dvdschrmulg.2 | ⊢ 𝐵 = (Base‘𝑅) |
| dvdschrmulg.3 | ⊢ · = (.g‘𝑅) |
| dvdschrmulg.4 | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| dvdschrmulg | ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · 𝐴) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Ring) | |
| 2 | dvdszrcl 16316 | . . . . 5 ⊢ (𝐶 ∥ 𝑁 → (𝐶 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 3 | 2 | simprd 500 | . . . 4 ⊢ (𝐶 ∥ 𝑁 → 𝑁 ∈ ℤ) |
| 4 | 3 | 3ad2ant2 1152 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑁 ∈ ℤ) |
| 5 | dvdschrmulg.2 | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | eqid 2763 | . . . . 5 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 7 | 5, 6 | ringidcl 20349 | . . . 4 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 8 | 1, 7 | syl 18 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (1r‘𝑅) ∈ 𝐵) |
| 9 | simp3 1156 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵) | |
| 10 | dvdschrmulg.3 | . . . 4 ⊢ · = (.g‘𝑅) | |
| 11 | eqid 2763 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 12 | 5, 10, 11 | mulgass2 20393 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ (1r‘𝑅) ∈ 𝐵 ∧ 𝐴 ∈ 𝐵)) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 13 | 1, 4, 8, 9, 12 | syl13anc 1399 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 14 | ringgrp 20321 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 15 | 1, 14 | syl 18 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 16 | eqid 2763 | . . . . . . 7 ⊢ (od‘𝑅) = (od‘𝑅) | |
| 17 | dvdschrmulg.1 | . . . . . . 7 ⊢ 𝐶 = (chr‘𝑅) | |
| 18 | 16, 6, 17 | chrval 21654 | . . . . . 6 ⊢ ((od‘𝑅)‘(1r‘𝑅)) = 𝐶 |
| 19 | simp2 1155 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐶 ∥ 𝑁) | |
| 20 | 18, 19 | eqbrtrid 5147 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) |
| 21 | dvdschrmulg.4 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 22 | 5, 16, 10, 21 | oddvdsi 19619 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (1r‘𝑅) ∈ 𝐵 ∧ ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 23 | 15, 8, 20, 22 | syl3anc 1398 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 24 | 23 | oveq1d 7427 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = ( 0 (.r‘𝑅)𝐴)) |
| 25 | 5, 11, 21 | ringlz 20377 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 26 | 25 | 3adant2 1149 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 27 | 24, 26 | eqtrd 2798 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = 0 ) |
| 28 | 5, 11, 6 | ringlidm 20353 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 29 | 28 | 3adant2 1149 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 30 | 29 | oveq2d 7428 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴)) = (𝑁 · 𝐴)) |
| 31 | 13, 27, 30 | 3eqtr3rd 2807 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · 𝐴) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 class class class wbr 5110 ‘cfv 6538 (class class class)co 7412 ℤcz 12592 ∥ cdvds 16311 Basecbs 17270 .rcmulr 17312 0gc0g 17493 Grpcgrp 19001 .gcmg 19134 odcod 19595 1rcur 20264 Ringcrg 20316 chrcchr 21632 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-sup 9403 df-inf 9404 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-n0 12506 df-z 12593 df-uz 12864 df-rp 13018 df-fz 13537 df-fl 13827 df-mod 13905 df-seq 14040 df-exp 14100 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 df-dvds 16312 df-sets 17225 df-slot 17243 df-ndx 17255 df-base 17271 df-plusg 17324 df-0g 17495 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-grp 19004 df-minusg 19005 df-sbg 19006 df-mulg 19135 df-od 19599 df-cmn 19853 df-abl 19854 df-mgp 20218 df-rng 20232 df-ur 20265 df-ring 20318 df-chr 21636 |
| This theorem is referenced by: freshmansdream 21705 |
| Copyright terms: Public domain | W3C validator |