| 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 1143 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Ring) | |
| 2 | dvdszrcl 16221 | . . . . 5 ⊢ (𝐶 ∥ 𝑁 → (𝐶 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 3 | 2 | simprd 497 | . . . 4 ⊢ (𝐶 ∥ 𝑁 → 𝑁 ∈ ℤ) |
| 4 | 3 | 3ad2ant2 1141 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑁 ∈ ℤ) |
| 5 | dvdschrmulg.2 | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | eqid 2741 | . . . . 5 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 7 | 5, 6 | ringidcl 20240 | . . . 4 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 8 | 1, 7 | syl 17 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (1r‘𝑅) ∈ 𝐵) |
| 9 | simp3 1145 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵) | |
| 10 | dvdschrmulg.3 | . . . 4 ⊢ · = (.g‘𝑅) | |
| 11 | eqid 2741 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 12 | 5, 10, 11 | mulgass2 20284 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ (1r‘𝑅) ∈ 𝐵 ∧ 𝐴 ∈ 𝐵)) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 13 | 1, 4, 8, 9, 12 | syl13anc 1381 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 14 | ringgrp 20213 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 15 | 1, 14 | syl 17 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 16 | eqid 2741 | . . . . . . 7 ⊢ (od‘𝑅) = (od‘𝑅) | |
| 17 | dvdschrmulg.1 | . . . . . . 7 ⊢ 𝐶 = (chr‘𝑅) | |
| 18 | 16, 6, 17 | chrval 21501 | . . . . . 6 ⊢ ((od‘𝑅)‘(1r‘𝑅)) = 𝐶 |
| 19 | simp2 1144 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐶 ∥ 𝑁) | |
| 20 | 18, 19 | eqbrtrid 5109 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) |
| 21 | dvdschrmulg.4 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 22 | 5, 16, 10, 21 | oddvdsi 19517 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (1r‘𝑅) ∈ 𝐵 ∧ ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 23 | 15, 8, 20, 22 | syl3anc 1380 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 24 | 23 | oveq1d 7374 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = ( 0 (.r‘𝑅)𝐴)) |
| 25 | 5, 11, 21 | ringlz 20268 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 26 | 25 | 3adant2 1138 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 27 | 24, 26 | eqtrd 2776 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = 0 ) |
| 28 | 5, 11, 6 | ringlidm 20244 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 29 | 28 | 3adant2 1138 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 30 | 29 | oveq2d 7375 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴)) = (𝑁 · 𝐴)) |
| 31 | 13, 27, 30 | 3eqtr3rd 2785 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · 𝐴) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 class class class wbr 5074 ‘cfv 6488 (class class class)co 7359 ℤcz 12519 ∥ cdvds 16216 Basecbs 17174 .rcmulr 17216 0gc0g 17397 Grpcgrp 18904 .gcmg 19038 odcod 19493 1rcur 20156 Ringcrg 20208 chrcchr 21479 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111 ax-pre-sup 11112 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1st 7933 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-sup 9349 df-inf 9350 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-div 11804 df-nn 12170 df-2 12239 df-3 12240 df-n0 12433 df-z 12520 df-uz 12784 df-rp 12938 df-fz 13457 df-fl 13746 df-mod 13824 df-seq 13959 df-exp 14019 df-cj 15056 df-re 15057 df-im 15058 df-sqrt 15192 df-abs 15193 df-dvds 16217 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-plusg 17228 df-0g 17399 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-grp 18907 df-minusg 18908 df-sbg 18909 df-mulg 19039 df-od 19497 df-cmn 19751 df-abl 19752 df-mgp 20116 df-rng 20128 df-ur 20157 df-ring 20210 df-chr 21483 |
| This theorem is referenced by: freshmansdream 21552 |
| Copyright terms: Public domain | W3C validator |