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

Theorem subrgunit 20618
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 20615 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑉𝑈)
54sselda 4008 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → 𝑋𝑈)
6 eqid 2740 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
76, 3unitcl 20401 . . . . 5 (𝑋𝑉𝑋 ∈ (Base‘𝑆))
87adantl 481 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → 𝑋 ∈ (Base‘𝑆))
91subrgbas 20609 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
109adantr 480 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → 𝐴 = (Base‘𝑆))
118, 10eleqtrrd 2847 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → 𝑋𝐴)
121subrgring 20602 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
13 eqid 2740 . . . . . 6 (invr𝑆) = (invr𝑆)
143, 13, 6ringinvcl 20418 . . . . 5 ((𝑆 ∈ Ring ∧ 𝑋𝑉) → ((invr𝑆)‘𝑋) ∈ (Base‘𝑆))
1512, 14sylan 579 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → ((invr𝑆)‘𝑋) ∈ (Base‘𝑆))
16 subrgunit.4 . . . . 5 𝐼 = (invr𝑅)
171, 16, 3, 13subrginv 20616 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → (𝐼𝑋) = ((invr𝑆)‘𝑋))
1815, 17, 103eltr4d 2859 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → (𝐼𝑋) ∈ 𝐴)
195, 11, 183jca 1128 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑉) → (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴))
20 simpr2 1195 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋𝐴)
219adantr 480 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝐴 = (Base‘𝑆))
2220, 21eleqtrd 2846 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋 ∈ (Base‘𝑆))
23 simpr3 1196 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝐼𝑋) ∈ 𝐴)
2423, 21eleqtrd 2846 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝐼𝑋) ∈ (Base‘𝑆))
25 eqid 2740 . . . . . 6 (∥r𝑆) = (∥r𝑆)
26 eqid 2740 . . . . . 6 (.r𝑆) = (.r𝑆)
276, 25, 26dvdsrmul 20390 . . . . 5 ((𝑋 ∈ (Base‘𝑆) ∧ (𝐼𝑋) ∈ (Base‘𝑆)) → 𝑋(∥r𝑆)((𝐼𝑋)(.r𝑆)𝑋))
2822, 24, 27syl2anc 583 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋(∥r𝑆)((𝐼𝑋)(.r𝑆)𝑋))
29 subrgrcl 20604 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
3029adantr 480 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑅 ∈ Ring)
31 simpr1 1194 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋𝑈)
32 eqid 2740 . . . . . . 7 (.r𝑅) = (.r𝑅)
33 eqid 2740 . . . . . . 7 (1r𝑅) = (1r𝑅)
342, 16, 32, 33unitlinv 20419 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑋𝑈) → ((𝐼𝑋)(.r𝑅)𝑋) = (1r𝑅))
3530, 31, 34syl2anc 583 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → ((𝐼𝑋)(.r𝑅)𝑋) = (1r𝑅))
361, 32ressmulr 17366 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
3736adantr 480 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (.r𝑅) = (.r𝑆))
3837oveqd 7465 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → ((𝐼𝑋)(.r𝑅)𝑋) = ((𝐼𝑋)(.r𝑆)𝑋))
391, 33subrg1 20610 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (1r𝑅) = (1r𝑆))
4039adantr 480 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (1r𝑅) = (1r𝑆))
4135, 38, 403eqtr3d 2788 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → ((𝐼𝑋)(.r𝑆)𝑋) = (1r𝑆))
4228, 41breqtrd 5192 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋(∥r𝑆)(1r𝑆))
43 eqid 2740 . . . . . . 7 (oppr𝑆) = (oppr𝑆)
4443, 6opprbas 20367 . . . . . 6 (Base‘𝑆) = (Base‘(oppr𝑆))
45 eqid 2740 . . . . . 6 (∥r‘(oppr𝑆)) = (∥r‘(oppr𝑆))
46 eqid 2740 . . . . . 6 (.r‘(oppr𝑆)) = (.r‘(oppr𝑆))
4744, 45, 46dvdsrmul 20390 . . . . 5 ((𝑋 ∈ (Base‘𝑆) ∧ (𝐼𝑋) ∈ (Base‘𝑆)) → 𝑋(∥r‘(oppr𝑆))((𝐼𝑋)(.r‘(oppr𝑆))𝑋))
4822, 24, 47syl2anc 583 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr𝑆))((𝐼𝑋)(.r‘(oppr𝑆))𝑋))
496, 26, 43, 46opprmul 20363 . . . . 5 ((𝐼𝑋)(.r‘(oppr𝑆))𝑋) = (𝑋(.r𝑆)(𝐼𝑋))
502, 16, 32, 33unitrinv 20420 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑋𝑈) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
5130, 31, 50syl2anc 583 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
5237oveqd 7465 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝑋(.r𝑅)(𝐼𝑋)) = (𝑋(.r𝑆)(𝐼𝑋)))
5351, 52, 403eqtr3d 2788 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → (𝑋(.r𝑆)(𝐼𝑋)) = (1r𝑆))
5449, 53eqtrid 2792 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → ((𝐼𝑋)(.r‘(oppr𝑆))𝑋) = (1r𝑆))
5548, 54breqtrd 5192 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr𝑆))(1r𝑆))
56 eqid 2740 . . . 4 (1r𝑆) = (1r𝑆)
573, 56, 25, 43, 45isunit 20399 . . 3 (𝑋𝑉 ↔ (𝑋(∥r𝑆)(1r𝑆) ∧ 𝑋(∥r‘(oppr𝑆))(1r𝑆)))
5842, 55, 57sylanbrc 582 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)) → 𝑋𝑉)
5919, 58impbida 800 1 (𝐴 ∈ (SubRing‘𝑅) → (𝑋𝑉 ↔ (𝑋𝑈𝑋𝐴 ∧ (𝐼𝑋) ∈ 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1537  wcel 2108   class class class wbr 5166  cfv 6573  (class class class)co 7448  Basecbs 17258  s cress 17287  .rcmulr 17312  1rcur 20208  Ringcrg 20260  opprcoppr 20359  rcdsr 20380  Unitcui 20381  invrcinvr 20413  SubRingcsubrg 20595
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-2nd 8031  df-tpos 8267  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-er 8763  df-en 9004  df-dom 9005  df-sdom 9006  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-nn 12294  df-2 12356  df-3 12357  df-sets 17211  df-slot 17229  df-ndx 17241  df-base 17259  df-ress 17288  df-plusg 17324  df-mulr 17325  df-0g 17501  df-mgm 18678  df-sgrp 18757  df-mnd 18773  df-grp 18976  df-minusg 18977  df-subg 19163  df-cmn 19824  df-abl 19825  df-mgp 20162  df-rng 20180  df-ur 20209  df-ring 20262  df-oppr 20360  df-dvdsr 20383  df-unit 20384  df-invr 20414  df-subrg 20597
This theorem is referenced by:  issubdrg  20803  gzrngunit  21474  zringunit  21500  cphreccllem  25231
  Copyright terms: Public domain W3C validator