| 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 1152 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Ring) | |
| 2 | dvdszrcl 16303 | . . . . 5 ⊢ (𝐶 ∥ 𝑁 → (𝐶 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 3 | 2 | simprd 500 | . . . 4 ⊢ (𝐶 ∥ 𝑁 → 𝑁 ∈ ℤ) |
| 4 | 3 | 3ad2ant2 1150 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑁 ∈ ℤ) |
| 5 | dvdschrmulg.2 | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | eqid 2765 | . . . . 5 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 7 | 5, 6 | ringidcl 20336 | . . . 4 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 8 | 1, 7 | syl 18 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (1r‘𝑅) ∈ 𝐵) |
| 9 | simp3 1154 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵) | |
| 10 | dvdschrmulg.3 | . . . 4 ⊢ · = (.g‘𝑅) | |
| 11 | eqid 2765 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 12 | 5, 10, 11 | mulgass2 20380 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ (1r‘𝑅) ∈ 𝐵 ∧ 𝐴 ∈ 𝐵)) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 13 | 1, 4, 8, 9, 12 | syl13anc 1395 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 14 | ringgrp 20308 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 15 | 1, 14 | syl 18 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 16 | eqid 2765 | . . . . . . 7 ⊢ (od‘𝑅) = (od‘𝑅) | |
| 17 | dvdschrmulg.1 | . . . . . . 7 ⊢ 𝐶 = (chr‘𝑅) | |
| 18 | 16, 6, 17 | chrval 21630 | . . . . . 6 ⊢ ((od‘𝑅)‘(1r‘𝑅)) = 𝐶 |
| 19 | simp2 1153 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐶 ∥ 𝑁) | |
| 20 | 18, 19 | eqbrtrid 5139 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) |
| 21 | dvdschrmulg.4 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 22 | 5, 16, 10, 21 | oddvdsi 19606 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (1r‘𝑅) ∈ 𝐵 ∧ ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 23 | 15, 8, 20, 22 | syl3anc 1394 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 24 | 23 | oveq1d 7415 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = ( 0 (.r‘𝑅)𝐴)) |
| 25 | 5, 11, 21 | ringlz 20364 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 26 | 25 | 3adant2 1147 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 27 | 24, 26 | eqtrd 2800 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = 0 ) |
| 28 | 5, 11, 6 | ringlidm 20340 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 29 | 28 | 3adant2 1147 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 30 | 29 | oveq2d 7416 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴)) = (𝑁 · 𝐴)) |
| 31 | 13, 27, 30 | 3eqtr3rd 2809 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · 𝐴) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 class class class wbr 5104 ‘cfv 6525 (class class class)co 7400 ℤcz 12579 ∥ cdvds 16298 Basecbs 17257 .rcmulr 17299 0gc0g 17480 Grpcgrp 18988 .gcmg 19121 odcod 19582 1rcur 20251 Ringcrg 20303 chrcchr 21608 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-sup 9390 df-inf 9391 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12222 df-2 12291 df-3 12292 df-n0 12493 df-z 12580 df-uz 12851 df-rp 13005 df-fz 13524 df-fl 13813 df-mod 13891 df-seq 14026 df-exp 14086 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275 df-dvds 16299 df-sets 17212 df-slot 17230 df-ndx 17242 df-base 17258 df-plusg 17311 df-0g 17482 df-mgm 18686 df-sgrp 18765 df-mnd 18781 df-grp 18991 df-minusg 18992 df-sbg 18993 df-mulg 19122 df-od 19586 df-cmn 19840 df-abl 19841 df-mgp 20205 df-rng 20219 df-ur 20252 df-ring 20305 df-chr 21612 |
| This theorem is referenced by: freshmansdream 21681 |
| Copyright terms: Public domain | W3C validator |