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

Theorem subrginv 14486
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 14475 . . . . 5 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
21adantr 276 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑅 ∈ Ring)
3 subrginv.1 . . . . . . . 8 𝑆 = (𝑅s 𝐴)
43subrgbas 14479 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
5 eqid 2234 . . . . . . . 8 (Base‘𝑅) = (Base‘𝑅)
65subrgss 14471 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
74, 6eqsstrrd 3279 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑆) ⊆ (Base‘𝑅))
87adantr 276 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (Base‘𝑆) ⊆ (Base‘𝑅))
93subrgring 14473 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
10 subrginv.3 . . . . . . 7 𝑈 = (Unit‘𝑆)
11 subrginv.4 . . . . . . 7 𝐽 = (invr𝑆)
12 eqid 2234 . . . . . . 7 (Base‘𝑆) = (Base‘𝑆)
1310, 11, 12ringinvcl 14373 . . . . . 6 ((𝑆 ∈ Ring ∧ 𝑋𝑈) → (𝐽𝑋) ∈ (Base‘𝑆))
149, 13sylan 283 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐽𝑋) ∈ (Base‘𝑆))
158, 14sseldd 3243 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐽𝑋) ∈ (Base‘𝑅))
16 eqidd 2235 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (Base‘𝑆) = (Base‘𝑆))
1710a1i 9 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑈 = (Unit‘𝑆))
189adantr 276 . . . . . . 7 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑆 ∈ Ring)
19 ringsrg 14293 . . . . . . 7 (𝑆 ∈ Ring → 𝑆 ∈ SRing)
2018, 19syl 14 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑆 ∈ SRing)
21 simpr 110 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋𝑈)
2216, 17, 20, 21unitcld 14356 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋 ∈ (Base‘𝑆))
238, 22sseldd 3243 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋 ∈ (Base‘𝑅))
24 eqid 2234 . . . . . . 7 (Unit‘𝑅) = (Unit‘𝑅)
253, 24, 10subrguss 14485 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅))
2625sselda 3242 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → 𝑋 ∈ (Unit‘𝑅))
27 subrginv.2 . . . . . 6 𝐼 = (invr𝑅)
2824, 27, 5ringinvcl 14373 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝐼𝑋) ∈ (Base‘𝑅))
291, 26, 28syl2an2r 599 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐼𝑋) ∈ (Base‘𝑅))
30 eqid 2234 . . . . 5 (.r𝑅) = (.r𝑅)
315, 30ringass 14262 . . . 4 ((𝑅 ∈ Ring ∧ ((𝐽𝑋) ∈ (Base‘𝑅) ∧ 𝑋 ∈ (Base‘𝑅) ∧ (𝐼𝑋) ∈ (Base‘𝑅))) → (((𝐽𝑋)(.r𝑅)𝑋)(.r𝑅)(𝐼𝑋)) = ((𝐽𝑋)(.r𝑅)(𝑋(.r𝑅)(𝐼𝑋))))
322, 15, 23, 29, 31syl13anc 1276 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (((𝐽𝑋)(.r𝑅)𝑋)(.r𝑅)(𝐼𝑋)) = ((𝐽𝑋)(.r𝑅)(𝑋(.r𝑅)(𝐼𝑋))))
33 eqid 2234 . . . . . . 7 (.r𝑆) = (.r𝑆)
34 eqid 2234 . . . . . . 7 (1r𝑆) = (1r𝑆)
3510, 11, 33, 34unitlinv 14374 . . . . . 6 ((𝑆 ∈ Ring ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑆)𝑋) = (1r𝑆))
369, 35sylan 283 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑆)𝑋) = (1r𝑆))
373, 30ressmulrg 13445 . . . . . . . 8 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r𝑅) = (.r𝑆))
381, 37mpdan 421 . . . . . . 7 (𝐴 ∈ (SubRing‘𝑅) → (.r𝑅) = (.r𝑆))
3938adantr 276 . . . . . 6 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (.r𝑅) = (.r𝑆))
4039oveqd 6075 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)𝑋) = ((𝐽𝑋)(.r𝑆)𝑋))
41 eqid 2234 . . . . . . 7 (1r𝑅) = (1r𝑅)
423, 41subrg1 14480 . . . . . 6 (𝐴 ∈ (SubRing‘𝑅) → (1r𝑅) = (1r𝑆))
4342adantr 276 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (1r𝑅) = (1r𝑆))
4436, 40, 433eqtr4d 2277 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)𝑋) = (1r𝑅))
4544oveq1d 6073 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (((𝐽𝑋)(.r𝑅)𝑋)(.r𝑅)(𝐼𝑋)) = ((1r𝑅)(.r𝑅)(𝐼𝑋)))
4624, 27, 30, 41unitrinv 14375 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
471, 26, 46syl2an2r 599 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝑋(.r𝑅)(𝐼𝑋)) = (1r𝑅))
4847oveq2d 6074 . . 3 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)(𝑋(.r𝑅)(𝐼𝑋))) = ((𝐽𝑋)(.r𝑅)(1r𝑅)))
4932, 45, 483eqtr3d 2275 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((1r𝑅)(.r𝑅)(𝐼𝑋)) = ((𝐽𝑋)(.r𝑅)(1r𝑅)))
505, 30, 41ringlidm 14269 . . 3 ((𝑅 ∈ Ring ∧ (𝐼𝑋) ∈ (Base‘𝑅)) → ((1r𝑅)(.r𝑅)(𝐼𝑋)) = (𝐼𝑋))
511, 29, 50syl2an2r 599 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((1r𝑅)(.r𝑅)(𝐼𝑋)) = (𝐼𝑋))
525, 30, 41ringridm 14270 . . 3 ((𝑅 ∈ Ring ∧ (𝐽𝑋) ∈ (Base‘𝑅)) → ((𝐽𝑋)(.r𝑅)(1r𝑅)) = (𝐽𝑋))
531, 15, 52syl2an2r 599 . 2 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → ((𝐽𝑋)(.r𝑅)(1r𝑅)) = (𝐽𝑋))
5449, 51, 533eqtr3d 2275 1 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋𝑈) → (𝐼𝑋) = (𝐽𝑋))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2205  wss 3214  cfv 5357  (class class class)co 6058  Basecbs 13299  s cress 13300  .rcmulr 13378  1rcur 14205  SRingcsrg 14209  Ringcrg 14242  Unitcui 14334  invrcinvr 14368  SubRingcsubrg 14466
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-lttrn 8257  ax-pre-ltadd 8259
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-tpos 6489  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9258  df-2 9316  df-3 9317  df-ndx 13302  df-slot 13303  df-base 13305  df-sets 13306  df-iress 13307  df-plusg 13390  df-mulr 13391  df-0g 13558  df-mgm 13622  df-sgrp 13668  df-mnd 13681  df-grp 13761  df-minusg 13762  df-subg 13926  df-cmn 14042  df-abl 14043  df-mgp 14163  df-ur 14206  df-srg 14210  df-ring 14244  df-oppr 14314  df-dvdsr 14336  df-unit 14337  df-invr 14369  df-subrg 14468
This theorem is referenced by:  subrgdv  14487  subrgunit  14488  subrgugrp  14489
  Copyright terms: Public domain W3C validator