Theorem psdffval 22391

Description: Value of the power series differentiation operation. (Contributed by SN, 11-Apr-2025.)

Hypotheses

Ref	Expression
psdffval.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
psdffval.b	⊢ 𝐵 = (Base‘𝑆)
psdffval.d	⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
psdffval.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
psdffval.r	⊢ (𝜑 → 𝑅 ∈ 𝑊)

Assertion

Ref	Expression
psdffval	⊢ (𝜑 → (𝐼 mPSDer 𝑅) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐵 ↦ (𝑘 ∈ 𝐷 ↦ (((𝑘‘𝑥) + 1)(.g‘𝑅)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))))))))

Distinct variable groups:   𝑓,𝐼,ℎ,𝑘,𝑥,𝑦   𝑅,𝑓,𝑘,𝑥

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓, ℎ, 𝑘)   𝐵(𝑥, 𝑦, 𝑓, ℎ, 𝑘)   𝐷(𝑥, 𝑦, 𝑓, ℎ, 𝑘)   𝑅(𝑦, ℎ)   𝑆(𝑥, 𝑦, 𝑓, ℎ, 𝑘)   𝑉(𝑥, 𝑦, 𝑓, ℎ, 𝑘)   𝑊(𝑥, 𝑦, 𝑓, ℎ, 𝑘)

Proof of Theorem psdffval

Dummy variables 𝑖 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-psd 22390	. . 3 ⊢ mPSDer = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ (Base‘(𝑖 mPwSer 𝑟)) ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑥) + 1)(.g‘𝑟)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)))))))))
2	1	a1i 11	. 2 ⊢ (𝜑 → mPSDer = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ (Base‘(𝑖 mPwSer 𝑟)) ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑥) + 1)(.g‘𝑟)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0))))))))))
3		simpl 488	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → 𝑖 = 𝐼)
4		oveq12 7426	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) = (𝐼 mPwSer 𝑅))
5		psdffval.s	. . . . . . . 8 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
6	4, 5	eqtr4di 2815	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) = 𝑆)
7	6	fveq2d 6886	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘(𝑖 mPwSer 𝑟)) = (Base‘𝑆))
8		psdffval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑆)
9	7, 8	eqtr4di 2815	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘(𝑖 mPwSer 𝑟)) = 𝐵)
10	3	oveq2d 7433	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (ℕ0 ↑m 𝑖) = (ℕ0 ↑m 𝐼))
11	10	rabeqdv 3429	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
12		psdffval.d	. . . . . . 7 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
13	11, 12	eqtr4di 2815	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = 𝐷)
14		fveq2 6882	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (.g‘𝑟) = (.g‘𝑅))
15	14	adantl 487	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (.g‘𝑟) = (.g‘𝑅))
16		eqidd 2763	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ((𝑘‘𝑥) + 1) = ((𝑘‘𝑥) + 1))
17	3	mpteq1d 5199	. . . . . . . . 9 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))
18	17	oveq2d 7433	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑘 ∘f + (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0))) = (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0))))
19	18	fveq2d 6886	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)))) = (𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))))
20	15, 16, 19	oveq123d 7438	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (((𝑘‘𝑥) + 1)(.g‘𝑟)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0))))) = (((𝑘‘𝑥) + 1)(.g‘𝑅)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0))))))
21	13, 20	mpteq12dv 5196	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑥) + 1)(.g‘𝑟)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)))))) = (𝑘 ∈ 𝐷 ↦ (((𝑘‘𝑥) + 1)(.g‘𝑅)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))))))
22	9, 21	mpteq12dv 5196	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑓 ∈ (Base‘(𝑖 mPwSer 𝑟)) ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑥) + 1)(.g‘𝑟)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0))))))) = (𝑓 ∈ 𝐵 ↦ (𝑘 ∈ 𝐷 ↦ (((𝑘‘𝑥) + 1)(.g‘𝑅)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0))))))))
23	3, 22	mpteq12dv 5196	. . 3 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ (Base‘(𝑖 mPwSer 𝑟)) ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑥) + 1)(.g‘𝑟)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)))))))) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐵 ↦ (𝑘 ∈ 𝐷 ↦ (((𝑘‘𝑥) + 1)(.g‘𝑅)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))))))))
24	23	adantl 487	. 2 ⊢ ((𝜑 ∧ (𝑖 = 𝐼 ∧ 𝑟 = 𝑅)) → (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ (Base‘(𝑖 mPwSer 𝑟)) ↦ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑥) + 1)(.g‘𝑟)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)))))))) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐵 ↦ (𝑘 ∈ 𝐷 ↦ (((𝑘‘𝑥) + 1)(.g‘𝑅)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))))))))
25		psdffval.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
26	25	elexd 3476	. 2 ⊢ (𝜑 → 𝐼 ∈ V)
27		psdffval.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑊)
28	27	elexd 3476	. 2 ⊢ (𝜑 → 𝑅 ∈ V)
29	25	mptexd 7227	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐵 ↦ (𝑘 ∈ 𝐷 ↦ (((𝑘‘𝑥) + 1)(.g‘𝑅)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))))))) ∈ V)
30	2, 24, 26, 28, 29	ovmpod 7569	1 ⊢ (𝜑 → (𝐼 mPSDer 𝑅) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐵 ↦ (𝑘 ∈ 𝐷 ↦ (((𝑘‘𝑥) + 1)(.g‘𝑅)(𝑓‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))))))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3414  Vcvv 3453  ifcif 4485   ↦ cmpt 5190  ^◡ccnv 5658   “ cima 5662  ‘cfv 6537  (class class class)co 7417   ∈ cmpo 7419   ∘_f cof 7680   ↑_m cmap 8830  Fincfn 8956  0cc0 11128  1c1 11129   + caddc 11131  ℕcn 12261  ℕ₀cn0 12532  Basecbs 17307  ._gcmg 19196   mPwSer cmps 22125   mPSDer cpsd 22368

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-psd 22390

This theorem is used by:  psdfval  22392