| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rngmneg2 | Structured version Visualization version GIF version | ||
| Description: Negation of a product in a non-unital ring (mulneg2 11653 analog). In contrast to ringmneg2 20390, the proof does not (and cannot) make use of the existence of a ring unity. (Contributed by AV, 17-Feb-2025.) |
| Ref | Expression |
|---|---|
| rngneglmul.b | ⊢ 𝐵 = (Base‘𝑅) |
| rngneglmul.t | ⊢ · = (.r‘𝑅) |
| rngneglmul.n | ⊢ 𝑁 = (invg‘𝑅) |
| rngneglmul.r | ⊢ (𝜑 → 𝑅 ∈ Rng) |
| rngneglmul.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| rngneglmul.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| rngmneg2 | ⊢ (𝜑 → (𝑋 · (𝑁‘𝑌)) = (𝑁‘(𝑋 · 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rngneglmul.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | eqid 2769 | . . . . . 6 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 3 | eqid 2769 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 4 | rngneglmul.n | . . . . . 6 ⊢ 𝑁 = (invg‘𝑅) | |
| 5 | rngneglmul.r | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Rng) | |
| 6 | rnggrp 20238 | . . . . . . 7 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
| 7 | 5, 6 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ Grp) |
| 8 | rngneglmul.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 9 | 1, 2, 3, 4, 7, 8 | grplinvd 19063 | . . . . 5 ⊢ (𝜑 → ((𝑁‘𝑌)(+g‘𝑅)𝑌) = (0g‘𝑅)) |
| 10 | 9 | oveq2d 7429 | . . . 4 ⊢ (𝜑 → (𝑋 · ((𝑁‘𝑌)(+g‘𝑅)𝑌)) = (𝑋 · (0g‘𝑅))) |
| 11 | rngneglmul.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 12 | rngneglmul.t | . . . . . 6 ⊢ · = (.r‘𝑅) | |
| 13 | 1, 12, 3 | rngrz 20246 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · (0g‘𝑅)) = (0g‘𝑅)) |
| 14 | 5, 11, 13 | syl2anc 595 | . . . 4 ⊢ (𝜑 → (𝑋 · (0g‘𝑅)) = (0g‘𝑅)) |
| 15 | 10, 14 | eqtrd 2804 | . . 3 ⊢ (𝜑 → (𝑋 · ((𝑁‘𝑌)(+g‘𝑅)𝑌)) = (0g‘𝑅)) |
| 16 | 1, 12 | rngcl 20244 | . . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| 17 | 5, 11, 8, 16 | syl3anc 1396 | . . . . 5 ⊢ (𝜑 → (𝑋 · 𝑌) ∈ 𝐵) |
| 18 | 1, 4, 7, 8 | grpinvcld 19057 | . . . . . 6 ⊢ (𝜑 → (𝑁‘𝑌) ∈ 𝐵) |
| 19 | 1, 12 | rngcl 20244 | . . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑋 · (𝑁‘𝑌)) ∈ 𝐵) |
| 20 | 5, 11, 18, 19 | syl3anc 1396 | . . . . 5 ⊢ (𝜑 → (𝑋 · (𝑁‘𝑌)) ∈ 𝐵) |
| 21 | 1, 2, 3, 4 | grpinvid2 19061 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 𝑌) ∈ 𝐵 ∧ (𝑋 · (𝑁‘𝑌)) ∈ 𝐵) → ((𝑁‘(𝑋 · 𝑌)) = (𝑋 · (𝑁‘𝑌)) ↔ ((𝑋 · (𝑁‘𝑌))(+g‘𝑅)(𝑋 · 𝑌)) = (0g‘𝑅))) |
| 22 | 7, 17, 20, 21 | syl3anc 1396 | . . . 4 ⊢ (𝜑 → ((𝑁‘(𝑋 · 𝑌)) = (𝑋 · (𝑁‘𝑌)) ↔ ((𝑋 · (𝑁‘𝑌))(+g‘𝑅)(𝑋 · 𝑌)) = (0g‘𝑅))) |
| 23 | 1, 2, 12 | rngdi 20240 | . . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ (𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 · ((𝑁‘𝑌)(+g‘𝑅)𝑌)) = ((𝑋 · (𝑁‘𝑌))(+g‘𝑅)(𝑋 · 𝑌))) |
| 24 | 23 | eqcomd 2775 | . . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ (𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 · (𝑁‘𝑌))(+g‘𝑅)(𝑋 · 𝑌)) = (𝑋 · ((𝑁‘𝑌)(+g‘𝑅)𝑌))) |
| 25 | 5, 11, 18, 8, 24 | syl13anc 1397 | . . . . 5 ⊢ (𝜑 → ((𝑋 · (𝑁‘𝑌))(+g‘𝑅)(𝑋 · 𝑌)) = (𝑋 · ((𝑁‘𝑌)(+g‘𝑅)𝑌))) |
| 26 | 25 | eqeq1d 2771 | . . . 4 ⊢ (𝜑 → (((𝑋 · (𝑁‘𝑌))(+g‘𝑅)(𝑋 · 𝑌)) = (0g‘𝑅) ↔ (𝑋 · ((𝑁‘𝑌)(+g‘𝑅)𝑌)) = (0g‘𝑅))) |
| 27 | 22, 26 | bitrd 282 | . . 3 ⊢ (𝜑 → ((𝑁‘(𝑋 · 𝑌)) = (𝑋 · (𝑁‘𝑌)) ↔ (𝑋 · ((𝑁‘𝑌)(+g‘𝑅)𝑌)) = (0g‘𝑅))) |
| 28 | 15, 27 | mpbird 260 | . 2 ⊢ (𝜑 → (𝑁‘(𝑋 · 𝑌)) = (𝑋 · (𝑁‘𝑌))) |
| 29 | 28 | eqcomd 2775 | 1 ⊢ (𝜑 → (𝑋 · (𝑁‘𝑌)) = (𝑁‘(𝑋 · 𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ‘cfv 6539 (class class class)co 7413 Basecbs 17271 +gcplusg 17312 .rcmulr 17313 0gc0g 17494 Grpcgrp 19002 invgcminusg 19003 Rngcrng 20232 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5273 ax-pow 5339 ax-pr 5407 ax-un 7735 ax-cnex 11158 ax-resscn 11159 ax-1cn 11160 ax-icn 11161 ax-addcl 11162 ax-addrcl 11163 ax-mulcl 11164 ax-mulrcl 11165 ax-mulcom 11166 ax-addass 11167 ax-mulass 11168 ax-distr 11169 ax-i2m1 11170 ax-1ne0 11171 ax-1rid 11172 ax-rnegex 11173 ax-rrecex 11174 ax-cnre 11175 ax-pre-lttri 11176 ax-pre-lttrn 11177 ax-pre-ltadd 11178 ax-pre-mulgt0 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6305 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6495 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11445 df-neg 11446 df-nn 12236 df-2 12305 df-sets 17226 df-slot 17244 df-ndx 17256 df-base 17272 df-plusg 17325 df-0g 17496 df-mgm 18700 df-sgrp 18779 df-mnd 18795 df-grp 19005 df-minusg 19006 df-abl 19855 df-mgp 20219 df-rng 20233 |
| This theorem is referenced by: rngm2neg 20249 rngsubdi 20251 cntzsubrng 20654 |
| Copyright terms: Public domain | W3C validator |