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

Theorem subrginv 13793
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 13782 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
21adantr 276 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑅 ∈ Ring)
3 subrginv.1 . . . . . . . 8 𝑆 = (𝑅s 𝐴)
43subrgbas 13786 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
5 eqid 2196 . . . . . . . 8 (Base‘𝑅) = (Base‘𝑅)
65subrgss 13778 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
74, 6eqsstrrd 3220 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑆) ⊆ (Base‘𝑅))
87adantr 276 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (Base‘𝑆) ⊆ (Base‘𝑅))
93subrgring 13780 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
10 subrginv.3 . . . . . . 7 𝑈 = (Unit‘𝑆)
11 subrginv.4 . . . . . . 7 𝐽 = (invr𝑆)
12 eqid 2196 . . . . . . 7 (Base‘𝑆) = (Base‘𝑆)
1310, 11, 12ringinvcl 13681 . . . . . 6 ((𝑆 ∈ Ring ∧ 𝑋𝑈) → (𝐽𝑋) ∈ (Base‘𝑆))
149, 13sylan 283 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐽𝑋) ∈ (Base‘𝑆))
158, 14sseldd 3184 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐽𝑋) ∈ (Base‘𝑅))
16 eqidd 2197 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (Base‘𝑆) = (Base‘𝑆))
1710a1i 9 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑈 = (Unit‘𝑆))
189adantr 276 . . . . . . 7 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑆 ∈ Ring)
19 ringsrg 13603 . . . . . . 7 (𝑆 ∈ Ring → 𝑆 ∈ SRing)
2018, 19syl 14 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑆 ∈ SRing)
21 simpr 110 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋𝑈)
2216, 17, 20, 21unitcld 13664 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋 ∈ (Base‘𝑆))
238, 22sseldd 3184 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋 ∈ (Base‘𝑅))
24 eqid 2196 . . . . . . 7 (Unit‘𝑅) = (Unit‘𝑅)
253, 24, 10subrguss 13792 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅))
2625sselda 3183 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋 ∈ (Unit‘𝑅))
27 subrginv.2 . . . . . 6 𝐼 = (invr𝑅)
2824, 27, 5ringinvcl 13681 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝐼𝑋) ∈ (Base‘𝑅))
291, 26, 28syl2an2r 595 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐼𝑋) ∈ (Base‘𝑅))
30 eqid 2196 . . . . 5 (.r𝑅) = (.r𝑅)
315, 30ringass 13572 . . . 4 ((𝑅 ∈ Ring ∧ ((𝐽𝑋) ∈ (Base‘𝑅) ∧ 𝑋 ∈ (Base‘𝑅) ∧ (𝐼𝑋) ∈ (Base‘𝑅))) → (((𝐽𝑋)(.r𝑅)𝑋)(.r𝑅)(𝐼𝑋)) = ((𝐽𝑋)(.r𝑅)(𝑋(.r𝑅)(𝐼𝑋))))
322, 15, 23, 29, 31syl13anc 1251 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (((𝐽𝑋)(.r𝑅)𝑋)(.r𝑅)(𝐼𝑋)) = ((𝐽𝑋)(.r𝑅)(𝑋(.r𝑅)(𝐼𝑋))))
33 eqid 2196 . . . . . . 7 (.r𝑆) = (.r𝑆)
34 eqid 2196 . . . . . . 7 (1r𝑆) = (1r𝑆)
3510, 11, 33, 34unitlinv 13682 . . . . . 6 ((𝑆 ∈ Ring ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑆)𝑋) = (1r𝑆))
369, 35sylan 283 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑆)𝑋) = (1r𝑆))
373, 30ressmulrg 12822 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
381, 37mpdan 421 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
3938adantr 276 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (.r𝑅) = (.r𝑆))
4039oveqd 5939 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)𝑋) = ((𝐽𝑋)(.r𝑆)𝑋))
41 eqid 2196 . . . . . . 7 (1r𝑅) = (1r𝑅)
423, 41subrg1 13787 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (1r𝑅) = (1r𝑆))
4342adantr 276 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (1r𝑅) = (1r𝑆))
4436, 40, 433eqtr4d 2239 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)𝑋) = (1r𝑅))
4544oveq1d 5937 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (((𝐽𝑋)(.r𝑅)𝑋)(.r𝑅)(𝐼𝑋)) = ((1r𝑅)(.r𝑅)(𝐼𝑋)))
4624, 27, 30, 41unitrinv 13683 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
471, 26, 46syl2an2r 595 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
4847oveq2d 5938 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)(𝑋(.r𝑅)(𝐼𝑋))) = ((𝐽𝑋)(.r𝑅)(1r𝑅)))
4932, 45, 483eqtr3d 2237 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((1r𝑅)(.r𝑅)(𝐼𝑋)) = ((𝐽𝑋)(.r𝑅)(1r𝑅)))
505, 30, 41ringlidm 13579 . . 3 ((𝑅 ∈ Ring ∧ (𝐼𝑋) ∈ (Base‘𝑅)) → ((1r𝑅)(.r𝑅)(𝐼𝑋)) = (𝐼𝑋))
511, 29, 50syl2an2r 595 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((1r𝑅)(.r𝑅)(𝐼𝑋)) = (𝐼𝑋))
525, 30, 41ringridm 13580 . . 3 ((𝑅 ∈ Ring ∧ (𝐽𝑋) ∈ (Base‘𝑅)) → ((𝐽𝑋)(.r𝑅)(1r𝑅)) = (𝐽𝑋))
531, 15, 52syl2an2r 595 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)(1r𝑅)) = (𝐽𝑋))
5449, 51, 533eqtr3d 2237 1 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐼𝑋) = (𝐽𝑋))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wcel 2167  wss 3157  cfv 5258  (class class class)co 5922  Basecbs 12678  s cress 12679  .rcmulr 12756  1rcur 13515  SRingcsrg 13519  Ringcrg 13552  Unitcui 13643  invrcinvr 13676  SubRingcsubrg 13773
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-pre-ltirr 7991  ax-pre-lttrn 7993  ax-pre-ltadd 7995
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-tpos 6303  df-pnf 8063  df-mnf 8064  df-ltxr 8066  df-inn 8991  df-2 9049  df-3 9050  df-ndx 12681  df-slot 12682  df-base 12684  df-sets 12685  df-iress 12686  df-plusg 12768  df-mulr 12769  df-0g 12929  df-mgm 12999  df-sgrp 13045  df-mnd 13058  df-grp 13135  df-minusg 13136  df-subg 13300  df-cmn 13416  df-abl 13417  df-mgp 13477  df-ur 13516  df-srg 13520  df-ring 13554  df-oppr 13624  df-dvdsr 13645  df-unit 13646  df-invr 13677  df-subrg 13775
This theorem is referenced by:  subrgdv  13794  subrgunit  13795  subrgugrp  13796
  Copyright terms: Public domain W3C validator