Theorem subrguss 13732

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 2194	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑆) = (1r‘𝑆))
4		eqidd 2194	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘𝑆) = (∥r‘𝑆))
5		eqidd 2194	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (oppr‘𝑆) = (oppr‘𝑆))
6		eqidd 2194	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘(oppr‘𝑆)) = (∥r‘(oppr‘𝑆)))
7		subrguss.1	. . . . . . . . . 10 ⊢ 𝑆 = (𝑅 ↾s 𝐴)
8	7	subrgring 13720	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
9		ringsrg 13543	. . . . . . . . 9 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ SRing)
10	8, 9	syl 14	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ SRing)
11	2, 3, 4, 5, 6, 10	isunitd 13602	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥 ∈ 𝑉 ↔ (𝑥(∥r‘𝑆)(1r‘𝑆) ∧ 𝑥(∥r‘(oppr‘𝑆))(1r‘𝑆))))
12	11	simprbda 383	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘𝑆)(1r‘𝑆))
13		eqid 2193	. . . . . . . 8 ⊢ (1r‘𝑅) = (1r‘𝑅)
14	7, 13	subrg1 13727	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑆))
15	14	adantr 276	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (1r‘𝑅) = (1r‘𝑆))
16	12, 15	breqtrrd 4057	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘𝑆)(1r‘𝑅))
17		eqid 2193	. . . . . . . 8 ⊢ (∥r‘𝑅) = (∥r‘𝑅)
18		eqid 2193	. . . . . . . 8 ⊢ (∥r‘𝑆) = (∥r‘𝑆)
19	7, 17, 18	subrgdvds 13731	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘𝑆) ⊆ (∥r‘𝑅))
20	19	adantr 276	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (∥r‘𝑆) ⊆ (∥r‘𝑅))
21	20	ssbrd 4072	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(∥r‘𝑆)(1r‘𝑅) → 𝑥(∥r‘𝑅)(1r‘𝑅)))
22	16, 21	mpd 13	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘𝑅)(1r‘𝑅))
23		subrgrcl 13722	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
24	23	adantr 276	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑅 ∈ Ring)
25		eqid 2193	. . . . . . . 8 ⊢ (oppr‘𝑅) = (oppr‘𝑅)
26		eqid 2193	. . . . . . . 8 ⊢ (Base‘𝑅) = (Base‘𝑅)
27	25, 26	opprbasg 13571	. . . . . . 7 ⊢ (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘(oppr‘𝑅)))
28	24, 27	syl 14	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (Base‘𝑅) = (Base‘(oppr‘𝑅)))
29		eqidd 2194	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (∥r‘(oppr‘𝑅)) = (∥r‘(oppr‘𝑅)))
30	25	opprring 13575	. . . . . . 7 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring)
31		ringsrg 13543	. . . . . . 7 ⊢ ((oppr‘𝑅) ∈ Ring → (oppr‘𝑅) ∈ SRing)
32	24, 30, 31	3syl 17	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (oppr‘𝑅) ∈ SRing)
33		eqidd 2194	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅)))
34	7	subrgbas 13726	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
35	34	adantr 276	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝐴 = (Base‘𝑆))
36	26	subrgss 13718	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
37	36	adantr 276	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝐴 ⊆ (Base‘𝑅))
38	35, 37	eqsstrrd 3216	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (Base‘𝑆) ⊆ (Base‘𝑅))
39		eqidd 2194	. . . . . . . 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 13604	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ (Base‘𝑆))
44	38, 43	sseldd 3180	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ (Base‘𝑅))
45		eqid 2193	. . . . . . . . 9 ⊢ (invr‘𝑆) = (invr‘𝑆)
46		eqid 2193	. . . . . . . . 9 ⊢ (Base‘𝑆) = (Base‘𝑆)
47	1, 45, 46	ringinvcl 13621	. . . . . . . 8 ⊢ ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑆))
48	8, 47	sylan 283	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑆))
49	38, 48	sseldd 3180	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑅))
50	28, 29, 32, 33, 44, 49	dvdsrmuld 13592	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘(oppr‘𝑅))(((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥))
51	1, 45	unitinvcl 13619	. . . . . . . 8 ⊢ ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ 𝑉)
52	8, 51	sylan 283	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ 𝑉)
53		eqid 2193	. . . . . . . 8 ⊢ (.r‘𝑅) = (.r‘𝑅)
54		eqid 2193	. . . . . . . 8 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅))
55	26, 53, 25, 54	opprmulg 13567	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ ((invr‘𝑆)‘𝑥) ∈ 𝑉 ∧ 𝑥 ∈ 𝑉) → (((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥) = (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)))
56	24, 52, 42, 55	syl3anc 1249	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥) = (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)))
57		eqid 2193	. . . . . . . . 9 ⊢ (.r‘𝑆) = (.r‘𝑆)
58		eqid 2193	. . . . . . . . 9 ⊢ (1r‘𝑆) = (1r‘𝑆)
59	1, 45, 57, 58	unitrinv 13623	. . . . . . . 8 ⊢ ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑆)((invr‘𝑆)‘𝑥)) = (1r‘𝑆))
60	8, 59	sylan 283	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑆)((invr‘𝑆)‘𝑥)) = (1r‘𝑆))
61	7, 53	ressmulrg 12762	. . . . . . . . . 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 5935	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)) = (𝑥(.r‘𝑆)((invr‘𝑆)‘𝑥)))
65	60, 64, 15	3eqtr4d 2236	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)) = (1r‘𝑅))
66	56, 65	eqtrd 2226	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥) = (1r‘𝑅))
67	50, 66	breqtrd 4055	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘(oppr‘𝑅))(1r‘𝑅))
68		subrguss.2	. . . . . . 7 ⊢ 𝑈 = (Unit‘𝑅)
69	68	a1i 9	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑈 = (Unit‘𝑅))
70		eqidd 2194	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑅))
71		eqidd 2194	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘𝑅) = (∥r‘𝑅))
72		eqidd 2194	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (oppr‘𝑅) = (oppr‘𝑅))
73		eqidd 2194	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘(oppr‘𝑅)) = (∥r‘(oppr‘𝑅)))
74		ringsrg 13543	. . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing)
75	23, 74	syl 14	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ SRing)
76	69, 70, 71, 72, 73, 75	isunitd 13602	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥 ∈ 𝑈 ↔ (𝑥(∥r‘𝑅)(1r‘𝑅) ∧ 𝑥(∥r‘(oppr‘𝑅))(1r‘𝑅))))
77	76	adantr 276	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥 ∈ 𝑈 ↔ (𝑥(∥r‘𝑅)(1r‘𝑅) ∧ 𝑥(∥r‘(oppr‘𝑅))(1r‘𝑅))))
78	22, 67, 77	mpbir2and 946	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ 𝑈)
79	78	ex 115	. 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥 ∈ 𝑉 → 𝑥 ∈ 𝑈))
80	79	ssrdv 3185	1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ 𝑈)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2164   ⊆ wss 3153   class class class wbr 4029  ‘cfv 5254  (class class class)co 5918  Basecbs 12618   ↾_s cress 12619  ._rcmulr 12696  1_rcur 13455  SRingcsrg 13459  Ringcrg 13492  opp_rcoppr 13563  ∥_rcdsr 13582  Unitcui 13583  inv_rcinvr 13616  SubRingcsubrg 13713

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-pre-ltirr 7984  ax-pre-lttrn 7986  ax-pre-ltadd 7988

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-tpos 6298  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-inn 8983  df-2 9041  df-3 9042  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-iress 12626  df-plusg 12708  df-mulr 12709  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-grp 13075  df-minusg 13076  df-subg 13240  df-cmn 13356  df-abl 13357  df-mgp 13417  df-ur 13456  df-srg 13460  df-ring 13494  df-oppr 13564  df-dvdsr 13585  df-unit 13586  df-invr 13617  df-subrg 13715

This theorem is referenced by:  subrginv  13733  subrgdv  13734  subrgunit  13735  subrgugrp  13736