ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  subrginv GIF version

Theorem subrginv 14275
Description: A subring always has the same inversion function, for elements that are invertible. (Contributed by Mario Carneiro, 4-Dec-2014.)
Hypotheses
Ref Expression
subrginv.1 𝑆 = (𝑅s 𝐴)
subrginv.2 𝐼 = (invr𝑅)
subrginv.3 𝑈 = (Unit‘𝑆)
subrginv.4 𝐽 = (invr𝑆)
Assertion
Ref Expression
subrginv ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐼𝑋) = (𝐽𝑋))

Proof of Theorem subrginv
StepHypRef Expression
1 subrgrcl 14264 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
21adantr 276 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑅 ∈ Ring)
3 subrginv.1 . . . . . . . 8 𝑆 = (𝑅s 𝐴)
43subrgbas 14268 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
5 eqid 2230 . . . . . . . 8 (Base‘𝑅) = (Base‘𝑅)
65subrgss 14260 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
74, 6eqsstrrd 3263 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑆) ⊆ (Base‘𝑅))
87adantr 276 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (Base‘𝑆) ⊆ (Base‘𝑅))
93subrgring 14262 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
10 subrginv.3 . . . . . . 7 𝑈 = (Unit‘𝑆)
11 subrginv.4 . . . . . . 7 𝐽 = (invr𝑆)
12 eqid 2230 . . . . . . 7 (Base‘𝑆) = (Base‘𝑆)
1310, 11, 12ringinvcl 14163 . . . . . 6 ((𝑆 ∈ Ring ∧ 𝑋𝑈) → (𝐽𝑋) ∈ (Base‘𝑆))
149, 13sylan 283 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐽𝑋) ∈ (Base‘𝑆))
158, 14sseldd 3227 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐽𝑋) ∈ (Base‘𝑅))
16 eqidd 2231 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (Base‘𝑆) = (Base‘𝑆))
1710a1i 9 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑈 = (Unit‘𝑆))
189adantr 276 . . . . . . 7 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑆 ∈ Ring)
19 ringsrg 14084 . . . . . . 7 (𝑆 ∈ Ring → 𝑆 ∈ SRing)
2018, 19syl 14 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑆 ∈ SRing)
21 simpr 110 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋𝑈)
2216, 17, 20, 21unitcld 14146 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋 ∈ (Base‘𝑆))
238, 22sseldd 3227 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋 ∈ (Base‘𝑅))
24 eqid 2230 . . . . . . 7 (Unit‘𝑅) = (Unit‘𝑅)
253, 24, 10subrguss 14274 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅))
2625sselda 3226 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋 ∈ (Unit‘𝑅))
27 subrginv.2 . . . . . 6 𝐼 = (invr𝑅)
2824, 27, 5ringinvcl 14163 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝐼𝑋) ∈ (Base‘𝑅))
291, 26, 28syl2an2r 599 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐼𝑋) ∈ (Base‘𝑅))
30 eqid 2230 . . . . 5 (.r𝑅) = (.r𝑅)
315, 30ringass 14053 . . . 4 ((𝑅 ∈ Ring ∧ ((𝐽𝑋) ∈ (Base‘𝑅) ∧ 𝑋 ∈ (Base‘𝑅) ∧ (𝐼𝑋) ∈ (Base‘𝑅))) → (((𝐽𝑋)(.r𝑅)𝑋)(.r𝑅)(𝐼𝑋)) = ((𝐽𝑋)(.r𝑅)(𝑋(.r𝑅)(𝐼𝑋))))
322, 15, 23, 29, 31syl13anc 1275 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (((𝐽𝑋)(.r𝑅)𝑋)(.r𝑅)(𝐼𝑋)) = ((𝐽𝑋)(.r𝑅)(𝑋(.r𝑅)(𝐼𝑋))))
33 eqid 2230 . . . . . . 7 (.r𝑆) = (.r𝑆)
34 eqid 2230 . . . . . . 7 (1r𝑆) = (1r𝑆)
3510, 11, 33, 34unitlinv 14164 . . . . . 6 ((𝑆 ∈ Ring ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑆)𝑋) = (1r𝑆))
369, 35sylan 283 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑆)𝑋) = (1r𝑆))
373, 30ressmulrg 13251 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
381, 37mpdan 421 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
3938adantr 276 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (.r𝑅) = (.r𝑆))
4039oveqd 6040 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)𝑋) = ((𝐽𝑋)(.r𝑆)𝑋))
41 eqid 2230 . . . . . . 7 (1r𝑅) = (1r𝑅)
423, 41subrg1 14269 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (1r𝑅) = (1r𝑆))
4342adantr 276 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (1r𝑅) = (1r𝑆))
4436, 40, 433eqtr4d 2273 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)𝑋) = (1r𝑅))
4544oveq1d 6038 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (((𝐽𝑋)(.r𝑅)𝑋)(.r𝑅)(𝐼𝑋)) = ((1r𝑅)(.r𝑅)(𝐼𝑋)))
4624, 27, 30, 41unitrinv 14165 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
471, 26, 46syl2an2r 599 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
4847oveq2d 6039 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)(𝑋(.r𝑅)(𝐼𝑋))) = ((𝐽𝑋)(.r𝑅)(1r𝑅)))
4932, 45, 483eqtr3d 2271 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((1r𝑅)(.r𝑅)(𝐼𝑋)) = ((𝐽𝑋)(.r𝑅)(1r𝑅)))
505, 30, 41ringlidm 14060 . . 3 ((𝑅 ∈ Ring ∧ (𝐼𝑋) ∈ (Base‘𝑅)) → ((1r𝑅)(.r𝑅)(𝐼𝑋)) = (𝐼𝑋))
511, 29, 50syl2an2r 599 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((1r𝑅)(.r𝑅)(𝐼𝑋)) = (𝐼𝑋))
525, 30, 41ringridm 14061 . . 3 ((𝑅 ∈ Ring ∧ (𝐽𝑋) ∈ (Base‘𝑅)) → ((𝐽𝑋)(.r𝑅)(1r𝑅)) = (𝐽𝑋))
531, 15, 52syl2an2r 599 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)(1r𝑅)) = (𝐽𝑋))
5449, 51, 533eqtr3d 2271 1 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐼𝑋) = (𝐽𝑋))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2201  wss 3199  cfv 5328  (class class class)co 6023  Basecbs 13105  s cress 13106  .rcmulr 13184  1rcur 13996  SRingcsrg 14000  Ringcrg 14033  Unitcui 14124  invrcinvr 14158  SubRingcsubrg 14255
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-addcom 8137  ax-addass 8139  ax-i2m1 8142  ax-0lt1 8143  ax-0id 8145  ax-rnegex 8146  ax-pre-ltirr 8149  ax-pre-lttrn 8151  ax-pre-ltadd 8153
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-reu 2516  df-rmo 2517  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-tpos 6416  df-pnf 8221  df-mnf 8222  df-ltxr 8224  df-inn 9149  df-2 9207  df-3 9208  df-ndx 13108  df-slot 13109  df-base 13111  df-sets 13112  df-iress 13113  df-plusg 13196  df-mulr 13197  df-0g 13364  df-mgm 13462  df-sgrp 13508  df-mnd 13523  df-grp 13609  df-minusg 13610  df-subg 13780  df-cmn 13896  df-abl 13897  df-mgp 13958  df-ur 13997  df-srg 14001  df-ring 14035  df-oppr 14105  df-dvdsr 14126  df-unit 14127  df-invr 14159  df-subrg 14257
This theorem is referenced by:  subrgdv  14276  subrgunit  14277  subrgugrp  14278
  Copyright terms: Public domain W3C validator