Theorem subrgunit 20535

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 20532	. . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ 𝑈)
5	4	sselda 3935	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝑈)
6		eqid 2737	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
7	6, 3	unitcl 20323	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ (Base‘𝑆))
8	7	adantl 481	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ (Base‘𝑆))
9	1	subrgbas 20526	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
10	9	adantr 480	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝐴 = (Base‘𝑆))
11	8, 10	eleqtrrd 2840	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝐴)
12	1	subrgring 20519	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
13		eqid 2737	. . . . . 6 ⊢ (invr‘𝑆) = (invr‘𝑆)
14	3, 13, 6	ringinvcl 20340	. . . . 5 ⊢ ((𝑆 ∈ Ring ∧ 𝑋 ∈ 𝑉) → ((invr‘𝑆)‘𝑋) ∈ (Base‘𝑆))
15	12, 14	sylan 581	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → ((invr‘𝑆)‘𝑋) ∈ (Base‘𝑆))
16		subrgunit.4	. . . . 5 ⊢ 𝐼 = (invr‘𝑅)
17	1, 16, 3, 13	subrginv 20533	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) = ((invr‘𝑆)‘𝑋))
18	15, 17, 10	3eltr4d 2852	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) ∈ 𝐴)
19	5, 11, 18	3jca 1129	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝑉) → (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴))
20		simpr2 1197	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝐴)
21	9	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝐴 = (Base‘𝑆))
22	20, 21	eleqtrd 2839	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ (Base‘𝑆))
23		simpr3 1198	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝐼‘𝑋) ∈ 𝐴)
24	23, 21	eleqtrd 2839	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝐼‘𝑋) ∈ (Base‘𝑆))
25		eqid 2737	. . . . . 6 ⊢ (∥r‘𝑆) = (∥r‘𝑆)
26		eqid 2737	. . . . . 6 ⊢ (.r‘𝑆) = (.r‘𝑆)
27	6, 25, 26	dvdsrmul 20312	. . . . 5 ⊢ ((𝑋 ∈ (Base‘𝑆) ∧ (𝐼‘𝑋) ∈ (Base‘𝑆)) → 𝑋(∥r‘𝑆)((𝐼‘𝑋)(.r‘𝑆)𝑋))
28	22, 24, 27	syl2anc 585	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘𝑆)((𝐼‘𝑋)(.r‘𝑆)𝑋))
29		subrgrcl 20521	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
30	29	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑅 ∈ Ring)
31		simpr1 1196	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝑈)
32		eqid 2737	. . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅)
33		eqid 2737	. . . . . . 7 ⊢ (1r‘𝑅) = (1r‘𝑅)
34	2, 16, 32, 33	unitlinv 20341	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
35	30, 31, 34	syl2anc 585	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = (1r‘𝑅))
36	1, 32	ressmulr 17239	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
37	36	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (.r‘𝑅) = (.r‘𝑆))
38	37	oveqd 7385	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑅)𝑋) = ((𝐼‘𝑋)(.r‘𝑆)𝑋))
39	1, 33	subrg1 20527	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑆))
40	39	adantr 480	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (1r‘𝑅) = (1r‘𝑆))
41	35, 38, 40	3eqtr3d 2780	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘𝑆)𝑋) = (1r‘𝑆))
42	28, 41	breqtrd 5126	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘𝑆)(1r‘𝑆))
43		eqid 2737	. . . . . . 7 ⊢ (oppr‘𝑆) = (oppr‘𝑆)
44	43, 6	opprbas 20291	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘(oppr‘𝑆))
45		eqid 2737	. . . . . 6 ⊢ (∥r‘(oppr‘𝑆)) = (∥r‘(oppr‘𝑆))
46		eqid 2737	. . . . . 6 ⊢ (.r‘(oppr‘𝑆)) = (.r‘(oppr‘𝑆))
47	44, 45, 46	dvdsrmul 20312	. . . . 5 ⊢ ((𝑋 ∈ (Base‘𝑆) ∧ (𝐼‘𝑋) ∈ (Base‘𝑆)) → 𝑋(∥r‘(oppr‘𝑆))((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋))
48	22, 24, 47	syl2anc 585	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr‘𝑆))((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋))
49	6, 26, 43, 46	opprmul 20288	. . . . 5 ⊢ ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (𝑋(.r‘𝑆)(𝐼‘𝑋))
50	2, 16, 32, 33	unitrinv 20342	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝑈) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
51	30, 31, 50	syl2anc 585	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅))
52	37	oveqd 7385	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (𝑋(.r‘𝑆)(𝐼‘𝑋)))
53	51, 52, 40	3eqtr3d 2780	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → (𝑋(.r‘𝑆)(𝐼‘𝑋)) = (1r‘𝑆))
54	49, 53	eqtrid 2784	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → ((𝐼‘𝑋)(.r‘(oppr‘𝑆))𝑋) = (1r‘𝑆))
55	48, 54	breqtrd 5126	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋(∥r‘(oppr‘𝑆))(1r‘𝑆))
56		eqid 2737	. . . 4 ⊢ (1r‘𝑆) = (1r‘𝑆)
57	3, 56, 25, 43, 45	isunit 20321	. . 3 ⊢ (𝑋 ∈ 𝑉 ↔ (𝑋(∥r‘𝑆)(1r‘𝑆) ∧ 𝑋(∥r‘(oppr‘𝑆))(1r‘𝑆)))
58	42, 55, 57	sylanbrc 584	. 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)) → 𝑋 ∈ 𝑉)
59	19, 58	impbida 801	1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑋 ∈ 𝑉 ↔ (𝑋 ∈ 𝑈 ∧ 𝑋 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐴)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   class class class wbr 5100  ‘cfv 6500  (class class class)co 7368  Basecbs 17148   ↾_s cress 17169  ._rcmulr 17190  1_rcur 20128  Ringcrg 20180  opp_rcoppr 20284  ∥_rcdsr 20302  Unitcui 20303  inv_rcinvr 20335  SubRingcsubrg 20514

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-2nd 7944  df-tpos 8178  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-2 12220  df-3 12221  df-sets 17103  df-slot 17121  df-ndx 17133  df-base 17149  df-ress 17170  df-plusg 17202  df-mulr 17203  df-0g 17373  df-mgm 18577  df-sgrp 18656  df-mnd 18672  df-grp 18878  df-minusg 18879  df-subg 19065  df-cmn 19723  df-abl 19724  df-mgp 20088  df-rng 20100  df-ur 20129  df-ring 20182  df-oppr 20285  df-dvdsr 20305  df-unit 20306  df-invr 20336  df-subrg 20515

This theorem is referenced by:  issubdrg  20725  gzrngunit  21400  zringunit  21433  cphreccllem  25146