| 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 1136 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Ring) | |
| 2 | dvdszrcl 16184 | . . . . 5 ⊢ (𝐶 ∥ 𝑁 → (𝐶 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 3 | 2 | simprd 495 | . . . 4 ⊢ (𝐶 ∥ 𝑁 → 𝑁 ∈ ℤ) |
| 4 | 3 | 3ad2ant2 1134 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑁 ∈ ℤ) |
| 5 | dvdschrmulg.2 | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | eqid 2736 | . . . . 5 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 7 | 5, 6 | ringidcl 20200 | . . . 4 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵) |
| 8 | 1, 7 | syl 17 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (1r‘𝑅) ∈ 𝐵) |
| 9 | simp3 1138 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵) | |
| 10 | dvdschrmulg.3 | . . . 4 ⊢ · = (.g‘𝑅) | |
| 11 | eqid 2736 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 12 | 5, 10, 11 | mulgass2 20244 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ (1r‘𝑅) ∈ 𝐵 ∧ 𝐴 ∈ 𝐵)) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 13 | 1, 4, 8, 9, 12 | syl13anc 1374 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴))) |
| 14 | ringgrp 20173 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 15 | 1, 14 | syl 17 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 16 | eqid 2736 | . . . . . . 7 ⊢ (od‘𝑅) = (od‘𝑅) | |
| 17 | dvdschrmulg.1 | . . . . . . 7 ⊢ 𝐶 = (chr‘𝑅) | |
| 18 | 16, 6, 17 | chrval 21478 | . . . . . 6 ⊢ ((od‘𝑅)‘(1r‘𝑅)) = 𝐶 |
| 19 | simp2 1137 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → 𝐶 ∥ 𝑁) | |
| 20 | 18, 19 | eqbrtrid 5133 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) |
| 21 | dvdschrmulg.4 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 22 | 5, 16, 10, 21 | oddvdsi 19477 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (1r‘𝑅) ∈ 𝐵 ∧ ((od‘𝑅)‘(1r‘𝑅)) ∥ 𝑁) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 23 | 15, 8, 20, 22 | syl3anc 1373 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · (1r‘𝑅)) = 0 ) |
| 24 | 23 | oveq1d 7373 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = ( 0 (.r‘𝑅)𝐴)) |
| 25 | 5, 11, 21 | ringlz 20228 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 26 | 25 | 3adant2 1131 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ( 0 (.r‘𝑅)𝐴) = 0 ) |
| 27 | 24, 26 | eqtrd 2771 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((𝑁 · (1r‘𝑅))(.r‘𝑅)𝐴) = 0 ) |
| 28 | 5, 11, 6 | ringlidm 20204 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 29 | 28 | 3adant2 1131 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → ((1r‘𝑅)(.r‘𝑅)𝐴) = 𝐴) |
| 30 | 29 | oveq2d 7374 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · ((1r‘𝑅)(.r‘𝑅)𝐴)) = (𝑁 · 𝐴)) |
| 31 | 13, 27, 30 | 3eqtr3rd 2780 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∥ 𝑁 ∧ 𝐴 ∈ 𝐵) → (𝑁 · 𝐴) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 ℤcz 12488 ∥ cdvds 16179 Basecbs 17136 .rcmulr 17178 0gc0g 17359 Grpcgrp 18863 .gcmg 18997 odcod 19453 1rcur 20116 Ringcrg 20168 chrcchr 21456 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-fz 13424 df-fl 13712 df-mod 13790 df-seq 13925 df-exp 13985 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-dvds 16180 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-sbg 18868 df-mulg 18998 df-od 19457 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-chr 21460 |
| This theorem is referenced by: freshmansdream 21529 |
| Copyright terms: Public domain | W3C validator |