| 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 483 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ Ring) | |
| 2 | ringgrp 20217 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 3 | eqid 2740 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 4 | unitnegcl.1 | . . . . . . 7 ⊢ 𝑈 = (Unit‘𝑅) | |
| 5 | 3, 4 | unitcl 20353 | . . . . . 6 ⊢ (𝑋 ∈ 𝑈 → 𝑋 ∈ (Base‘𝑅)) |
| 6 | unitnegcl.2 | . . . . . . 7 ⊢ 𝑁 = (invg‘𝑅) | |
| 7 | 3, 6 | grpinvcl 18961 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
| 8 | 2, 5, 7 | syl2an 602 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
| 9 | eqid 2740 | . . . . . 6 ⊢ (∥r‘𝑅) = (∥r‘𝑅) | |
| 10 | 3, 9, 6 | dvdsrneg 20348 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
| 11 | 8, 10 | syldan 597 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
| 12 | 3, 6 | grpinvinv 18979 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 13 | 2, 5, 12 | syl2an 602 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 14 | 11, 13 | breqtrd 5105 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)𝑋) |
| 15 | eqid 2740 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 16 | eqid 2740 | . . . . . 6 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
| 17 | eqid 2740 | . . . . . 6 ⊢ (∥r‘(oppr‘𝑅)) = (∥r‘(oppr‘𝑅)) | |
| 18 | 4, 15, 9, 16, 17 | isunit 20351 | . . . . 5 ⊢ (𝑋 ∈ 𝑈 ↔ (𝑋(∥r‘𝑅)(1r‘𝑅) ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
| 19 | 18 | bilani 505 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑋(∥r‘𝑅)(1r‘𝑅) ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
| 20 | 19 | simpld 495 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋(∥r‘𝑅)(1r‘𝑅)) |
| 21 | 3, 9 | dvdsrtr 20346 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋)(∥r‘𝑅)𝑋 ∧ 𝑋(∥r‘𝑅)(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
| 22 | 1, 14, 20, 21 | syl3anc 1379 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
| 23 | 16 | opprring 20325 | . . . 4 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring) |
| 24 | 23 | adantr 481 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (oppr‘𝑅) ∈ Ring) |
| 25 | 16, 3 | opprbas 20321 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘(oppr‘𝑅)) |
| 26 | 16, 6 | opprneg 20329 | . . . . . 6 ⊢ 𝑁 = (invg‘(oppr‘𝑅)) |
| 27 | 25, 17, 26 | dvdsrneg 20348 | . . . . 5 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
| 28 | 24, 8, 27 | syl2anc 590 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
| 29 | 28, 13 | breqtrd 5105 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋) |
| 30 | 19 | simprd 496 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 31 | 25, 17 | dvdsrtr 20346 | . . 3 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋 ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 32 | 24, 29, 30, 31 | syl3anc 1379 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 33 | 4, 15, 9, 16, 17 | isunit 20351 | . 2 ⊢ ((𝑁‘𝑋) ∈ 𝑈 ↔ ((𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅) ∧ (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
| 34 | 22, 32, 33 | sylanbrc 589 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 class class class wbr 5079 ‘cfv 6492 Basecbs 17177 Grpcgrp 18907 invgcminusg 18908 1rcur 20160 Ringcrg 20212 opprcoppr 20314 ∥rcdsr 20332 Unitcui 20333 |
| 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 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 |
| 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 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-2nd 7939 df-tpos 8173 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-3 12243 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-plusg 17231 df-mulr 17232 df-0g 17402 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-grp 18910 df-minusg 18911 df-cmn 19755 df-abl 19756 df-mgp 20120 df-rng 20132 df-ur 20161 df-ring 20214 df-oppr 20315 df-dvdsr 20335 df-unit 20336 |
| This theorem is referenced by: irredneg 20408 deg1invg 26096 nzrneg1ne0 48728 invginvrid 48865 lincresunit3lem3 48972 lincresunitlem1 48973 |
| Copyright terms: Public domain | W3C validator |