| 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 1137 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Ring) | |
| 2 | dvdszrcl 16217 | . . . . 5 ⊢ (𝐶 ∥ 𝑁 → (𝐶 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 3 | 2 | simprd 495 | . . . 4 ⊢ (𝐶 ∥ 𝑁 → 𝑁 ∈ ℤ) |
| 4 | 3 | 3ad2ant2 1135 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑁 ∈ ℤ) |
| 5 | dvdschrmulg.2 | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | eqid 2737 | . . . . 5 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 7 | 5, 6 | ringidcl 20237 | . . . 4 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 8 | 1, 7 | syl 17 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (1r‘𝑅) ∈ 𝐵) |
| 9 | simp3 1139 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵) | |
| 10 | dvdschrmulg.3 | . . . 4 ⊢ · = (.g‘𝑅) | |
| 11 | eqid 2737 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 12 | 5, 10, 11 | mulgass2 20281 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ (1r‘𝑅) ∈ 𝐵 ∧ 𝐴 ∈ 𝐵)) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 13 | 1, 4, 8, 9, 12 | syl13anc 1375 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 14 | ringgrp 20210 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 15 | 1, 14 | syl 17 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 16 | eqid 2737 | . . . . . . 7 ⊢ (od‘𝑅) = (od‘𝑅) | |
| 17 | dvdschrmulg.1 | . . . . . . 7 ⊢ 𝐶 = (chr‘𝑅) | |
| 18 | 16, 6, 17 | chrval 21513 | . . . . . 6 ⊢ ((od‘𝑅)‘(1r‘𝑅)) = 𝐶 |
| 19 | simp2 1138 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐶 ∥ 𝑁) | |
| 20 | 18, 19 | eqbrtrid 5121 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) |
| 21 | dvdschrmulg.4 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 22 | 5, 16, 10, 21 | oddvdsi 19514 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (1r‘𝑅) ∈ 𝐵 ∧ ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 23 | 15, 8, 20, 22 | syl3anc 1374 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 24 | 23 | oveq1d 7375 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = ( 0 (.r‘𝑅)𝐴)) |
| 25 | 5, 11, 21 | ringlz 20265 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 26 | 25 | 3adant2 1132 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 27 | 24, 26 | eqtrd 2772 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = 0 ) |
| 28 | 5, 11, 6 | ringlidm 20241 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 29 | 28 | 3adant2 1132 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 30 | 29 | oveq2d 7376 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴)) = (𝑁 · 𝐴)) |
| 31 | 13, 27, 30 | 3eqtr3rd 2781 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · 𝐴) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6492 (class class class)co 7360 ℤcz 12515 ∥ cdvds 16212 Basecbs 17170 .rcmulr 17212 0gc0g 17393 Grpcgrp 18900 .gcmg 19034 odcod 19490 1rcur 20153 Ringcrg 20205 chrcchr 21491 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-sup 9348 df-inf 9349 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-fz 13453 df-fl 13742 df-mod 13820 df-seq 13955 df-exp 14015 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-dvds 16213 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-plusg 17224 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18903 df-minusg 18904 df-sbg 18905 df-mulg 19035 df-od 19494 df-cmn 19748 df-abl 19749 df-mgp 20113 df-rng 20125 df-ur 20154 df-ring 20207 df-chr 21495 |
| This theorem is referenced by: freshmansdream 21564 |
| Copyright terms: Public domain | W3C validator |