Theorem resspsrmul 20655

Description: A restricted power series algebra has the same multiplication operation. (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
resspsrmul	⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘𝑈)𝑌) = (𝑋(.r‘𝑃)𝑌))

Proof of Theorem resspsrmul

Dummy variables 𝑥 𝑘 𝑓 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		reldmpsr 20599	. . . . . . . . . 10 ⊢ Rel dom mPwSer
2		resspsr.u	. . . . . . . . . 10 ⊢ 𝑈 = (𝐼 mPwSer 𝐻)
3		resspsr.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑈)
4	1, 2, 3	elbasov 16537	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝐵 → (𝐼 ∈ V ∧ 𝐻 ∈ V))
5	4	ad2antrl 727	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐼 ∈ V ∧ 𝐻 ∈ V))
6	5	simpld 498	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐼 ∈ V)
7		eqid 2798	. . . . . . . 8 ⊢ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}
8	7	psrbaglefi 20610	. . . . . . 7 ⊢ ((𝐼 ∈ V ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ∈ Fin)
9	6, 8	sylan 583	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ∈ Fin)
10		resspsr.2	. . . . . . . . 9 ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅))
11		subrgsubg 19534	. . . . . . . . 9 ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝑇 ∈ (SubGrp‘𝑅))
12	10, 11	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝑅))
13		subgsubm 18293	. . . . . . . 8 ⊢ (𝑇 ∈ (SubGrp‘𝑅) → 𝑇 ∈ (SubMnd‘𝑅))
14	12, 13	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑇 ∈ (SubMnd‘𝑅))
15	14	ad2antrr 725	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → 𝑇 ∈ (SubMnd‘𝑅))
16	10	ad3antrrr 729	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → 𝑇 ∈ (SubRing‘𝑅))
17		eqid 2798	. . . . . . . . . . . 12 ⊢ (Base‘𝐻) = (Base‘𝐻)
18		simprl 770	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵)
19	2, 17, 7, 3, 18	psrelbas 20617	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋:{𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}⟶(Base‘𝐻))
20	19	adantr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → 𝑋:{𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}⟶(Base‘𝐻))
21		elrabi 3623	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} → 𝑥 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin})
22		ffvelrn 6826	. . . . . . . . . 10 ⊢ ((𝑋:{𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}⟶(Base‘𝐻) ∧ 𝑥 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → (𝑋‘𝑥) ∈ (Base‘𝐻))
23	20, 21, 22	syl2an 598	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → (𝑋‘𝑥) ∈ (Base‘𝐻))
24		resspsr.h	. . . . . . . . . . 11 ⊢ 𝐻 = (𝑅 ↾s 𝑇)
25	24	subrgbas 19537	. . . . . . . . . 10 ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝑇 = (Base‘𝐻))
26	16, 25	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → 𝑇 = (Base‘𝐻))
27	23, 26	eleqtrrd 2893	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → (𝑋‘𝑥) ∈ 𝑇)
28		simprr 772	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵)
29	2, 17, 7, 3, 28	psrelbas 20617	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌:{𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}⟶(Base‘𝐻))
30	29	ad2antrr 725	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → 𝑌:{𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}⟶(Base‘𝐻))
31		ssrab2 4007	. . . . . . . . . . 11 ⊢ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ⊆ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}
32	6	ad2antrr 725	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → 𝐼 ∈ V)
33		simplr 768	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin})
34		simpr 488	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘})
35		eqid 2798	. . . . . . . . . . . . 13 ⊢ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} = {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}
36	7, 35	psrbagconcl 20611	. . . . . . . . . . . 12 ⊢ ((𝐼 ∈ V ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑥) ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘})
37	32, 33, 34, 36	syl3anc 1368	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑥) ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘})
38	31, 37	sseldi 3913	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑥) ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin})
39	30, 38	ffvelrnd 6829	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → (𝑌‘(𝑘 ∘f − 𝑥)) ∈ (Base‘𝐻))
40	39, 26	eleqtrrd 2893	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → (𝑌‘(𝑘 ∘f − 𝑥)) ∈ 𝑇)
41		eqid 2798	. . . . . . . . 9 ⊢ (.r‘𝑅) = (.r‘𝑅)
42	41	subrgmcl 19540	. . . . . . . 8 ⊢ ((𝑇 ∈ (SubRing‘𝑅) ∧ (𝑋‘𝑥) ∈ 𝑇 ∧ (𝑌‘(𝑘 ∘f − 𝑥)) ∈ 𝑇) → ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥))) ∈ 𝑇)
43	16, 27, 40, 42	syl3anc 1368	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥))) ∈ 𝑇)
44	43	fmpttd 6856	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥)))):{𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}⟶𝑇)
45	9, 15, 44, 24	gsumsubm 17991	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥))))) = (𝐻 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥))))))
46	24, 41	ressmulr 16617	. . . . . . . . . 10 ⊢ (𝑇 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝐻))
47	10, 46	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (.r‘𝑅) = (.r‘𝐻))
48	47	ad3antrrr 729	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → (.r‘𝑅) = (.r‘𝐻))
49	48	oveqd 7152	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ∧ 𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘}) → ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥))) = ((𝑋‘𝑥)(.r‘𝐻)(𝑌‘(𝑘 ∘f − 𝑥))))
50	49	mpteq2dva 5125	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥)))) = (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝐻)(𝑌‘(𝑘 ∘f − 𝑥)))))
51	50	oveq2d 7151	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → (𝐻 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥))))) = (𝐻 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝐻)(𝑌‘(𝑘 ∘f − 𝑥))))))
52	45, 51	eqtrd 2833	. . . 4 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) → (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥))))) = (𝐻 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝐻)(𝑌‘(𝑘 ∘f − 𝑥))))))
53	52	mpteq2dva 5125	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥)))))) = (𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ↦ (𝐻 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝐻)(𝑌‘(𝑘 ∘f − 𝑥)))))))
54		resspsr.s	. . . 4 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
55		eqid 2798	. . . 4 ⊢ (Base‘𝑆) = (Base‘𝑆)
56		eqid 2798	. . . 4 ⊢ (.r‘𝑆) = (.r‘𝑆)
57		fvex 6658	. . . . . . . 8 ⊢ (Base‘𝑅) ∈ V
58	10, 25	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑇 = (Base‘𝐻))
59		eqid 2798	. . . . . . . . . . 11 ⊢ (Base‘𝑅) = (Base‘𝑅)
60	59	subrgss 19529	. . . . . . . . . 10 ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝑇 ⊆ (Base‘𝑅))
61	10, 60	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑇 ⊆ (Base‘𝑅))
62	58, 61	eqsstrrd 3954	. . . . . . . 8 ⊢ (𝜑 → (Base‘𝐻) ⊆ (Base‘𝑅))
63		mapss 8436	. . . . . . . 8 ⊢ (((Base‘𝑅) ∈ V ∧ (Base‘𝐻) ⊆ (Base‘𝑅)) → ((Base‘𝐻) ↑m {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ⊆ ((Base‘𝑅) ↑m {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}))
64	57, 62, 63	sylancr 590	. . . . . . 7 ⊢ (𝜑 → ((Base‘𝐻) ↑m {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ⊆ ((Base‘𝑅) ↑m {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}))
65	64	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((Base‘𝐻) ↑m {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) ⊆ ((Base‘𝑅) ↑m {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}))
66	2, 17, 7, 3, 6	psrbas 20616	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐵 = ((Base‘𝐻) ↑m {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}))
67	54, 59, 7, 55, 6	psrbas 20616	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (Base‘𝑆) = ((Base‘𝑅) ↑m {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}))
68	65, 66, 67	3sstr4d 3962	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐵 ⊆ (Base‘𝑆))
69	68, 18	sseldd 3916	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ (Base‘𝑆))
70	68, 28	sseldd 3916	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ (Base‘𝑆))
71	54, 55, 41, 56, 7, 69, 70	psrmulfval 20623	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘𝑆)𝑌) = (𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝑅)(𝑌‘(𝑘 ∘f − 𝑥)))))))
72		eqid 2798	. . . 4 ⊢ (.r‘𝐻) = (.r‘𝐻)
73		eqid 2798	. . . 4 ⊢ (.r‘𝑈) = (.r‘𝑈)
74	2, 3, 72, 73, 7, 18, 28	psrmulfval 20623	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘𝑈)𝑌) = (𝑘 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ↦ (𝐻 Σg (𝑥 ∈ {𝑦 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∣ 𝑦 ∘r ≤ 𝑘} ↦ ((𝑋‘𝑥)(.r‘𝐻)(𝑌‘(𝑘 ∘f − 𝑥)))))))
75	53, 71, 74	3eqtr4rd 2844	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘𝑈)𝑌) = (𝑋(.r‘𝑆)𝑌))
76	3	fvexi 6659	. . . 4 ⊢ 𝐵 ∈ V
77		resspsr.p	. . . . 5 ⊢ 𝑃 = (𝑆 ↾s 𝐵)
78	77, 56	ressmulr 16617	. . . 4 ⊢ (𝐵 ∈ V → (.r‘𝑆) = (.r‘𝑃))
79	76, 78	mp1i 13	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (.r‘𝑆) = (.r‘𝑃))
80	79	oveqd 7152	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘𝑆)𝑌) = (𝑋(.r‘𝑃)𝑌))
81	75, 80	eqtrd 2833	1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘𝑈)𝑌) = (𝑋(.r‘𝑃)𝑌))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  {crab 3110  Vcvv 3441   ⊆ wss 3881   class class class wbr 5030   ↦ cmpt 5110  ^◡ccnv 5518   “ cima 5522  ⟶wf 6320  ‘cfv 6324  (class class class)co 7135   ∘_f cof 7387   ∘_r cofr 7388   ↑_m cmap 8389  Fincfn 8492   ≤ cle 10665   − cmin 10859  ℕcn 11625  ℕ₀cn0 11885  Basecbs 16475   ↾_s cress 16476  ._rcmulr 16558   Σ_g cgsu 16706  SubMndcsubmnd 17947  SubGrpcsubg 18265  SubRingcsubrg 19524   mPwSer cmps 20589

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-of 7389  df-ofr 7390  df-om 7561  df-1st 7671  df-2nd 7672  df-supp 7814  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-2o 8086  df-oadd 8089  df-er 8272  df-map 8391  df-pm 8392  df-ixp 8445  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-fsupp 8818  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-3 11689  df-4 11690  df-5 11691  df-6 11692  df-7 11693  df-8 11694  df-9 11695  df-n0 11886  df-z 11970  df-uz 12232  df-fz 12886  df-seq 13365  df-struct 16477  df-ndx 16478  df-slot 16479  df-base 16481  df-sets 16482  df-ress 16483  df-plusg 16570  df-mulr 16571  df-sca 16573  df-vsca 16574  df-tset 16576  df-0g 16707  df-gsum 16708  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-submnd 17949  df-grp 18098  df-minusg 18099  df-subg 18268  df-mgp 19233  df-ring 19292  df-subrg 19526  df-psr 20594

This theorem is referenced by:  subrgpsr  20657  ressmplmul  20698