![]() |
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 486 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ Ring) | |
2 | ringgrp 19295 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
3 | eqid 2798 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
4 | unitnegcl.1 | . . . . . . 7 ⊢ 𝑈 = (Unit‘𝑅) | |
5 | 3, 4 | unitcl 19405 | . . . . . 6 ⊢ (𝑋 ∈ 𝑈 → 𝑋 ∈ (Base‘𝑅)) |
6 | unitnegcl.2 | . . . . . . 7 ⊢ 𝑁 = (invg‘𝑅) | |
7 | 3, 6 | grpinvcl 18143 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
8 | 2, 5, 7 | syl2an 598 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
9 | eqid 2798 | . . . . . 6 ⊢ (∥r‘𝑅) = (∥r‘𝑅) | |
10 | 3, 9, 6 | dvdsrneg 19400 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
11 | 8, 10 | syldan 594 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
12 | 3, 6 | grpinvinv 18158 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
13 | 2, 5, 12 | syl2an 598 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
14 | 11, 13 | breqtrd 5056 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)𝑋) |
15 | simpr 488 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ 𝑈) | |
16 | eqid 2798 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
17 | eqid 2798 | . . . . . 6 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
18 | eqid 2798 | . . . . . 6 ⊢ (∥r‘(oppr‘𝑅)) = (∥r‘(oppr‘𝑅)) | |
19 | 4, 16, 9, 17, 18 | isunit 19403 | . . . . 5 ⊢ (𝑋 ∈ 𝑈 ↔ (𝑋(∥r‘𝑅)(1r‘𝑅) ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
20 | 15, 19 | sylib 221 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑋(∥r‘𝑅)(1r‘𝑅) ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
21 | 20 | simpld 498 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋(∥r‘𝑅)(1r‘𝑅)) |
22 | 3, 9 | dvdsrtr 19398 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋)(∥r‘𝑅)𝑋 ∧ 𝑋(∥r‘𝑅)(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
23 | 1, 14, 21, 22 | syl3anc 1368 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
24 | 17 | opprring 19377 | . . . 4 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring) |
25 | 24 | adantr 484 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (oppr‘𝑅) ∈ Ring) |
26 | 17, 3 | opprbas 19375 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘(oppr‘𝑅)) |
27 | 17, 6 | opprneg 19381 | . . . . . 6 ⊢ 𝑁 = (invg‘(oppr‘𝑅)) |
28 | 26, 18, 27 | dvdsrneg 19400 | . . . . 5 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
29 | 25, 8, 28 | syl2anc 587 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
30 | 29, 13 | breqtrd 5056 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋) |
31 | 20 | simprd 499 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
32 | 26, 18 | dvdsrtr 19398 | . . 3 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋 ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
33 | 25, 30, 31, 32 | syl3anc 1368 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
34 | 4, 16, 9, 17, 18 | isunit 19403 | . 2 ⊢ ((𝑁‘𝑋) ∈ 𝑈 ↔ ((𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅) ∧ (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
35 | 23, 33, 34 | sylanbrc 586 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 class class class wbr 5030 ‘cfv 6324 Basecbs 16475 Grpcgrp 18095 invgcminusg 18096 1rcur 19244 Ringcrg 19290 opprcoppr 19368 ∥rcdsr 19384 Unitcui 19385 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-tpos 7875 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-plusg 16570 df-mulr 16571 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-minusg 18099 df-mgp 19233 df-ur 19245 df-ring 19292 df-oppr 19369 df-dvdsr 19387 df-unit 19388 |
This theorem is referenced by: irredneg 19456 deg1invg 24707 nzrneg1ne0 44493 invginvrid 44769 lincresunit3lem3 44883 lincresunitlem1 44884 |
Copyright terms: Public domain | W3C validator |