Theorem subrguss 13362

Description: A unit of a subring is a unit of the parent ring. (Contributed by Mario Carneiro, 4-Dec-2014.)

Hypotheses

Ref	Expression
subrguss.1	⊢ 𝑆 = (𝑅 ↾s 𝐴)
subrguss.2	⊢ 𝑈 = (Unit‘𝑅)
subrguss.3	⊢ 𝑉 = (Unit‘𝑆)

Assertion

Ref	Expression
subrguss	⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ 𝑈)

Proof of Theorem subrguss

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		subrguss.3	. . . . . . . . 9 ⊢ 𝑉 = (Unit‘𝑆)
2	1	a1i 9	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑉 = (Unit‘𝑆))
3		eqidd 2178	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑆) = (1r‘𝑆))
4		eqidd 2178	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘𝑆) = (∥r‘𝑆))
5		eqidd 2178	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (oppr‘𝑆) = (oppr‘𝑆))
6		eqidd 2178	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘(oppr‘𝑆)) = (∥r‘(oppr‘𝑆)))
7		subrguss.1	. . . . . . . . . 10 ⊢ 𝑆 = (𝑅 ↾s 𝐴)
8	7	subrgring 13350	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
9		ringsrg 13229	. . . . . . . . 9 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ SRing)
10	8, 9	syl 14	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ SRing)
11	2, 3, 4, 5, 6, 10	isunitd 13280	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥 ∈ 𝑉 ↔ (𝑥(∥r‘𝑆)(1r‘𝑆) ∧ 𝑥(∥r‘(oppr‘𝑆))(1r‘𝑆))))
12	11	simprbda 383	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘𝑆)(1r‘𝑆))
13		eqid 2177	. . . . . . . 8 ⊢ (1r‘𝑅) = (1r‘𝑅)
14	7, 13	subrg1 13357	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑆))
15	14	adantr 276	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (1r‘𝑅) = (1r‘𝑆))
16	12, 15	breqtrrd 4033	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘𝑆)(1r‘𝑅))
17		eqid 2177	. . . . . . . 8 ⊢ (∥r‘𝑅) = (∥r‘𝑅)
18		eqid 2177	. . . . . . . 8 ⊢ (∥r‘𝑆) = (∥r‘𝑆)
19	7, 17, 18	subrgdvds 13361	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘𝑆) ⊆ (∥r‘𝑅))
20	19	adantr 276	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (∥r‘𝑆) ⊆ (∥r‘𝑅))
21	20	ssbrd 4048	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(∥r‘𝑆)(1r‘𝑅) → 𝑥(∥r‘𝑅)(1r‘𝑅)))
22	16, 21	mpd 13	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘𝑅)(1r‘𝑅))
23		subrgrcl 13352	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
24	23	adantr 276	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑅 ∈ Ring)
25		eqid 2177	. . . . . . . 8 ⊢ (oppr‘𝑅) = (oppr‘𝑅)
26		eqid 2177	. . . . . . . 8 ⊢ (Base‘𝑅) = (Base‘𝑅)
27	25, 26	opprbasg 13252	. . . . . . 7 ⊢ (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘(oppr‘𝑅)))
28	24, 27	syl 14	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (Base‘𝑅) = (Base‘(oppr‘𝑅)))
29		eqidd 2178	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (∥r‘(oppr‘𝑅)) = (∥r‘(oppr‘𝑅)))
30	25	opprring 13254	. . . . . . 7 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring)
31		ringsrg 13229	. . . . . . 7 ⊢ ((oppr‘𝑅) ∈ Ring → (oppr‘𝑅) ∈ SRing)
32	24, 30, 31	3syl 17	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (oppr‘𝑅) ∈ SRing)
33		eqidd 2178	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅)))
34	7	subrgbas 13356	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
35	34	adantr 276	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝐴 = (Base‘𝑆))
36	26	subrgss 13348	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
37	36	adantr 276	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝐴 ⊆ (Base‘𝑅))
38	35, 37	eqsstrrd 3194	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (Base‘𝑆) ⊆ (Base‘𝑅))
39		eqidd 2178	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (Base‘𝑆) = (Base‘𝑆))
40	1	a1i 9	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑉 = (Unit‘𝑆))
41	10	adantr 276	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑆 ∈ SRing)
42		simpr 110	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ 𝑉)
43	39, 40, 41, 42	unitcld 13282	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ (Base‘𝑆))
44	38, 43	sseldd 3158	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ (Base‘𝑅))
45		eqid 2177	. . . . . . . . 9 ⊢ (invr‘𝑆) = (invr‘𝑆)
46		eqid 2177	. . . . . . . . 9 ⊢ (Base‘𝑆) = (Base‘𝑆)
47	1, 45, 46	ringinvcl 13299	. . . . . . . 8 ⊢ ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑆))
48	8, 47	sylan 283	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑆))
49	38, 48	sseldd 3158	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑅))
50	28, 29, 32, 33, 44, 49	dvdsrmuld 13270	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘(oppr‘𝑅))(((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥))
51	1, 45	unitinvcl 13297	. . . . . . . 8 ⊢ ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ 𝑉)
52	8, 51	sylan 283	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ 𝑉)
53		eqid 2177	. . . . . . . 8 ⊢ (.r‘𝑅) = (.r‘𝑅)
54		eqid 2177	. . . . . . . 8 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅))
55	26, 53, 25, 54	opprmulg 13248	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ ((invr‘𝑆)‘𝑥) ∈ 𝑉 ∧ 𝑥 ∈ 𝑉) → (((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥) = (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)))
56	24, 52, 42, 55	syl3anc 1238	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥) = (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)))
57		eqid 2177	. . . . . . . . 9 ⊢ (.r‘𝑆) = (.r‘𝑆)
58		eqid 2177	. . . . . . . . 9 ⊢ (1r‘𝑆) = (1r‘𝑆)
59	1, 45, 57, 58	unitrinv 13301	. . . . . . . 8 ⊢ ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑆)((invr‘𝑆)‘𝑥)) = (1r‘𝑆))
60	8, 59	sylan 283	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑆)((invr‘𝑆)‘𝑥)) = (1r‘𝑆))
61	7, 53	ressmulrg 12605	. . . . . . . . . 10 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r‘𝑅) = (.r‘𝑆))
62	23, 61	mpdan 421	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
63	62	adantr 276	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (.r‘𝑅) = (.r‘𝑆))
64	63	oveqd 5894	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)) = (𝑥(.r‘𝑆)((invr‘𝑆)‘𝑥)))
65	60, 64, 15	3eqtr4d 2220	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)) = (1r‘𝑅))
66	56, 65	eqtrd 2210	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥) = (1r‘𝑅))
67	50, 66	breqtrd 4031	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘(oppr‘𝑅))(1r‘𝑅))
68		subrguss.2	. . . . . . 7 ⊢ 𝑈 = (Unit‘𝑅)
69	68	a1i 9	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Unit‘𝑅))
70		eqidd 2178	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑅))
71		eqidd 2178	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘𝑅) = (∥r‘𝑅))
72		eqidd 2178	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (oppr‘𝑅) = (oppr‘𝑅))
73		eqidd 2178	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘(oppr‘𝑅)) = (∥r‘(oppr‘𝑅)))
74		ringsrg 13229	. . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing)
75	23, 74	syl 14	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ SRing)
76	69, 70, 71, 72, 73, 75	isunitd 13280	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥 ∈ 𝑈 ↔ (𝑥(∥r‘𝑅)(1r‘𝑅) ∧ 𝑥(∥r‘(oppr‘𝑅))(1r‘𝑅))))
77	76	adantr 276	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥 ∈ 𝑈 ↔ (𝑥(∥r‘𝑅)(1r‘𝑅) ∧ 𝑥(∥r‘(oppr‘𝑅))(1r‘𝑅))))
78	22, 67, 77	mpbir2and 944	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ 𝑈)
79	78	ex 115	. 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥 ∈ 𝑉 → 𝑥 ∈ 𝑈))
80	79	ssrdv 3163	1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ 𝑈)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353   ∈ wcel 2148   ⊆ wss 3131   class class class wbr 4005  ‘cfv 5218  (class class class)co 5877  Basecbs 12464   ↾_s cress 12465  ._rcmulr 12539  1_rcur 13147  SRingcsrg 13151  Ringcrg 13184  opp_rcoppr 13244  ∥_rcdsr 13260  Unitcui 13261  inv_rcinvr 13294  SubRingcsubrg 13343

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-addcom 7913  ax-addass 7915  ax-i2m1 7918  ax-0lt1 7919  ax-0id 7921  ax-rnegex 7922  ax-pre-ltirr 7925  ax-pre-lttrn 7927  ax-pre-ltadd 7929

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-tpos 6248  df-pnf 7996  df-mnf 7997  df-ltxr 7999  df-inn 8922  df-2 8980  df-3 8981  df-ndx 12467  df-slot 12468  df-base 12470  df-sets 12471  df-iress 12472  df-plusg 12551  df-mulr 12552  df-0g 12712  df-mgm 12780  df-sgrp 12813  df-mnd 12823  df-grp 12885  df-minusg 12886  df-subg 13035  df-cmn 13095  df-abl 13096  df-mgp 13136  df-ur 13148  df-srg 13152  df-ring 13186  df-oppr 13245  df-dvdsr 13263  df-unit 13264  df-invr 13295  df-subrg 13345

This theorem is referenced by:  subrginv  13363  subrgdv  13364  subrgunit  13365  subrgugrp  13366