| 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 20311 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 3 | eqid 2765 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 4 | unitnegcl.1 | . . . . . . 7 ⊢ 𝑈 = (Unit‘𝑅) | |
| 5 | 3, 4 | unitcl 20448 | . . . . . 6 ⊢ (𝑋 ∈ 𝑈 → 𝑋 ∈ (Base‘𝑅)) |
| 6 | unitnegcl.2 | . . . . . . 7 ⊢ 𝑁 = (invg‘𝑅) | |
| 7 | 3, 6 | grpinvcl 19044 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
| 8 | 2, 5, 7 | syl2an 607 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
| 9 | eqid 2765 | . . . . . 6 ⊢ (∥r‘𝑅) = (∥r‘𝑅) | |
| 10 | 3, 9, 6 | dvdsrneg 20443 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
| 11 | 8, 10 | syldan 602 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
| 12 | 3, 6 | grpinvinv 19062 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 13 | 2, 5, 12 | syl2an 607 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 14 | 11, 13 | breqtrd 5131 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)𝑋) |
| 15 | eqid 2765 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 16 | eqid 2765 | . . . . . 6 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
| 17 | eqid 2765 | . . . . . 6 ⊢ (∥r‘(oppr‘𝑅)) = (∥r‘(oppr‘𝑅)) | |
| 18 | 4, 15, 9, 16, 17 | isunit 20446 | . . . . 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 20441 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋)(∥r‘𝑅)𝑋 ∧ 𝑋(∥r‘𝑅)(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
| 22 | 1, 14, 20, 21 | syl3anc 1394 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
| 23 | 16 | opprring 20420 | . . . 4 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring) |
| 24 | 23 | adantr 485 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (oppr‘𝑅) ∈ Ring) |
| 25 | 16, 3 | opprbas 20416 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘(oppr‘𝑅)) |
| 26 | 16, 6 | opprneg 20424 | . . . . . 6 ⊢ 𝑁 = (invg‘(oppr‘𝑅)) |
| 27 | 25, 17, 26 | dvdsrneg 20443 | . . . . 5 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
| 28 | 24, 8, 27 | syl2anc 595 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
| 29 | 28, 13 | breqtrd 5131 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋) |
| 30 | 19 | simprd 500 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 31 | 25, 17 | dvdsrtr 20441 | . . 3 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋 ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 32 | 24, 29, 30, 31 | syl3anc 1394 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 33 | 4, 15, 9, 16, 17 | isunit 20446 | . 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 1563 ∈ wcel 2145 class class class wbr 5105 ‘cfv 6525 Basecbs 17259 Grpcgrp 18990 invgcminusg 18991 1rcur 20254 Ringcrg 20306 opprcoppr 20409 ∥rcdsr 20427 Unitcui 20428 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-2nd 7975 df-tpos 8210 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-3 12295 df-sets 17214 df-slot 17232 df-ndx 17244 df-base 17260 df-plusg 17313 df-mulr 17314 df-0g 17484 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-grp 18993 df-minusg 18994 df-cmn 19843 df-abl 19844 df-mgp 20208 df-rng 20222 df-ur 20255 df-ring 20308 df-oppr 20410 df-dvdsr 20430 df-unit 20431 |
| This theorem is referenced by: irredneg 20503 deg1invg 26224 nzrneg1ne0 48850 invginvrid 48998 lincresunit3lem3 49105 lincresunitlem1 49106 |
| Copyright terms: Public domain | W3C validator |