Theorem subrguss 20526

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		simpr 484	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ 𝑉)
2		subrguss.3	. . . . . . . . 9 ⊢ 𝑉 = (Unit‘𝑆)
3		eqid 2728	. . . . . . . . 9 ⊢ (1r‘𝑆) = (1r‘𝑆)
4		eqid 2728	. . . . . . . . 9 ⊢ (∥r‘𝑆) = (∥r‘𝑆)
5		eqid 2728	. . . . . . . . 9 ⊢ (oppr‘𝑆) = (oppr‘𝑆)
6		eqid 2728	. . . . . . . . 9 ⊢ (∥r‘(oppr‘𝑆)) = (∥r‘(oppr‘𝑆))
7	2, 3, 4, 5, 6	isunit 20312	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑉 ↔ (𝑥(∥r‘𝑆)(1r‘𝑆) ∧ 𝑥(∥r‘(oppr‘𝑆))(1r‘𝑆)))
8	1, 7	sylib 217	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(∥r‘𝑆)(1r‘𝑆) ∧ 𝑥(∥r‘(oppr‘𝑆))(1r‘𝑆)))
9	8	simpld 494	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘𝑆)(1r‘𝑆))
10		subrguss.1	. . . . . . . 8 ⊢ 𝑆 = (𝑅 ↾s 𝐴)
11		eqid 2728	. . . . . . . 8 ⊢ (1r‘𝑅) = (1r‘𝑅)
12	10, 11	subrg1 20521	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) = (1r‘𝑆))
13	12	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (1r‘𝑅) = (1r‘𝑆))
14	9, 13	breqtrrd 5176	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘𝑆)(1r‘𝑅))
15		eqid 2728	. . . . . . . 8 ⊢ (∥r‘𝑅) = (∥r‘𝑅)
16	10, 15, 4	subrgdvds 20525	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∥r‘𝑆) ⊆ (∥r‘𝑅))
17	16	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (∥r‘𝑆) ⊆ (∥r‘𝑅))
18	17	ssbrd 5191	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(∥r‘𝑆)(1r‘𝑅) → 𝑥(∥r‘𝑅)(1r‘𝑅)))
19	14, 18	mpd 15	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘𝑅)(1r‘𝑅))
20	10	subrgbas 20520	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
21	20	adantr 480	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝐴 = (Base‘𝑆))
22		eqid 2728	. . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝑅)
23	22	subrgss 20511	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
24	23	adantr 480	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝐴 ⊆ (Base‘𝑅))
25	21, 24	eqsstrrd 4019	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (Base‘𝑆) ⊆ (Base‘𝑅))
26		eqid 2728	. . . . . . . . 9 ⊢ (Base‘𝑆) = (Base‘𝑆)
27	26, 2	unitcl 20314	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑉 → 𝑥 ∈ (Base‘𝑆))
28	27	adantl 481	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ (Base‘𝑆))
29	25, 28	sseldd 3981	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ (Base‘𝑅))
30	10	subrgring 20513	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
31		eqid 2728	. . . . . . . . 9 ⊢ (invr‘𝑆) = (invr‘𝑆)
32	2, 31, 26	ringinvcl 20331	. . . . . . . 8 ⊢ ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑆))
33	30, 32	sylan 579	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑆))
34	25, 33	sseldd 3981	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑅))
35		eqid 2728	. . . . . . . 8 ⊢ (oppr‘𝑅) = (oppr‘𝑅)
36	35, 22	opprbas 20280	. . . . . . 7 ⊢ (Base‘𝑅) = (Base‘(oppr‘𝑅))
37		eqid 2728	. . . . . . 7 ⊢ (∥r‘(oppr‘𝑅)) = (∥r‘(oppr‘𝑅))
38		eqid 2728	. . . . . . 7 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅))
39	36, 37, 38	dvdsrmul 20303	. . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝑅) ∧ ((invr‘𝑆)‘𝑥) ∈ (Base‘𝑅)) → 𝑥(∥r‘(oppr‘𝑅))(((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥))
40	29, 34, 39	syl2anc 583	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘(oppr‘𝑅))(((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥))
41		eqid 2728	. . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅)
42	22, 41, 35, 38	opprmul 20276	. . . . . 6 ⊢ (((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥) = (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥))
43		eqid 2728	. . . . . . . . 9 ⊢ (.r‘𝑆) = (.r‘𝑆)
44	2, 31, 43, 3	unitrinv 20333	. . . . . . . 8 ⊢ ((𝑆 ∈ Ring ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑆)((invr‘𝑆)‘𝑥)) = (1r‘𝑆))
45	30, 44	sylan 579	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑆)((invr‘𝑆)‘𝑥)) = (1r‘𝑆))
46	10, 41	ressmulr 17288	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
47	46	adantr 480	. . . . . . . 8 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (.r‘𝑅) = (.r‘𝑆))
48	47	oveqd 7437	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)) = (𝑥(.r‘𝑆)((invr‘𝑆)‘𝑥)))
49	45, 48, 13	3eqtr4d 2778	. . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (𝑥(.r‘𝑅)((invr‘𝑆)‘𝑥)) = (1r‘𝑅))
50	42, 49	eqtrid 2780	. . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → (((invr‘𝑆)‘𝑥)(.r‘(oppr‘𝑅))𝑥) = (1r‘𝑅))
51	40, 50	breqtrd 5174	. . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥(∥r‘(oppr‘𝑅))(1r‘𝑅))
52		subrguss.2	. . . . 5 ⊢ 𝑈 = (Unit‘𝑅)
53	52, 11, 15, 35, 37	isunit 20312	. . . 4 ⊢ (𝑥 ∈ 𝑈 ↔ (𝑥(∥r‘𝑅)(1r‘𝑅) ∧ 𝑥(∥r‘(oppr‘𝑅))(1r‘𝑅)))
54	19, 51, 53	sylanbrc 582	. . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ 𝑈)
55	54	ex 412	. 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥 ∈ 𝑉 → 𝑥 ∈ 𝑈))
56	55	ssrdv 3986	1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑉 ⊆ 𝑈)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1534   ∈ wcel 2099   ⊆ wss 3947   class class class wbr 5148  ‘cfv 6548  (class class class)co 7420  Basecbs 17180   ↾_s cress 17209  ._rcmulr 17234  1_rcur 20121  Ringcrg 20173  opp_rcoppr 20272  ∥_rcdsr 20293  Unitcui 20294  inv_rcinvr 20326  SubRingcsubrg 20506

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5365  ax-pr 5429  ax-un 7740  ax-cnex 11195  ax-resscn 11196  ax-1cn 11197  ax-icn 11198  ax-addcl 11199  ax-addrcl 11200  ax-mulcl 11201  ax-mulrcl 11202  ax-mulcom 11203  ax-addass 11204  ax-mulass 11205  ax-distr 11206  ax-i2m1 11207  ax-1ne0 11208  ax-1rid 11209  ax-rnegex 11210  ax-rrecex 11211  ax-cnre 11212  ax-pre-lttri 11213  ax-pre-lttrn 11214  ax-pre-ltadd 11215  ax-pre-mulgt0 11216

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-nel 3044  df-ral 3059  df-rex 3068  df-rmo 3373  df-reu 3374  df-rab 3430  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-pred 6305  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-f1 6553  df-fo 6554  df-f1o 6555  df-fv 6556  df-riota 7376  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7871  df-2nd 7994  df-tpos 8232  df-frecs 8287  df-wrecs 8318  df-recs 8392  df-rdg 8431  df-er 8725  df-en 8965  df-dom 8966  df-sdom 8967  df-pnf 11281  df-mnf 11282  df-xr 11283  df-ltxr 11284  df-le 11285  df-sub 11477  df-neg 11478  df-nn 12244  df-2 12306  df-3 12307  df-sets 17133  df-slot 17151  df-ndx 17163  df-base 17181  df-ress 17210  df-plusg 17246  df-mulr 17247  df-0g 17423  df-mgm 18600  df-sgrp 18679  df-mnd 18695  df-grp 18893  df-minusg 18894  df-subg 19078  df-cmn 19737  df-abl 19738  df-mgp 20075  df-rng 20093  df-ur 20122  df-ring 20175  df-oppr 20273  df-dvdsr 20296  df-unit 20297  df-invr 20327  df-subrg 20508

This theorem is referenced by:  subrginv  20527  subrgdv  20528  subrgunit  20529  subrgugrp  20530  issubdrg  20668  zringunit  21392

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »