Theorem subrgunit 20822

Description: An element of a ring is a unit of a subring iff it is a unit of the parent ring and both it and its inverse are in the subring. (Contributed by Mario Carneiro, 4-Dec-2014.)

Hypotheses

Ref	Expression
subrgugrp.1	⊢ 𝑆 = (𝑅 ↾s 𝐴)
subrgugrp.2	⊢ 𝑈 = (Unit‘𝑅)
subrgugrp.3	⊢ 𝑉 = (Unit‘𝑆)
subrgunit.4	⊢ 𝐼 = (invr‘𝑅)

Assertion

Ref	Expression
subrgunit	⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑋 ∈ 𝑉 ↔ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)))

Proof of Theorem subrgunit

Step	Hyp	Ref	Expression
1		subrgugrp.1	. . . . 5 ⊢ 𝑆 = (𝑅 ↾s 𝐴)
2		subrgugrp.2	. . . . 5 ⊢ 𝑈 = (Unit‘𝑅)
3		subrgugrp.3	. . . . 5 ⊢ 𝑉 = (Unit‘𝑆)
4	1, 2, 3	subrguss 20819	. . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ 𝑈)
5	4	sselda 3931	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝑈)
6		eqid 2761	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
7	6, 3	unitcl 20585	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ (Base‘𝑆))
8	7	adantl 487	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ (Base‘𝑆))
9	1	subrgbas 20813	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
10	9	adantr 486	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝐴 = (Base‘𝑆))
11	8, 10	eleqtrrd 2864	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝐴)
12	1	subrgring 20806	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
13		eqid 2761	. . . . . 6 ⊢ (invr‘𝑆) = (invr‘𝑆)
14	3, 13, 6	ringinvcl 20602	. . . . 5 ⊢ ((𝑆 ∈ Ring ∧ 𝑋 ∈ 𝑉) → ((invr‘𝑆)‘𝑋) ∈ (Base‘𝑆))
15	12, 14	sylan 592	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → ((invr‘𝑆)‘𝑋) ∈ (Base‘𝑆))
16		subrgunit.4	. . . . 5 ⊢ 𝐼 = (invr‘𝑅)
17	1, 16, 3, 13	subrginv 20820	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) = ((invr‘𝑆)‘𝑋))
18	15, 17, 10	3eltr4d 2876	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) ∈ 𝐴)
19	5, 11, 18	3jca 1146	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴))
20		simpr2 1214	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝐴)
21	9	adantr 486	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝐴 = (Base‘𝑆))
22	20, 21	eleqtrd 2863	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ (Base‘𝑆))
23		simpr3 1215	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝐼‘𝑋) ∈ 𝐴)
24	23, 21	eleqtrd 2863	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝐼‘𝑋) ∈ (Base‘𝑆))
25		eqid 2761	. . . . . 6 ⊢ (∥r‘𝑆) = (∥r‘𝑆)
26		eqid 2761	. . . . . 6 ⊢ (.r‘𝑆) = (.r‘𝑆)
27	6, 25, 26	dvdsrmul 20574	. . . . 5 ⊢ ((𝑋 ∈ (Base‘𝑆) ∧ (𝐼‘𝑋) ∈ (Base‘𝑆)) → 𝑋(∥r‘𝑆)((𝐼‘𝑋)(.r‘𝑆)𝑋))
28	22, 24, 27	syl2anc 596	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘𝑆)((𝐼‘𝑋)(.r‘𝑆)𝑋))
29		subrgrcl 20808	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
30	29	adantr 486	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑅 ∈ Ring)
31		simpr1 1213	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝑈)
32		eqid 2761	. . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅)
33		eqid 2761	. . . . . . 7 ⊢ (1r‘𝑅) = (1r‘𝑅)
34	2, 16, 32, 33	unitlinv 20603	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
35	30, 31, 34	syl2anc 596	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
36	1, 32	ressmulr 17458	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
37	36	adantr 486	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (.r‘𝑅) = (.r‘𝑆))
38	37	oveqd 7429	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = ((𝐼‘𝑋)(.r‘𝑆)𝑋))
39	1, 33	subrg1 20814	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑆))
40	39	adantr 486	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (1r‘𝑅) = (1r‘𝑆))
41	35, 38, 40	3eqtr3d 2804	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑆)𝑋) = (1r‘𝑆))
42	28, 41	breqtrd 5131	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘𝑆)(1r‘𝑆))
43		eqid 2761	. . . . . . 7 ⊢ (oppr‘𝑆) = (oppr‘𝑆)
44	43, 6	opprbas 20553	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘(oppr‘𝑆))
45		eqid 2761	. . . . . 6 ⊢ (∥r‘(oppr‘𝑆)) = (∥r‘(oppr‘𝑆))
46		eqid 2761	. . . . . 6 ⊢ (.r‘(oppr‘𝑆)) = (.r‘(oppr‘𝑆))
47	44, 45, 46	dvdsrmul 20574	. . . . 5 ⊢ ((𝑋 ∈ (Base‘𝑆) ∧ (𝐼‘𝑋) ∈ (Base‘𝑆)) → 𝑋(∥r‘(oppr‘𝑆))((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋))
48	22, 24, 47	syl2anc 596	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr‘𝑆))((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋))
49	6, 26, 43, 46	opprmul 20550	. . . . 5 ⊢ ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (𝑋(.r‘𝑆)(𝐼‘𝑋))
50	2, 16, 32, 33	unitrinv 20604	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
51	30, 31, 50	syl2anc 596	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
52	37	oveqd 7429	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (𝑋(.r‘𝑆)(𝐼‘𝑋)))
53	51, 52, 40	3eqtr3d 2804	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑆)(𝐼‘𝑋)) = (1r‘𝑆))
54	49, 53	eqtrid 2808	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (1r‘𝑆))
55	48, 54	breqtrd 5131	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr‘𝑆))(1r‘𝑆))
56		eqid 2761	. . . 4 ⊢ (1r‘𝑆) = (1r‘𝑆)
57	3, 56, 25, 43, 45	isunit 20583	. . 3 ⊢ (𝑋 ∈ 𝑉 ↔ (𝑋(∥r‘𝑆)(1r‘𝑆) ∧ 𝑋(∥r‘(oppr‘𝑆))(1r‘𝑆)))
58	42, 55, 57	sylanbrc 595	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝑉)
59	19, 58	impbida 813	1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑋 ∈ 𝑉 ↔ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   class class class wbr 5103  ‘cfv 6531  (class class class)co 7412  Basecbs 17367   ↾_s cress 17388  ._rcmulr 17409  1_rcur 20387  Ringcrg 20439  opp_rcoppr 20546  ∥_rcdsr 20564  Unitcui 20565  inv_rcinvr 20597  SubRingcsubrg 20801

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-mulcom 11245  ax-addass 11246  ax-mulass 11247  ax-distr 11248  ax-i2m1 11249  ax-1ne0 11250  ax-1rid 11251  ax-rnegex 11252  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256  ax-pre-ltadd 11257  ax-pre-mulgt0 11258

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-2nd 7991  df-tpos 8227  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-er 8701  df-en 8958  df-dom 8959  df-sdom 8960  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11524  df-neg 11525  df-nn 12317  df-2 12386  df-3 12387  df-sets 17322  df-slot 17340  df-ndx 17352  df-base 17368  df-ress 17389  df-plusg 17421  df-mulr 17422  df-0g 17592  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-grp 19127  df-minusg 19128  df-subg 19313  df-cmn 19976  df-abl 19977  df-mgp 20341  df-rng 20355  df-ur 20388  df-ring 20441  df-oppr 20547  df-dvdsr 20567  df-unit 20568  df-invr 20598  df-subrg 20802

This theorem is used by:  issubdrg  21017  gzrngunit  21719  zringunit  21752  cphreccllem  25479