| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unitnegcl | Structured version Visualization version GIF version | ||
| Description: The negative of a unit is a unit. (Contributed by Mario Carneiro, 4-Dec-2014.) |
| Ref | Expression |
|---|---|
| unitnegcl.1 | ⊢ 𝑈 = (Unit‘𝑅) |
| unitnegcl.2 | ⊢ 𝑁 = (invg‘𝑅) |
| Ref | Expression |
|---|---|
| unitnegcl | ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 487 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ Ring) | |
| 2 | ringgrp 20321 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 3 | eqid 2763 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 4 | unitnegcl.1 | . . . . . . 7 ⊢ 𝑈 = (Unit‘𝑅) | |
| 5 | 3, 4 | unitcl 20458 | . . . . . 6 ⊢ (𝑋 ∈ 𝑈 → 𝑋 ∈ (Base‘𝑅)) |
| 6 | unitnegcl.2 | . . . . . . 7 ⊢ 𝑁 = (invg‘𝑅) | |
| 7 | 3, 6 | grpinvcl 19055 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
| 8 | 2, 5, 7 | syl2an 607 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
| 9 | eqid 2763 | . . . . . 6 ⊢ (∥r‘𝑅) = (∥r‘𝑅) | |
| 10 | 3, 9, 6 | dvdsrneg 20453 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
| 11 | 8, 10 | syldan 602 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
| 12 | 3, 6 | grpinvinv 19073 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 13 | 2, 5, 12 | syl2an 607 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 14 | 11, 13 | breqtrd 5138 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)𝑋) |
| 15 | eqid 2763 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 16 | eqid 2763 | . . . . . 6 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
| 17 | eqid 2763 | . . . . . 6 ⊢ (∥r‘(oppr‘𝑅)) = (∥r‘(oppr‘𝑅)) | |
| 18 | 4, 15, 9, 16, 17 | isunit 20456 | . . . . 5 ⊢ (𝑋 ∈ 𝑈 ↔ (𝑋(∥r‘𝑅)(1r‘𝑅) ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
| 19 | 18 | bilani 509 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑋(∥r‘𝑅)(1r‘𝑅) ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
| 20 | 19 | simpld 499 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋(∥r‘𝑅)(1r‘𝑅)) |
| 21 | 3, 9 | dvdsrtr 20451 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋)(∥r‘𝑅)𝑋 ∧ 𝑋(∥r‘𝑅)(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
| 22 | 1, 14, 20, 21 | syl3anc 1398 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
| 23 | 16 | opprring 20430 | . . . 4 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring) |
| 24 | 23 | adantr 485 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (oppr‘𝑅) ∈ Ring) |
| 25 | 16, 3 | opprbas 20426 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘(oppr‘𝑅)) |
| 26 | 16, 6 | opprneg 20434 | . . . . . 6 ⊢ 𝑁 = (invg‘(oppr‘𝑅)) |
| 27 | 25, 17, 26 | dvdsrneg 20453 | . . . . 5 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
| 28 | 24, 8, 27 | syl2anc 595 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
| 29 | 28, 13 | breqtrd 5138 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋) |
| 30 | 19 | simprd 500 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 31 | 25, 17 | dvdsrtr 20451 | . . 3 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋 ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 32 | 24, 29, 30, 31 | syl3anc 1398 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 33 | 4, 15, 9, 16, 17 | isunit 20456 | . 2 ⊢ ((𝑁‘𝑋) ∈ 𝑈 ↔ ((𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅) ∧ (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
| 34 | 22, 32, 33 | sylanbrc 594 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 class class class wbr 5110 ‘cfv 6538 Basecbs 17270 Grpcgrp 19001 invgcminusg 19002 1rcur 20264 Ringcrg 20316 opprcoppr 20419 ∥rcdsr 20437 Unitcui 20438 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-2nd 7988 df-tpos 8223 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-3 12305 df-sets 17225 df-slot 17243 df-ndx 17255 df-base 17271 df-plusg 17324 df-mulr 17325 df-0g 17495 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-grp 19004 df-minusg 19005 df-cmn 19853 df-abl 19854 df-mgp 20218 df-rng 20232 df-ur 20265 df-ring 20318 df-oppr 20420 df-dvdsr 20440 df-unit 20441 |
| This theorem is referenced by: irredneg 20513 deg1invg 26244 nzrneg1ne0 48972 invginvrid 49124 lincresunit3lem3 49231 lincresunitlem1 49232 |
| Copyright terms: Public domain | W3C validator |