Theorem subrginv 14653

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 14642	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
2	1	adantr 276	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑅 ∈ Ring)
3		subrginv.1	. . . . . . . 8 ⊢ 𝑆 = (𝑅 ↾s 𝐴)
4	3	subrgbas 14646	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
5		eqid 2238	. . . . . . . 8 ⊢ (Base‘𝑅) = (Base‘𝑅)
6	5	subrgss 14638	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
7	4, 6	eqsstrrd 3285	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑆) ⊆ (Base‘𝑅))
8	7	adantr 276	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (Base‘𝑆) ⊆ (Base‘𝑅))
9	3	subrgring 14640	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
10		subrginv.3	. . . . . . 7 ⊢ 𝑈 = (Unit‘𝑆)
11		subrginv.4	. . . . . . 7 ⊢ 𝐽 = (invr‘𝑆)
12		eqid 2238	. . . . . . 7 ⊢ (Base‘𝑆) = (Base‘𝑆)
13	10, 11, 12	ringinvcl 14540	. . . . . 6 ⊢ ((𝑆 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝐽‘𝑋) ∈ (Base‘𝑆))
14	9, 13	sylan 283	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝐽‘𝑋) ∈ (Base‘𝑆))
15	8, 14	sseldd 3249	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝐽‘𝑋) ∈ (Base‘𝑅))
16		eqidd 2239	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (Base‘𝑆) = (Base‘𝑆))
17	10	a1i 9	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑈 = (Unit‘𝑆))
18	9	adantr 276	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑆 ∈ Ring)
19		ringsrg 14458	. . . . . . 7 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ SRing)
20	18, 19	syl 14	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑆 ∈ SRing)
21		simpr 110	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ 𝑈)
22	16, 17, 20, 21	unitcld 14523	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (Base‘𝑆))
23	8, 22	sseldd 3249	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (Base‘𝑅))
24		eqid 2238	. . . . . . 7 ⊢ (Unit‘𝑅) = (Unit‘𝑅)
25	3, 24, 10	subrguss 14652	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅))
26	25	sselda 3248	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (Unit‘𝑅))
27		subrginv.2	. . . . . 6 ⊢ 𝐼 = (invr‘𝑅)
28	24, 27, 5	ringinvcl 14540	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝐼‘𝑋) ∈ (Base‘𝑅))
29	1, 26, 28	syl2an2r 603	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝐼‘𝑋) ∈ (Base‘𝑅))
30		eqid 2238	. . . . 5 ⊢ (.r‘𝑅) = (.r‘𝑅)
31	5, 30	ringass 14426	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ ((𝐽‘𝑋) ∈ (Base‘𝑅) ∧ 𝑋 ∈ (Base‘𝑅) ∧ (𝐼‘𝑋) ∈ (Base‘𝑅))) → (((𝐽‘𝑋)(.r‘𝑅)𝑋)(.r‘𝑅)(𝐼‘𝑋)) = ((𝐽‘𝑋)(.r‘𝑅)(𝑋(.r‘𝑅)(𝐼‘𝑋))))
32	2, 15, 23, 29, 31	syl13anc 1280	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (((𝐽‘𝑋)(.r‘𝑅)𝑋)(.r‘𝑅)(𝐼‘𝑋)) = ((𝐽‘𝑋)(.r‘𝑅)(𝑋(.r‘𝑅)(𝐼‘𝑋))))
33		eqid 2238	. . . . . . 7 ⊢ (.r‘𝑆) = (.r‘𝑆)
34		eqid 2238	. . . . . . 7 ⊢ (1r‘𝑆) = (1r‘𝑆)
35	10, 11, 33, 34	unitlinv 14541	. . . . . 6 ⊢ ((𝑆 ∈ Ring ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑆)𝑋) = (1r‘𝑆))
36	9, 35	sylan 283	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑆)𝑋) = (1r‘𝑆))
37	3, 30	ressmulrg 13557	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r‘𝑅) = (.r‘𝑆))
38	1, 37	mpdan 425	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
39	38	adantr 276	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (.r‘𝑅) = (.r‘𝑆))
40	39	oveqd 6105	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑅)𝑋) = ((𝐽‘𝑋)(.r‘𝑆)𝑋))
41		eqid 2238	. . . . . . 7 ⊢ (1r‘𝑅) = (1r‘𝑅)
42	3, 41	subrg1 14647	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑆))
43	42	adantr 276	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (1r‘𝑅) = (1r‘𝑆))
44	36, 40, 43	3eqtr4d 2281	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
45	44	oveq1d 6103	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (((𝐽‘𝑋)(.r‘𝑅)𝑋)(.r‘𝑅)(𝐼‘𝑋)) = ((1r‘𝑅)(.r‘𝑅)(𝐼‘𝑋)))
46	24, 27, 30, 41	unitrinv 14542	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ (Unit‘𝑅)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
47	1, 26, 46	syl2an2r 603	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
48	47	oveq2d 6104	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑅)(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐽‘𝑋)(.r‘𝑅)(1r‘𝑅)))
49	32, 45, 48	3eqtr3d 2279	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((1r‘𝑅)(.r‘𝑅)(𝐼‘𝑋)) = ((𝐽‘𝑋)(.r‘𝑅)(1r‘𝑅)))
50	5, 30, 41	ringlidm 14434	. . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝐼‘𝑋) ∈ (Base‘𝑅)) → ((1r‘𝑅)(.r‘𝑅)(𝐼‘𝑋)) = (𝐼‘𝑋))
51	1, 29, 50	syl2an2r 603	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((1r‘𝑅)(.r‘𝑅)(𝐼‘𝑋)) = (𝐼‘𝑋))
52	5, 30, 41	ringridm 14435	. . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝐽‘𝑋) ∈ (Base‘𝑅)) → ((𝐽‘𝑋)(.r‘𝑅)(1r‘𝑅)) = (𝐽‘𝑋))
53	1, 15, 52	syl2an2r 603	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → ((𝐽‘𝑋)(.r‘𝑅)(1r‘𝑅)) = (𝐽‘𝑋))
54	49, 51, 53	3eqtr3d 2279	1 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑈) → (𝐼‘𝑋) = (𝐽‘𝑋))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209   ⊆ wss 3220  ‘cfv 5380  (class class class)co 6088  Basecbs 13409   ↾_s cress 13410  ._rcmulr 13490  1_rcur 14368  SRingcsrg 14373  Ringcrg 14406  Unitcui 14501  inv_rcinvr 14535  SubRingcsubrg 14633

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-lttrn 8299  ax-pre-ltadd 8301

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-tpos 6521  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-ndx 13412  df-slot 13413  df-base 13415  df-sets 13416  df-iress 13417  df-plusg 13502  df-mulr 13503  df-0g 13670  df-mgm 13734  df-sgrp 13775  df-mnd 13788  df-grp 13866  df-minusg 13867  df-subg 14031  df-cmn 14178  df-abl 14179  df-mgp 14324  df-ur 14369  df-srg 14374  df-ring 14408  df-oppr 14481  df-dvdsr 14503  df-unit 14504  df-invr 14536  df-subrg 14635

This theorem is used by:  subrgdv  14654  subrgunit  14655  subrgugrp  14656