subrgpsr - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > subrgpsr		Structured version Visualization version GIF version

Theorem subrgpsr 21966

Description: A subring of the base ring induces a subring of power series. (Contributed by Mario Carneiro, 3-Jul-2015.)

**Hypotheses**
Ref	Expression
subrgpsr.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
subrgpsr.h	⊢ 𝐻 = (𝑅 ↾_s 𝑇)
subrgpsr.u	⊢ 𝑈 = (𝐼 mPwSer 𝐻)
subrgpsr.b	⊢ 𝐵 = (Base‘𝑈)

**Assertion**
Ref	Expression
subrgpsr	⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝐵 ∈ (SubRing‘𝑆))

Proof of Theorem subrgpsr Dummy variables 𝑥 𝑦 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		subrgpsr.s	. . 3 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
2		simpl 482	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝐼 ∈ 𝑉)
3		subrgrcl 20544	. . . 4 ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
4	3	adantl 481	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝑅 ∈ Ring)
5	1, 2, 4	psrring 21958	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝑆 ∈ Ring)
6		subrgpsr.u	. . . 4 ⊢ 𝑈 = (𝐼 mPwSer 𝐻)
7		subrgpsr.h	. . . . . 6 ⊢ 𝐻 = (𝑅 ↾_s 𝑇)
8	7	subrgring 20542	. . . . 5 ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝐻 ∈ Ring)
9	8	adantl 481	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝐻 ∈ Ring)
10	6, 2, 9	psrring 21958	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝑈 ∈ Ring)
11		subrgpsr.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑈)
12	11	a1i 11	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝐵 = (Base‘𝑈))
13		eqid 2737	. . . . 5 ⊢ (𝑆 ↾_s 𝐵) = (𝑆 ↾_s 𝐵)
14		simpr 484	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝑇 ∈ (SubRing‘𝑅))
15	1, 7, 6, 11, 13, 14	resspsrbas 21962	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝐵 = (Base‘(𝑆 ↾_s 𝐵)))
16	1, 7, 6, 11, 13, 14	resspsradd 21963	. . . 4 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+_g‘𝑈)𝑦) = (𝑥(+_g‘(𝑆 ↾_s 𝐵))𝑦))
17	1, 7, 6, 11, 13, 14	resspsrmul 21964	. . . 4 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(._r‘𝑈)𝑦) = (𝑥(._r‘(𝑆 ↾_s 𝐵))𝑦))
18	12, 15, 16, 17	ringpropd 20260	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → (𝑈 ∈ Ring ↔ (𝑆 ↾_s 𝐵) ∈ Ring))
19	10, 18	mpbid 232	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → (𝑆 ↾_s 𝐵) ∈ Ring)
20		eqid 2737	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
21	13, 20	ressbasss 17200	. . . 4 ⊢ (Base‘(𝑆 ↾_s 𝐵)) ⊆ (Base‘𝑆)
22	15, 21	eqsstrdi 3967	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝐵 ⊆ (Base‘𝑆))
23		eqid 2737	. . . . . . 7 ⊢ {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}
24		eqid 2737	. . . . . . 7 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
25		eqid 2737	. . . . . . 7 ⊢ (1_r‘𝑅) = (1_r‘𝑅)
26		eqid 2737	. . . . . . 7 ⊢ (1_r‘𝑆) = (1_r‘𝑆)
27	1, 2, 4, 23, 24, 25, 26	psr1 21959	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → (1_r‘𝑆) = (𝑥 ∈ {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin} ↦ if(𝑥 = (𝐼 × {0}), (1_r‘𝑅), (0_g‘𝑅))))
28	25	subrg1cl 20548	. . . . . . . . . 10 ⊢ (𝑇 ∈ (SubRing‘𝑅) → (1_r‘𝑅) ∈ 𝑇)
29		subrgsubg 20545	. . . . . . . . . . 11 ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝑇 ∈ (SubGrp‘𝑅))
30	24	subg0cl 19101	. . . . . . . . . . 11 ⊢ (𝑇 ∈ (SubGrp‘𝑅) → (0_g‘𝑅) ∈ 𝑇)
31	29, 30	syl 17	. . . . . . . . . 10 ⊢ (𝑇 ∈ (SubRing‘𝑅) → (0_g‘𝑅) ∈ 𝑇)
32	28, 31	ifcld 4514	. . . . . . . . 9 ⊢ (𝑇 ∈ (SubRing‘𝑅) → if(𝑥 = (𝐼 × {0}), (1_r‘𝑅), (0_g‘𝑅)) ∈ 𝑇)
33	32	adantl 481	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → if(𝑥 = (𝐼 × {0}), (1_r‘𝑅), (0_g‘𝑅)) ∈ 𝑇)
34	7	subrgbas 20549	. . . . . . . . 9 ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝑇 = (Base‘𝐻))
35	34	adantl 481	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝑇 = (Base‘𝐻))
36	33, 35	eleqtrd 2839	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → if(𝑥 = (𝐼 × {0}), (1_r‘𝑅), (0_g‘𝑅)) ∈ (Base‘𝐻))
37	36	adantr 480	. . . . . 6 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) ∧ 𝑥 ∈ {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}) → if(𝑥 = (𝐼 × {0}), (1_r‘𝑅), (0_g‘𝑅)) ∈ (Base‘𝐻))
38	27, 37	fmpt3d 7062	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → (1_r‘𝑆):{𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}⟶(Base‘𝐻))
39		fvex 6847	. . . . . 6 ⊢ (Base‘𝐻) ∈ V
40		ovex 7393	. . . . . . 7 ⊢ (ℕ₀ ↑_m 𝐼) ∈ V
41	40	rabex 5276	. . . . . 6 ⊢ {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin} ∈ V
42	39, 41	elmap 8812	. . . . 5 ⊢ ((1_r‘𝑆) ∈ ((Base‘𝐻) ↑_m {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}) ↔ (1_r‘𝑆):{𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}⟶(Base‘𝐻))
43	38, 42	sylibr 234	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → (1_r‘𝑆) ∈ ((Base‘𝐻) ↑_m {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}))
44		eqid 2737	. . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻)
45	6, 44, 23, 11, 2	psrbas 21923	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝐵 = ((Base‘𝐻) ↑_m {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}))
46	43, 45	eleqtrrd 2840	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → (1_r‘𝑆) ∈ 𝐵)
47	22, 46	jca 511	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → (𝐵 ⊆ (Base‘𝑆) ∧ (1_r‘𝑆) ∈ 𝐵))
48	20, 26	issubrg 20539	. 2 ⊢ (𝐵 ∈ (SubRing‘𝑆) ↔ ((𝑆 ∈ Ring ∧ (𝑆 ↾_s 𝐵) ∈ Ring) ∧ (𝐵 ⊆ (Base‘𝑆) ∧ (1_r‘𝑆) ∈ 𝐵)))
49	5, 19, 47, 48	syl21anbrc 1346	1 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑇 ∈ (SubRing‘𝑅)) → 𝐵 ∈ (SubRing‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3390 ⊆ wss 3890 ifcif 4467 {csn 4568 × cxp 5622 ^◡ccnv 5623 “ cima 5627 ⟶wf 6488 ‘cfv 6492 (class class class)co 7360 ↑_m cmap 8766 Fincfn 8886 0cc0 11029 ℕcn 12165 ℕ₀cn0 12428 Basecbs 17170 ↾_s cress 17191 0_gc0g 17393 SubGrpcsubg 19087 1_rcur 20153 Ringcrg 20205 SubRingcsubrg 20537 mPwSer cmps 21894

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 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106

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 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 df-ofr 7625 df-om 7811 df-1st 7935 df-2nd 7936 df-supp 8104 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-2o 8399 df-er 8636 df-map 8768 df-pm 8769 df-ixp 8839 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-fsupp 9268 df-sup 9348 df-oi 9418 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-dec 12636 df-uz 12780 df-fz 13453 df-fzo 13600 df-seq 13955 df-hash 14284 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-mulr 17225 df-sca 17227 df-vsca 17228 df-ip 17229 df-tset 17230 df-ple 17231 df-ds 17233 df-hom 17235 df-cco 17236 df-0g 17395 df-gsum 17396 df-prds 17401 df-pws 17403 df-mre 17539 df-mrc 17540 df-acs 17542 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-mhm 18742 df-submnd 18743 df-grp 18903 df-minusg 18904 df-mulg 19035 df-subg 19090 df-ghm 19179 df-cntz 19283 df-cmn 19748 df-abl 19749 df-mgp 20113 df-rng 20125 df-ur 20154 df-ring 20207 df-subrng 20514 df-subrg 20538 df-psr 21899

This theorem is referenced by: ressmplbas2 22015 subrgmpl 22020

W3C validator