Theorem subrginv 14545

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 = ( R ↾s A )
subrginv.2	|- I = ( invr ` R )
subrginv.3	|- U = (Unit ` S )
subrginv.4	|- J = ( invr ` S )

Assertion

Ref	Expression
subrginv	|- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( I ` X ) = ( J ` X ) )

Proof of Theorem subrginv

Step	Hyp	Ref	Expression
1		subrgrcl 14534	. . . . 5 |- ( A e. (SubRing ` R ) -> R e. Ring )
2	1	adantr 276	. . . 4 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> R e. Ring )
3		subrginv.1	. . . . . . . 8 |- S = ( R ↾s A )
4	3	subrgbas 14538	. . . . . . 7 |- ( A e. (SubRing ` R ) -> A = ( Base ` S ) )
5		eqid 2238	. . . . . . . 8 |- ( Base ` R ) = ( Base ` R )
6	5	subrgss 14530	. . . . . . 7 |- ( A e. (SubRing ` R ) -> A C_ ( Base ` R ) )
7	4, 6	eqsstrrd 3285	. . . . . 6 |- ( A e. (SubRing ` R ) -> ( Base ` S ) C_ ( Base ` R ) )
8	7	adantr 276	. . . . 5 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( Base ` S ) C_ ( Base ` R ) )
9	3	subrgring 14532	. . . . . 6 |- ( A e. (SubRing ` R ) -> S e. Ring )
10		subrginv.3	. . . . . . 7 |- U = (Unit ` S )
11		subrginv.4	. . . . . . 7 |- J = ( invr ` S )
12		eqid 2238	. . . . . . 7 |- ( Base ` S ) = ( Base ` S )
13	10, 11, 12	ringinvcl 14432	. . . . . 6 |- ( ( S e. Ring /\ X e. U ) -> ( J ` X ) e. ( Base ` S ) )
14	9, 13	sylan 283	. . . . 5 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( J ` X ) e. ( Base ` S ) )
15	8, 14	sseldd 3249	. . . 4 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( J ` X ) e. ( Base ` R ) )
16		eqidd 2239	. . . . . 6 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( Base ` S ) = ( Base ` S ) )
17	10	a1i 9	. . . . . 6 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> U = (Unit ` S ) )
18	9	adantr 276	. . . . . . 7 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> S e. Ring )
19		ringsrg 14352	. . . . . . 7 |- ( S e. Ring -> S e. SRing )
20	18, 19	syl 14	. . . . . 6 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> S e. SRing )
21		simpr 110	. . . . . 6 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> X e. U )
22	16, 17, 20, 21	unitcld 14415	. . . . 5 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> X e. ( Base ` S ) )
23	8, 22	sseldd 3249	. . . 4 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> X e. ( Base ` R ) )
24		eqid 2238	. . . . . . 7 |- (Unit ` R ) = (Unit ` R )
25	3, 24, 10	subrguss 14544	. . . . . 6 |- ( A e. (SubRing ` R ) -> U C_ (Unit ` R ) )
26	25	sselda 3248	. . . . 5 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> X e. (Unit ` R ) )
27		subrginv.2	. . . . . 6 |- I = ( invr ` R )
28	24, 27, 5	ringinvcl 14432	. . . . 5 |- ( ( R e. Ring /\ X e. (Unit ` R ) ) -> ( I ` X ) e. ( Base ` R ) )
29	1, 26, 28	syl2an2r 603	. . . 4 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( I ` X ) e. ( Base ` R ) )
30		eqid 2238	. . . . 5 |- ( .r ` R ) = ( .r ` R )
31	5, 30	ringass 14320	. . . 4 |- ( ( R e. Ring /\ ( ( J ` X ) e. ( Base ` R ) /\ X e. ( Base ` R ) /\ ( I ` X ) e. ( Base ` R ) ) ) -> ( ( ( J ` X ) ( .r ` R ) X ) ( .r ` R ) ( I ` X ) ) = ( ( J ` X ) ( .r ` R ) ( X ( .r ` R ) ( I ` X ) ) ) )
32	2, 15, 23, 29, 31	syl13anc 1280	. . 3 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( ( ( J ` X ) ( .r ` R ) X ) ( .r ` R ) ( I ` X ) ) = ( ( J ` X ) ( .r ` R ) ( X ( .r ` R ) ( I ` X ) ) ) )
33		eqid 2238	. . . . . . 7 |- ( .r ` S ) = ( .r ` S )
34		eqid 2238	. . . . . . 7 |- ( 1r ` S ) = ( 1r ` S )
35	10, 11, 33, 34	unitlinv 14433	. . . . . 6 |- ( ( S e. Ring /\ X e. U ) -> ( ( J ` X ) ( .r ` S ) X ) = ( 1r ` S ) )
36	9, 35	sylan 283	. . . . 5 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( ( J ` X ) ( .r ` S ) X ) = ( 1r ` S ) )
37	3, 30	ressmulrg 13499	. . . . . . . 8 |- ( ( A e. (SubRing ` R ) /\ R e. Ring ) -> ( .r ` R ) = ( .r ` S ) )
38	1, 37	mpdan 425	. . . . . . 7 |- ( A e. (SubRing ` R ) -> ( .r ` R ) = ( .r ` S ) )
39	38	adantr 276	. . . . . 6 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( .r ` R ) = ( .r ` S ) )
40	39	oveqd 6102	. . . . 5 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( ( J ` X ) ( .r ` R ) X ) = ( ( J ` X ) ( .r ` S ) X ) )
41		eqid 2238	. . . . . . 7 |- ( 1r ` R ) = ( 1r ` R )
42	3, 41	subrg1 14539	. . . . . 6 |- ( A e. (SubRing ` R ) -> ( 1r ` R ) = ( 1r ` S ) )
43	42	adantr 276	. . . . 5 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( 1r ` R ) = ( 1r ` S ) )
44	36, 40, 43	3eqtr4d 2281	. . . 4 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( ( J ` X ) ( .r ` R ) X ) = ( 1r ` R ) )
45	44	oveq1d 6100	. . 3 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( ( ( J ` X ) ( .r ` R ) X ) ( .r ` R ) ( I ` X ) ) = ( ( 1r ` R ) ( .r ` R ) ( I ` X ) ) )
46	24, 27, 30, 41	unitrinv 14434	. . . . 5 |- ( ( R e. Ring /\ X e. (Unit ` R ) ) -> ( X ( .r ` R ) ( I ` X ) ) = ( 1r ` R ) )
47	1, 26, 46	syl2an2r 603	. . . 4 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( X ( .r ` R ) ( I ` X ) ) = ( 1r ` R ) )
48	47	oveq2d 6101	. . 3 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( ( J ` X ) ( .r ` R ) ( X ( .r ` R ) ( I ` X ) ) ) = ( ( J ` X ) ( .r ` R ) ( 1r ` R ) ) )
49	32, 45, 48	3eqtr3d 2279	. 2 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( ( 1r ` R ) ( .r ` R ) ( I ` X ) ) = ( ( J ` X ) ( .r ` R ) ( 1r ` R ) ) )
50	5, 30, 41	ringlidm 14328	. . 3 |- ( ( R e. Ring /\ ( I ` X ) e. ( Base ` R ) ) -> ( ( 1r ` R ) ( .r ` R ) ( I ` X ) ) = ( I ` X ) )
51	1, 29, 50	syl2an2r 603	. 2 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( ( 1r ` R ) ( .r ` R ) ( I ` X ) ) = ( I ` X ) )
52	5, 30, 41	ringridm 14329	. . 3 |- ( ( R e. Ring /\ ( J ` X ) e. ( Base ` R ) ) -> ( ( J ` X ) ( .r ` R ) ( 1r ` R ) ) = ( J ` X ) )
53	1, 15, 52	syl2an2r 603	. 2 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( ( J ` X ) ( .r ` R ) ( 1r ` R ) ) = ( J ` X ) )
54	49, 51, 53	3eqtr3d 2279	1 |- ( ( A e. (SubRing ` R ) /\ X e. U ) -> ( I ` X ) = ( J ` X ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   C_ wss 3220   ` cfv 5377  (class class class)co 6085   Basecbs 13352   ↾_s cress 13353   .rcmulr 13432   1rcur 14262  SRingcsrg 14267   Ringcrg 14300  Unitcui 14393   invrcinvr 14427  SubRingcsubrg 14525

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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295

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 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-tpos 6516  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  df-plusg 13444  df-mulr 13445  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-subg 13973  df-cmn 14089  df-abl 14090  df-mgp 14218  df-ur 14263  df-srg 14268  df-ring 14302  df-oppr 14373  df-dvdsr 14395  df-unit 14396  df-invr 14428  df-subrg 14527

This theorem is used by:  subrgdv  14546  subrgunit  14547  subrgugrp  14548