Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ringnegl | Structured version Visualization version GIF version |
Description: Negation in a ring is the same as left multiplication by -1. (rngonegmn1l 35234 analog.) (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Mario Carneiro, 2-Jul-2014.) |
Ref | Expression |
---|---|
ringnegl.b | ⊢ 𝐵 = (Base‘𝑅) |
ringnegl.t | ⊢ · = (.r‘𝑅) |
ringnegl.u | ⊢ 1 = (1r‘𝑅) |
ringnegl.n | ⊢ 𝑁 = (invg‘𝑅) |
ringnegl.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
ringnegl.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
Ref | Expression |
---|---|
ringnegl | ⊢ (𝜑 → ((𝑁‘ 1 ) · 𝑋) = (𝑁‘𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ringnegl.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
2 | ringnegl.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
3 | ringnegl.u | . . . . . . 7 ⊢ 1 = (1r‘𝑅) | |
4 | 2, 3 | ringidcl 19318 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 1 ∈ 𝐵) |
5 | 1, 4 | syl 17 | . . . . 5 ⊢ (𝜑 → 1 ∈ 𝐵) |
6 | ringgrp 19302 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
7 | 1, 6 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ Grp) |
8 | ringnegl.n | . . . . . . 7 ⊢ 𝑁 = (invg‘𝑅) | |
9 | 2, 8 | grpinvcl 18151 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → (𝑁‘ 1 ) ∈ 𝐵) |
10 | 7, 5, 9 | syl2anc 586 | . . . . 5 ⊢ (𝜑 → (𝑁‘ 1 ) ∈ 𝐵) |
11 | ringnegl.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
12 | eqid 2821 | . . . . . 6 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
13 | ringnegl.t | . . . . . 6 ⊢ · = (.r‘𝑅) | |
14 | 2, 12, 13 | ringdir 19317 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ ( 1 ∈ 𝐵 ∧ (𝑁‘ 1 ) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → (( 1 (+g‘𝑅)(𝑁‘ 1 )) · 𝑋) = (( 1 · 𝑋)(+g‘𝑅)((𝑁‘ 1 ) · 𝑋))) |
15 | 1, 5, 10, 11, 14 | syl13anc 1368 | . . . 4 ⊢ (𝜑 → (( 1 (+g‘𝑅)(𝑁‘ 1 )) · 𝑋) = (( 1 · 𝑋)(+g‘𝑅)((𝑁‘ 1 ) · 𝑋))) |
16 | eqid 2821 | . . . . . . . 8 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
17 | 2, 12, 16, 8 | grprinv 18153 | . . . . . . 7 ⊢ ((𝑅 ∈ Grp ∧ 1 ∈ 𝐵) → ( 1 (+g‘𝑅)(𝑁‘ 1 )) = (0g‘𝑅)) |
18 | 7, 5, 17 | syl2anc 586 | . . . . . 6 ⊢ (𝜑 → ( 1 (+g‘𝑅)(𝑁‘ 1 )) = (0g‘𝑅)) |
19 | 18 | oveq1d 7171 | . . . . 5 ⊢ (𝜑 → (( 1 (+g‘𝑅)(𝑁‘ 1 )) · 𝑋) = ((0g‘𝑅) · 𝑋)) |
20 | 2, 13, 16 | ringlz 19337 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ((0g‘𝑅) · 𝑋) = (0g‘𝑅)) |
21 | 1, 11, 20 | syl2anc 586 | . . . . 5 ⊢ (𝜑 → ((0g‘𝑅) · 𝑋) = (0g‘𝑅)) |
22 | 19, 21 | eqtrd 2856 | . . . 4 ⊢ (𝜑 → (( 1 (+g‘𝑅)(𝑁‘ 1 )) · 𝑋) = (0g‘𝑅)) |
23 | 2, 13, 3 | ringlidm 19321 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ( 1 · 𝑋) = 𝑋) |
24 | 1, 11, 23 | syl2anc 586 | . . . . 5 ⊢ (𝜑 → ( 1 · 𝑋) = 𝑋) |
25 | 24 | oveq1d 7171 | . . . 4 ⊢ (𝜑 → (( 1 · 𝑋)(+g‘𝑅)((𝑁‘ 1 ) · 𝑋)) = (𝑋(+g‘𝑅)((𝑁‘ 1 ) · 𝑋))) |
26 | 15, 22, 25 | 3eqtr3rd 2865 | . . 3 ⊢ (𝜑 → (𝑋(+g‘𝑅)((𝑁‘ 1 ) · 𝑋)) = (0g‘𝑅)) |
27 | 2, 13 | ringcl 19311 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘ 1 ) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑁‘ 1 ) · 𝑋) ∈ 𝐵) |
28 | 1, 10, 11, 27 | syl3anc 1367 | . . . 4 ⊢ (𝜑 → ((𝑁‘ 1 ) · 𝑋) ∈ 𝐵) |
29 | 2, 12, 16, 8 | grpinvid1 18154 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ ((𝑁‘ 1 ) · 𝑋) ∈ 𝐵) → ((𝑁‘𝑋) = ((𝑁‘ 1 ) · 𝑋) ↔ (𝑋(+g‘𝑅)((𝑁‘ 1 ) · 𝑋)) = (0g‘𝑅))) |
30 | 7, 11, 28, 29 | syl3anc 1367 | . . 3 ⊢ (𝜑 → ((𝑁‘𝑋) = ((𝑁‘ 1 ) · 𝑋) ↔ (𝑋(+g‘𝑅)((𝑁‘ 1 ) · 𝑋)) = (0g‘𝑅))) |
31 | 26, 30 | mpbird 259 | . 2 ⊢ (𝜑 → (𝑁‘𝑋) = ((𝑁‘ 1 ) · 𝑋)) |
32 | 31 | eqcomd 2827 | 1 ⊢ (𝜑 → ((𝑁‘ 1 ) · 𝑋) = (𝑁‘𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 ∈ wcel 2114 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 +gcplusg 16565 .rcmulr 16566 0gc0g 16713 Grpcgrp 18103 invgcminusg 18104 1rcur 19251 Ringcrg 19297 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-plusg 16578 df-0g 16715 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-grp 18106 df-minusg 18107 df-mgp 19240 df-ur 19252 df-ring 19299 |
This theorem is referenced by: ringmneg1 19346 dvdsrneg 19404 abvneg 19605 lmodvsneg 19678 lmodsubvs 19690 lmodsubdi 19691 lmodsubdir 19692 lmodvsinv 19808 mplind 20282 mdetralt 21217 m2detleiblem7 21236 lflsub 36218 baerlem3lem1 38858 |
Copyright terms: Public domain | W3C validator |