resspsrbas - Metamath Proof Explorer

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

Theorem resspsrbas 22175

Description: A restricted power series algebra has the same base set. (Contributed by Mario Carneiro, 3-Jul-2015.)

**Hypotheses**
Ref	Expression
resspsr.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
resspsr.h	⊢ 𝐻 = (𝑅 ↾_s 𝑇)
resspsr.u	⊢ 𝑈 = (𝐼 mPwSer 𝐻)
resspsr.b	⊢ 𝐵 = (Base‘𝑈)
resspsr.p	⊢ 𝑃 = (𝑆 ↾_s 𝐵)
resspsr.2	⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅))

**Assertion**
Ref	Expression
resspsrbas	⊢ (𝜑 → 𝐵 = (Base‘𝑃))

Proof of Theorem resspsrbas Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvex 6898	. . . . 5 ⊢ (Base‘𝑅) ∈ V
2		resspsr.2	. . . . . . . 8 ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅))
3		resspsr.h	. . . . . . . . 9 ⊢ 𝐻 = (𝑅 ↾_s 𝑇)
4	3	subrgbas 20732	. . . . . . . 8 ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝑇 = (Base‘𝐻))
5	2, 4	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑇 = (Base‘𝐻))
6		eqid 2765	. . . . . . . . 9 ⊢ (Base‘𝑅) = (Base‘𝑅)
7	6	subrgss 20723	. . . . . . . 8 ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝑇 ⊆ (Base‘𝑅))
8	2, 7	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑇 ⊆ (Base‘𝑅))
9	5, 8	eqsstrrd 3973	. . . . . 6 ⊢ (𝜑 → (Base‘𝐻) ⊆ (Base‘𝑅))
10	9	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝐼 ∈ V) → (Base‘𝐻) ⊆ (Base‘𝑅))
11		mapss 8893	. . . . 5 ⊢ (((Base‘𝑅) ∈ V ∧ (Base‘𝐻) ⊆ (Base‘𝑅)) → ((Base‘𝐻) ↑_m {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}) ⊆ ((Base‘𝑅) ↑_m {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}))
12	1, 10, 11	sylancr 599	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ V) → ((Base‘𝐻) ↑_m {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}) ⊆ ((Base‘𝑅) ↑_m {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}))
13		resspsr.u	. . . . 5 ⊢ 𝑈 = (𝐼 mPwSer 𝐻)
14		eqid 2765	. . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻)
15		eqid 2765	. . . . 5 ⊢ {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}
16		resspsr.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑈)
17		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝐼 ∈ V) → 𝐼 ∈ V)
18	13, 14, 15, 16, 17	psrbas 22136	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ V) → 𝐵 = ((Base‘𝐻) ↑_m {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}))
19		resspsr.s	. . . . 5 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
20		eqid 2765	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
21	19, 6, 15, 20, 17	psrbas 22136	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ V) → (Base‘𝑆) = ((Base‘𝑅) ↑_m {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}))
22	12, 18, 21	3sstr4d 3993	. . 3 ⊢ ((𝜑 ∧ 𝐼 ∈ V) → 𝐵 ⊆ (Base‘𝑆))
23		reldmpsr 22116	. . . . . . . . 9 ⊢ Rel dom mPwSer
24	23	ovprc1 7458	. . . . . . . 8 ⊢ (¬ 𝐼 ∈ V → (𝐼 mPwSer 𝐻) = ∅)
25	13, 24	eqtrid 2812	. . . . . . 7 ⊢ (¬ 𝐼 ∈ V → 𝑈 = ∅)
26	25	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐼 ∈ V) → 𝑈 = ∅)
27	26	fveq2d 6889	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐼 ∈ V) → (Base‘𝑈) = (Base‘∅))
28		base0 17298	. . . . 5 ⊢ ∅ = (Base‘∅)
29	27, 16, 28	3eqtr4g 2825	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐼 ∈ V) → 𝐵 = ∅)
30		0ss 4357	. . . 4 ⊢ ∅ ⊆ (Base‘𝑆)
31	29, 30	eqsstrdi 3982	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐼 ∈ V) → 𝐵 ⊆ (Base‘𝑆))
32	22, 31	pm2.61dan 825	. 2 ⊢ (𝜑 → 𝐵 ⊆ (Base‘𝑆))
33		resspsr.p	. . 3 ⊢ 𝑃 = (𝑆 ↾_s 𝐵)
34	33, 20	ressbas2 17322	. 2 ⊢ (𝐵 ⊆ (Base‘𝑆) → 𝐵 = (Base‘𝑃))
35	32, 34	syl 18	1 ⊢ (𝜑 → 𝐵 = (Base‘𝑃))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 {crab 3418 Vcvv 3457 ⊆ wss 3906 ∅c0 4286 ^◡ccnv 5662 “ cima 5666 ‘cfv 6540 (class class class)co 7419 ↑_m cmap 8830 Fincfn 8949 ℕcn 12250 ℕ₀cn0 12521 Basecbs 17293 ↾_s cress 17314 SubRingcsubrg 20720 mPwSer cmps 22106

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 df-om 7869 df-1st 7992 df-2nd 7993 df-supp 8163 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-map 8832 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fsupp 9329 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-2 12320 df-3 12321 df-4 12322 df-5 12323 df-6 12324 df-7 12325 df-8 12326 df-9 12327 df-n0 12522 df-z 12609 df-uz 12881 df-fz 13554 df-struct 17231 df-sets 17248 df-slot 17266 df-ndx 17278 df-base 17294 df-ress 17315 df-plusg 17347 df-mulr 17348 df-sca 17350 df-vsca 17351 df-tset 17353 df-subg 19235 df-ring 20363 df-subrg 20721 df-psr 22111

This theorem is used by: resspsrvsca 22178 subrgpsr 22179

W3C validator