MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  subrgunit Structured version   Visualization version   GIF version

Theorem subrgunit 20506
Description: An element of a ring is a unit of a subring iff it is a unit of the parent ring and both it and its inverse are in the subring. (Contributed by Mario Carneiro, 4-Dec-2014.)
Hypotheses
Ref Expression
subrgugrp.1 𝑆 = (𝑅s 𝐴)
subrgugrp.2 𝑈 = (Unit‘𝑅)
subrgugrp.3 𝑉 = (Unit‘𝑆)
subrgunit.4 𝐼 = (invr𝑅)
Assertion
Ref Expression
subrgunit (𝐴 ∈ (SubRing‘𝑅) → (𝑋𝑉 ↔ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)))

Proof of Theorem subrgunit
StepHypRef Expression
1 subrgugrp.1 . . . . 5 𝑆 = (𝑅s 𝐴)
2 subrgugrp.2 . . . . 5 𝑈 = (Unit‘𝑅)
3 subrgugrp.3 . . . . 5 𝑉 = (Unit‘𝑆)
41, 2, 3subrguss 20503 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑉𝑈)
54sselda 3949 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → 𝑋𝑈)
6 eqid 2730 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
76, 3unitcl 20291 . . . . 5 (𝑋𝑉𝑋 ∈ (Base‘𝑆))
87adantl 481 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → 𝑋 ∈ (Base‘𝑆))
91subrgbas 20497 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
109adantr 480 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → 𝐴 = (Base‘𝑆))
118, 10eleqtrrd 2832 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → 𝑋𝐴)
121subrgring 20490 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
13 eqid 2730 . . . . . 6 (invr𝑆) = (invr𝑆)
143, 13, 6ringinvcl 20308 . . . . 5 ((𝑆 ∈ Ring ∧ 𝑋𝑉) → ((invr𝑆)‘𝑋) ∈ (Base‘𝑆))
1512, 14sylan 580 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → ((invr𝑆)‘𝑋) ∈ (Base‘𝑆))
16 subrgunit.4 . . . . 5 𝐼 = (invr𝑅)
171, 16, 3, 13subrginv 20504 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → (𝐼𝑋) = ((invr𝑆)‘𝑋))
1815, 17, 103eltr4d 2844 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → (𝐼𝑋) ∈ 𝐴)
195, 11, 183jca 1128 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴))
20 simpr2 1196 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋𝐴)
219adantr 480 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝐴 = (Base‘𝑆))
2220, 21eleqtrd 2831 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋 ∈ (Base‘𝑆))
23 simpr3 1197 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝐼𝑋) ∈ 𝐴)
2423, 21eleqtrd 2831 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝐼𝑋) ∈ (Base‘𝑆))
25 eqid 2730 . . . . . 6 (∥r𝑆) = (∥r𝑆)
26 eqid 2730 . . . . . 6 (.r𝑆) = (.r𝑆)
276, 25, 26dvdsrmul 20280 . . . . 5 ((𝑋 ∈ (Base‘𝑆) ∧ (𝐼𝑋) ∈ (Base‘𝑆)) → 𝑋(∥r𝑆)((𝐼𝑋)(.r𝑆)𝑋))
2822, 24, 27syl2anc 584 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋(∥r𝑆)((𝐼𝑋)(.r𝑆)𝑋))
29 subrgrcl 20492 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
3029adantr 480 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑅 ∈ Ring)
31 simpr1 1195 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋𝑈)
32 eqid 2730 . . . . . . 7 (.r𝑅) = (.r𝑅)
33 eqid 2730 . . . . . . 7 (1r𝑅) = (1r𝑅)
342, 16, 32, 33unitlinv 20309 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑋𝑈) → ((𝐼𝑋)(.r𝑅)𝑋) = (1r𝑅))
3530, 31, 34syl2anc 584 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → ((𝐼𝑋)(.r𝑅)𝑋) = (1r𝑅))
361, 32ressmulr 17277 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
3736adantr 480 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (.r𝑅) = (.r𝑆))
3837oveqd 7407 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → ((𝐼𝑋)(.r𝑅)𝑋) = ((𝐼𝑋)(.r𝑆)𝑋))
391, 33subrg1 20498 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (1r𝑅) = (1r𝑆))
4039adantr 480 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (1r𝑅) = (1r𝑆))
4135, 38, 403eqtr3d 2773 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → ((𝐼𝑋)(.r𝑆)𝑋) = (1r𝑆))
4228, 41breqtrd 5136 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋(∥r𝑆)(1r𝑆))
43 eqid 2730 . . . . . . 7 (oppr𝑆) = (oppr𝑆)
4443, 6opprbas 20259 . . . . . 6 (Base‘𝑆) = (Base‘(oppr𝑆))
45 eqid 2730 . . . . . 6 (∥r‘(oppr𝑆)) = (∥r‘(oppr𝑆))
46 eqid 2730 . . . . . 6 (.r‘(oppr𝑆)) = (.r‘(oppr𝑆))
4744, 45, 46dvdsrmul 20280 . . . . 5 ((𝑋 ∈ (Base‘𝑆) ∧ (𝐼𝑋) ∈ (Base‘𝑆)) → 𝑋(∥r‘(oppr𝑆))((𝐼𝑋)(.r‘(oppr𝑆))𝑋))
4822, 24, 47syl2anc 584 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr𝑆))((𝐼𝑋)(.r‘(oppr𝑆))𝑋))
496, 26, 43, 46opprmul 20256 . . . . 5 ((𝐼𝑋)(.r‘(oppr𝑆))𝑋) = (𝑋(.r𝑆)(𝐼𝑋))
502, 16, 32, 33unitrinv 20310 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑋𝑈) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
5130, 31, 50syl2anc 584 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
5237oveqd 7407 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝑋(.r𝑅)(𝐼𝑋)) = (𝑋(.r𝑆)(𝐼𝑋)))
5351, 52, 403eqtr3d 2773 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝑋(.r𝑆)(𝐼𝑋)) = (1r𝑆))
5449, 53eqtrid 2777 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → ((𝐼𝑋)(.r‘(oppr𝑆))𝑋) = (1r𝑆))
5548, 54breqtrd 5136 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr𝑆))(1r𝑆))
56 eqid 2730 . . . 4 (1r𝑆) = (1r𝑆)
573, 56, 25, 43, 45isunit 20289 . . 3 (𝑋𝑉 ↔ (𝑋(∥r𝑆)(1r𝑆) ∧ 𝑋(∥r‘(oppr𝑆))(1r𝑆)))
5842, 55, 57sylanbrc 583 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋𝑉)
5919, 58impbida 800 1 (𝐴 ∈ (SubRing‘𝑅) → (𝑋𝑉 ↔ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109   class class class wbr 5110  cfv 6514  (class class class)co 7390  Basecbs 17186  s cress 17207  .rcmulr 17228  1rcur 20097  Ringcrg 20149  opprcoppr 20252  rcdsr 20270  Unitcui 20271  invrcinvr 20303  SubRingcsubrg 20485
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-2nd 7972  df-tpos 8208  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-er 8674  df-en 8922  df-dom 8923  df-sdom 8924  df-pnf 11217  df-mnf 11218  df-xr 11219  df-ltxr 11220  df-le 11221  df-sub 11414  df-neg 11415  df-nn 12194  df-2 12256  df-3 12257  df-sets 17141  df-slot 17159  df-ndx 17171  df-base 17187  df-ress 17208  df-plusg 17240  df-mulr 17241  df-0g 17411  df-mgm 18574  df-sgrp 18653  df-mnd 18669  df-grp 18875  df-minusg 18876  df-subg 19062  df-cmn 19719  df-abl 19720  df-mgp 20057  df-rng 20069  df-ur 20098  df-ring 20151  df-oppr 20253  df-dvdsr 20273  df-unit 20274  df-invr 20304  df-subrg 20486
This theorem is referenced by:  issubdrg  20696  gzrngunit  21357  zringunit  21383  cphreccllem  25085
  Copyright terms: Public domain W3C validator