| 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 488 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ Ring) | |
| 2 | ringgrp 20497 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 3 | eqid 2763 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 4 | unitnegcl.1 | . . . . . . 7 ⊢ 𝑈 = (Unit‘𝑅) | |
| 5 | 3, 4 | unitcl 20638 | . . . . . 6 ⊢ (𝑋 ∈ 𝑈 → 𝑋 ∈ (Base‘𝑅)) |
| 6 | unitnegcl.2 | . . . . . . 7 ⊢ 𝑁 = (invg‘𝑅) | |
| 7 | 3, 6 | grpinvcl 19230 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
| 8 | 2, 5, 7 | syl2an 608 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ (Base‘𝑅)) |
| 9 | eqid 2763 | . . . . . 6 ⊢ (∥r‘𝑅) = (∥r‘𝑅) | |
| 10 | 3, 9, 6 | dvdsrneg 20633 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
| 11 | 8, 10 | syldan 603 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(𝑁‘(𝑁‘𝑋))) |
| 12 | 3, 6 | grpinvinv 19248 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑅)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 13 | 2, 5, 12 | syl2an 608 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 14 | 11, 13 | breqtrd 5135 | . . 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 20636 | . . . . 5 ⊢ (𝑋 ∈ 𝑈 ↔ (𝑋(∥r‘𝑅)(1r‘𝑅) ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
| 19 | 18 | bilani 510 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑋(∥r‘𝑅)(1r‘𝑅) ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
| 20 | 19 | simpld 500 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋(∥r‘𝑅)(1r‘𝑅)) |
| 21 | 3, 9 | dvdsrtr 20631 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑋)(∥r‘𝑅)𝑋 ∧ 𝑋(∥r‘𝑅)(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
| 22 | 1, 14, 20, 21 | syl3anc 1399 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅)) |
| 23 | 16 | opprring 20610 | . . . 4 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring) |
| 24 | 23 | adantr 486 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (oppr‘𝑅) ∈ Ring) |
| 25 | 16, 3 | opprbas 20606 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘(oppr‘𝑅)) |
| 26 | 16, 6 | opprneg 20614 | . . . . . 6 ⊢ 𝑁 = (invg‘(oppr‘𝑅)) |
| 27 | 25, 17, 26 | dvdsrneg 20633 | . . . . 5 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋) ∈ (Base‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
| 28 | 24, 8, 27 | syl2anc 596 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(𝑁‘(𝑁‘𝑋))) |
| 29 | 28, 13 | breqtrd 5135 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋) |
| 30 | 19 | simprd 501 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 31 | 25, 17 | dvdsrtr 20631 | . . 3 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁‘𝑋)(∥r‘(oppr‘𝑅))𝑋 ∧ 𝑋(∥r‘(oppr‘𝑅))(1r‘𝑅)) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 32 | 24, 29, 30, 31 | syl3anc 1399 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅)) |
| 33 | 4, 15, 9, 16, 17 | isunit 20636 | . 2 ⊢ ((𝑁‘𝑋) ∈ 𝑈 ↔ ((𝑁‘𝑋)(∥r‘𝑅)(1r‘𝑅) ∧ (𝑁‘𝑋)(∥r‘(oppr‘𝑅))(1r‘𝑅))) |
| 34 | 22, 32, 33 | sylanbrc 595 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑁‘𝑋) ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 class class class wbr 5106 ‘cfv 6561 Basecbs 17419 Grpcgrp 19176 invgcminusg 19177 1rcur 20440 Ringcrg 20492 opprcoppr 20599 ∥rcdsr 20617 Unitcui 20618 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-2nd 8029 df-tpos 8274 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-nn 12366 df-2 12435 df-3 12436 df-sets 17374 df-slot 17392 df-ndx 17404 df-base 17420 df-plusg 17473 df-mulr 17474 df-0g 17644 df-mgm 18848 df-sgrp 18940 df-mnd 18956 df-grp 19179 df-minusg 19180 df-cmn 20029 df-abl 20030 df-mgp 20394 df-rng 20408 df-ur 20441 df-ring 20494 df-oppr 20600 df-dvdsr 20620 df-unit 20621 |
| This theorem is used by: irredneg 20693 deg1invg 26457 nzrneg1ne0 49542 invginvrid 49694 lincresunit3lem3 49801 lincresunitlem1 49802 |
| Copyright terms: Public domain | W3C validator |