Theorem subrginv 13869

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

Step	Hyp	Ref	Expression
1		subrgrcl 13858	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
2	1	adantr 276	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ Ring)
3		subrginv.1	. . . . . . . 8 ⊢ 𝑆 = (𝑅 ↾s 𝐴)
4	3	subrgbas 13862	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
5		eqid 2196	. . . . . . . 8 ⊢ (Base‘𝑅) = (Base‘𝑅)
6	5	subrgss 13854	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
7	4, 6	eqsstrrd 3221	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑆) ⊆ (Base‘𝑅))
8	7	adantr 276	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (Base‘𝑆) ⊆ (Base‘𝑅))
9	3	subrgring 13856	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
10		subrginv.3	. . . . . . 7 ⊢ 𝑈 = (Unit‘𝑆)
11		subrginv.4	. . . . . . 7 ⊢ 𝐽 = (invr‘𝑆)
12		eqid 2196	. . . . . . 7 ⊢ (Base‘𝑆) = (Base‘𝑆)
13	10, 11, 12	ringinvcl 13757	. . . . . 6 ⊢ ((𝑆 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝐽‘𝑋) ∈ (Base‘𝑆))
14	9, 13	sylan 283	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝐽‘𝑋) ∈ (Base‘𝑆))
15	8, 14	sseldd 3185	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝐽‘𝑋) ∈ (Base‘𝑅))
16		eqidd 2197	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (Base‘𝑆) = (Base‘𝑆))
17	10	a1i 9	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑈 = (Unit‘𝑆))
18	9	adantr 276	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑆 ∈ Ring)
19		ringsrg 13679	. . . . . . 7 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ SRing)
20	18, 19	syl 14	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑆 ∈ SRing)
21		simpr 110	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ 𝑈)
22	16, 17, 20, 21	unitcld 13740	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (Base‘𝑆))
23	8, 22	sseldd 3185	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (Base‘𝑅))
24		eqid 2196	. . . . . . 7 ⊢ (Unit‘𝑅) = (Unit‘𝑅)
25	3, 24, 10	subrguss 13868	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅))
26	25	sselda 3184	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (Unit‘𝑅))
27		subrginv.2	. . . . . 6 ⊢ 𝐼 = (invr‘𝑅)
28	24, 27, 5	ringinvcl 13757	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝐼‘𝑋) ∈ (Base‘𝑅))
29	1, 26, 28	syl2an2r 595	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝐼‘𝑋) ∈ (Base‘𝑅))
30		eqid 2196	. . . . 5 ⊢ (.r‘𝑅) = (.r‘𝑅)
31	5, 30	ringass 13648	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ ((𝐽‘𝑋) ∈ (Base‘𝑅) ∧ 𝑋 ∈ (Base‘𝑅) ∧ (𝐼‘𝑋) ∈ (Base‘𝑅))) → (((𝐽‘𝑋)(.r‘𝑅)𝑋)(.r‘𝑅)(𝐼‘𝑋)) = ((𝐽‘𝑋)(.r‘𝑅)(𝑋(.r‘𝑅)(𝐼‘𝑋))))
32	2, 15, 23, 29, 31	syl13anc 1251	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (((𝐽‘𝑋)(.r‘𝑅)𝑋)(.r‘𝑅)(𝐼‘𝑋)) = ((𝐽‘𝑋)(.r‘𝑅)(𝑋(.r‘𝑅)(𝐼‘𝑋))))
33		eqid 2196	. . . . . . 7 ⊢ (.r‘𝑆) = (.r‘𝑆)
34		eqid 2196	. . . . . . 7 ⊢ (1r‘𝑆) = (1r‘𝑆)
35	10, 11, 33, 34	unitlinv 13758	. . . . . 6 ⊢ ((𝑆 ∈ Ring ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑆)𝑋) = (1r‘𝑆))
36	9, 35	sylan 283	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑆)𝑋) = (1r‘𝑆))
37	3, 30	ressmulrg 12847	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r‘𝑅) = (.r‘𝑆))
38	1, 37	mpdan 421	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
39	38	adantr 276	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (.r‘𝑅) = (.r‘𝑆))
40	39	oveqd 5942	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑅)𝑋) = ((𝐽‘𝑋)(.r‘𝑆)𝑋))
41		eqid 2196	. . . . . . 7 ⊢ (1r‘𝑅) = (1r‘𝑅)
42	3, 41	subrg1 13863	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑆))
43	42	adantr 276	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (1r‘𝑅) = (1r‘𝑆))
44	36, 40, 43	3eqtr4d 2239	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
45	44	oveq1d 5940	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (((𝐽‘𝑋)(.r‘𝑅)𝑋)(.r‘𝑅)(𝐼‘𝑋)) = ((1r‘𝑅)(.r‘𝑅)(𝐼‘𝑋)))
46	24, 27, 30, 41	unitrinv 13759	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
47	1, 26, 46	syl2an2r 595	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
48	47	oveq2d 5941	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑅)(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐽‘𝑋)(.r‘𝑅)(1r‘𝑅)))
49	32, 45, 48	3eqtr3d 2237	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((1r‘𝑅)(.r‘𝑅)(𝐼‘𝑋)) = ((𝐽‘𝑋)(.r‘𝑅)(1r‘𝑅)))
50	5, 30, 41	ringlidm 13655	. . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝐼‘𝑋) ∈ (Base‘𝑅)) → ((1r‘𝑅)(.r‘𝑅)(𝐼‘𝑋)) = (𝐼‘𝑋))
51	1, 29, 50	syl2an2r 595	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((1r‘𝑅)(.r‘𝑅)(𝐼‘𝑋)) = (𝐼‘𝑋))
52	5, 30, 41	ringridm 13656	. . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝐽‘𝑋) ∈ (Base‘𝑅)) → ((𝐽‘𝑋)(.r‘𝑅)(1r‘𝑅)) = (𝐽‘𝑋))
53	1, 15, 52	syl2an2r 595	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑅)(1r‘𝑅)) = (𝐽‘𝑋))
54	49, 51, 53	3eqtr3d 2237	1 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝐼‘𝑋) = (𝐽‘𝑋))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2167   ⊆ wss 3157  ‘cfv 5259  (class class class)co 5925  Basecbs 12703   ↾_s cress 12704  ._rcmulr 12781  1_rcur 13591  SRingcsrg 13595  Ringcrg 13628  Unitcui 13719  inv_rcinvr 13752  SubRingcsubrg 13849

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 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-lttrn 8010  ax-pre-ltadd 8012

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 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-tpos 6312  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-3 9067  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-iress 12711  df-plusg 12793  df-mulr 12794  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-minusg 13206  df-subg 13376  df-cmn 13492  df-abl 13493  df-mgp 13553  df-ur 13592  df-srg 13596  df-ring 13630  df-oppr 13700  df-dvdsr 13721  df-unit 13722  df-invr 13753  df-subrg 13851

This theorem is referenced by:  subrgdv  13870  subrgunit  13871  subrgugrp  13872