| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rngm2neg | Structured version Visualization version GIF version | ||
| Description: Double negation of a product in a non-unital ring (mul2neg 11580 analog). (Contributed by Mario Carneiro, 4-Dec-2014.) Generalization of ringm2neg 20278. (Revised 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 |
|---|---|
| rngm2neg | ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑋 · 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rngneglmul.b | . . 3 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | rngneglmul.t | . . 3 ⊢ · = (.r‘𝑅) | |
| 3 | rngneglmul.n | . . 3 ⊢ 𝑁 = (invg‘𝑅) | |
| 4 | rngneglmul.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ Rng) | |
| 5 | rngneglmul.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 6 | rnggrp 20130 | . . . . 5 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
| 7 | 4, 6 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp) |
| 8 | rngneglmul.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 9 | 1, 3, 7, 8 | grpinvcld 18955 | . . 3 ⊢ (𝜑 → (𝑁‘𝑌) ∈ 𝐵) |
| 10 | 1, 2, 3, 4, 5, 9 | rngmneg1 20139 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑁‘(𝑋 · (𝑁‘𝑌)))) |
| 11 | 1, 2, 3, 4, 5, 8 | rngmneg2 20140 | . . 3 ⊢ (𝜑 → (𝑋 · (𝑁‘𝑌)) = (𝑁‘(𝑋 · 𝑌))) |
| 12 | 11 | fveq2d 6831 | . 2 ⊢ (𝜑 → (𝑁‘(𝑋 · (𝑁‘𝑌))) = (𝑁‘(𝑁‘(𝑋 · 𝑌)))) |
| 13 | 1, 2 | rngcl 20136 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| 14 | 4, 5, 8, 13 | syl3anc 1379 | . . 3 ⊢ (𝜑 → (𝑋 · 𝑌) ∈ 𝐵) |
| 15 | 1, 3 | grpinvinv 18972 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 𝑌) ∈ 𝐵) → (𝑁‘(𝑁‘(𝑋 · 𝑌))) = (𝑋 · 𝑌)) |
| 16 | 7, 14, 15 | syl2anc 590 | . 2 ⊢ (𝜑 → (𝑁‘(𝑁‘(𝑋 · 𝑌))) = (𝑋 · 𝑌)) |
| 17 | 10, 12, 16 | 3eqtrd 2778 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑋 · 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∈ wcel 2119 ‘cfv 6485 (class class class)co 7356 Basecbs 17170 .rcmulr 17212 Grpcgrp 18900 invgcminusg 18901 Rngcrng 20124 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 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 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 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-abl 19749 df-mgp 20113 df-rng 20125 |
| This theorem is referenced by: ringm2neg 20278 |
| Copyright terms: Public domain | W3C validator |