psdmplcl - Metamath Proof Explorer

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

Theorem psdmplcl 22138

Description: The derivative of a polynomial is a polynomial. (Contributed by SN, 12-Apr-2025.)

**Hypotheses**
Ref	Expression
psdmplcl.p	⊢ 𝑃 = (𝐼 mPoly 𝑅)
psdmplcl.b	⊢ 𝐵 = (Base‘𝑃)
psdmplcl.r	⊢ (𝜑 → 𝑅 ∈ Mnd)
psdmplcl.x	⊢ (𝜑 → 𝑋 ∈ 𝐼)
psdmplcl.f	⊢ (𝜑 → 𝐹 ∈ 𝐵)

**Assertion**
Ref	Expression
psdmplcl	⊢ (𝜑 → (((𝐼 mPSDer 𝑅)‘𝑋)‘𝐹) ∈ 𝐵)

Proof of Theorem psdmplcl Dummy variables 𝑏 𝑑 ℎ 𝑖 𝑘 𝑦 𝑧 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2737	. . 3 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅)
2		eqid 2737	. . 3 ⊢ (Base‘(𝐼 mPwSer 𝑅)) = (Base‘(𝐼 mPwSer 𝑅))
3		psdmplcl.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Mnd)
4		mndmgm 18700	. . . 4 ⊢ (𝑅 ∈ Mnd → 𝑅 ∈ Mgm)
5	3, 4	syl 17	. . 3 ⊢ (𝜑 → 𝑅 ∈ Mgm)
6		psdmplcl.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐼)
7		psdmplcl.p	. . . . 5 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
8		psdmplcl.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑃)
9	7, 1, 8, 2	mplbasss 21985	. . . 4 ⊢ 𝐵 ⊆ (Base‘(𝐼 mPwSer 𝑅))
10		psdmplcl.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐵)
11	9, 10	sselid 3920	. . 3 ⊢ (𝜑 → 𝐹 ∈ (Base‘(𝐼 mPwSer 𝑅)))
12	1, 2, 5, 6, 11	psdcl 22137	. 2 ⊢ (𝜑 → (((𝐼 mPSDer 𝑅)‘𝑋)‘𝐹) ∈ (Base‘(𝐼 mPwSer 𝑅)))
13		eqid 2737	. . . 4 ⊢ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}
14	1, 2, 13, 6, 11	psdval 22135	. . 3 ⊢ (𝜑 → (((𝐼 mPSDer 𝑅)‘𝑋)‘𝐹) = (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑋) + 1)(._g‘𝑅)(𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))))
15		ovex 7393	. . . . . . 7 ⊢ (ℕ₀ ↑_m 𝐼) ∈ V
16	15	rabex 5276	. . . . . 6 ⊢ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ∈ V
17	16	a1i 11	. . . . 5 ⊢ (𝜑 → {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ∈ V)
18	17	mptexd 7172	. . . 4 ⊢ (𝜑 → (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑋) + 1)(._g‘𝑅)(𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))) ∈ V)
19		fvexd 6849	. . . 4 ⊢ (𝜑 → (0_g‘𝑅) ∈ V)
20		funmpt 6530	. . . . 5 ⊢ Fun (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑋) + 1)(._g‘𝑅)(𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))))
21	20	a1i 11	. . . 4 ⊢ (𝜑 → Fun (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑋) + 1)(._g‘𝑅)(𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))))
22		simpr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
23		reldmmpl 21976	. . . . . . . . . . . . 13 ⊢ Rel dom mPoly
24	7, 8, 23	strov2rcl 17178	. . . . . . . . . . . 12 ⊢ (𝐹 ∈ 𝐵 → 𝐼 ∈ V)
25	10, 24	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐼 ∈ V)
26	13	psrbagsn 22051	. . . . . . . . . . 11 ⊢ (𝐼 ∈ V → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
27	25, 26	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
28	27	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
29	13	psrbagaddcl 21914	. . . . . . . . 9 ⊢ ((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ∧ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
30	22, 28, 29	syl2anc 585	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
31		eqidd 2738	. . . . . . . 8 ⊢ (𝜑 → (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) = (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))
32		eqid 2737	. . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝑅)
33	7, 32, 8, 13, 10	mplelf 21986	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}⟶(Base‘𝑅))
34	33	feqmptd 6902	. . . . . . . 8 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝐹‘𝑧)))
35		fveq2 6834	. . . . . . . 8 ⊢ (𝑧 = (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) → (𝐹‘𝑧) = (𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))
36	30, 31, 34, 35	fmptco 7076	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∘ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) = (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))))
37		eqid 2737	. . . . . . . . 9 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
38	7, 8, 37, 10	mplelsfi 21983	. . . . . . . 8 ⊢ (𝜑 → 𝐹 finSupp (0_g‘𝑅))
39	30	fmpttd 7061	. . . . . . . . 9 ⊢ (𝜑 → (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))):{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}⟶{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
40		ovex 7393	. . . . . . . . . . . . . . 15 ⊢ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ V
41		eqid 2737	. . . . . . . . . . . . . . 15 ⊢ (𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) = (𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
42	40, 41	fnmpti 6635	. . . . . . . . . . . . . 14 ⊢ (𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) Fn {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}
43	42	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) Fn {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
44		dffn3 6674	. . . . . . . . . . . . 13 ⊢ ((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) Fn {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↔ (𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))):{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}⟶ran (𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))
45	43, 44	sylib 218	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))):{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}⟶ran (𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))
46	45, 39	fcod 6687	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) ∘ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))):{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}⟶ran (𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))
47	46	ffnd 6663	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) ∘ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) Fn {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
48		fnresi 6621	. . . . . . . . . . 11 ⊢ ( I ↾ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) Fn {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}
49	48	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → ( I ↾ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) Fn {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
50	13	psrbagf 21908	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} → 𝑑:𝐼⟶ℕ₀)
51	50	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑑:𝐼⟶ℕ₀)
52	51	ffvelcdmda 7030	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑖 ∈ 𝐼) → (𝑑‘𝑖) ∈ ℕ₀)
53	52	nn0cnd 12491	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑖 ∈ 𝐼) → (𝑑‘𝑖) ∈ ℂ)
54		ax-1cn 11087	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℂ
55		0cn 11127	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℂ
56	54, 55	ifcli 4515	. . . . . . . . . . . . . . 15 ⊢ if(𝑖 = 𝑋, 1, 0) ∈ ℂ
57	56	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑖 ∈ 𝐼) → if(𝑖 = 𝑋, 1, 0) ∈ ℂ)
58	53, 57	pncand 11497	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑖 ∈ 𝐼) → (((𝑑‘𝑖) + if(𝑖 = 𝑋, 1, 0)) − if(𝑖 = 𝑋, 1, 0)) = (𝑑‘𝑖))
59	58	mpteq2dva 5179	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑖 ∈ 𝐼 ↦ (((𝑑‘𝑖) + if(𝑖 = 𝑋, 1, 0)) − if(𝑖 = 𝑋, 1, 0))) = (𝑖 ∈ 𝐼 ↦ (𝑑‘𝑖)))
60		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
61	27	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
62	13	psrbagaddcl 21914	. . . . . . . . . . . . . . 15 ⊢ ((𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ∧ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
63	60, 61, 62	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
64	13	psrbagf 21908	. . . . . . . . . . . . . . 15 ⊢ ((𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} → (𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))):𝐼⟶ℕ₀)
65	64	ffnd 6663	. . . . . . . . . . . . . 14 ⊢ ((𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} → (𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) Fn 𝐼)
66	63, 65	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) Fn 𝐼)
67		1ex 11131	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ V
68		c0ex 11129	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ V
69	67, 68	ifex 4518	. . . . . . . . . . . . . . 15 ⊢ if(𝑦 = 𝑋, 1, 0) ∈ V
70		eqid 2737	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))
71	69, 70	fnmpti 6635	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) Fn 𝐼
72	71	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) Fn 𝐼)
73	25	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝐼 ∈ V)
74		inidm 4168	. . . . . . . . . . . . 13 ⊢ (𝐼 ∩ 𝐼) = 𝐼
75	50	ffnd 6663	. . . . . . . . . . . . . . 15 ⊢ (𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} → 𝑑 Fn 𝐼)
76	75	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑑 Fn 𝐼)
77		eqidd 2738	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑖 ∈ 𝐼) → (𝑑‘𝑖) = (𝑑‘𝑖))
78		eqeq1 2741	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑖 → (𝑦 = 𝑋 ↔ 𝑖 = 𝑋))
79	78	ifbid 4491	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑖 → if(𝑦 = 𝑋, 1, 0) = if(𝑖 = 𝑋, 1, 0))
80		simpr 484	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑖 ∈ 𝐼) → 𝑖 ∈ 𝐼)
81	67, 68	ifex 4518	. . . . . . . . . . . . . . . 16 ⊢ if(𝑖 = 𝑋, 1, 0) ∈ V
82	81	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑖 ∈ 𝐼) → if(𝑖 = 𝑋, 1, 0) ∈ V)
83	70, 79, 80, 82	fvmptd3 6965	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑖 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))‘𝑖) = if(𝑖 = 𝑋, 1, 0))
84	76, 72, 73, 73, 74, 77, 83	ofval 7635	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑖 ∈ 𝐼) → ((𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))‘𝑖) = ((𝑑‘𝑖) + if(𝑖 = 𝑋, 1, 0)))
85	66, 72, 73, 73, 74, 84, 83	offval 7633	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → ((𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑖 ∈ 𝐼 ↦ (((𝑑‘𝑖) + if(𝑖 = 𝑋, 1, 0)) − if(𝑖 = 𝑋, 1, 0))))
86	51	feqmptd 6902	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑑 = (𝑖 ∈ 𝐼 ↦ (𝑑‘𝑖)))
87	59, 85, 86	3eqtr4d 2782	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → ((𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = 𝑑)
88	30	adantlr 716	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
89	88	fmpttd 7061	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))):{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}⟶{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
90	89, 60	fvco3d 6934	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) ∘ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))‘𝑑) = ((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))‘((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))‘𝑑)))
91		eqid 2737	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) = (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
92		oveq1 7367	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑑 → (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
93		ovexd 7395	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ V)
94	91, 92, 60, 93	fvmptd3 6965	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → ((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))‘𝑑) = (𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
95	94	fveq2d 6838	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → ((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))‘((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))‘𝑑)) = ((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))‘(𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))
96		oveq1 7367	. . . . . . . . . . . . 13 ⊢ (𝑏 = (𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) → (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = ((𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
97		ovexd 7395	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → ((𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ V)
98	41, 96, 63, 97	fvmptd3 6965	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → ((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))‘(𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) = ((𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
99	90, 95, 98	3eqtrd 2776	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) ∘ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))‘𝑑) = ((𝑑 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
100		fvresi 7121	. . . . . . . . . . . 12 ⊢ (𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} → (( I ↾ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})‘𝑑) = 𝑑)
101	100	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (( I ↾ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})‘𝑑) = 𝑑)
102	87, 99, 101	3eqtr4d 2782	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) ∘ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))‘𝑑) = (( I ↾ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})‘𝑑))
103	47, 49, 102	eqfnfvd 6980	. . . . . . . . 9 ⊢ (𝜑 → ((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) ∘ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) = ( I ↾ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}))
104		fcof1 7235	. . . . . . . . 9 ⊢ (((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))):{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}⟶{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ∧ ((𝑏 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑏 ∘_f − (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) ∘ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) = ( I ↾ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})) → (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))):{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}–1-1→{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
105	39, 103, 104	syl2anc 585	. . . . . . . 8 ⊢ (𝜑 → (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))):{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}–1-1→{ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
106	38, 105, 19, 10	fsuppco 9308	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∘ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) finSupp (0_g‘𝑅))
107	36, 106	eqbrtrrd 5110	. . . . . 6 ⊢ (𝜑 → (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) finSupp (0_g‘𝑅))
108	107	fsuppimpd 9275	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) supp (0_g‘𝑅)) ∈ Fin)
109		ssidd 3946	. . . . . 6 ⊢ (𝜑 → ((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) supp (0_g‘𝑅)) ⊆ ((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) supp (0_g‘𝑅)))
110		eqid 2737	. . . . . . . 8 ⊢ (._g‘𝑅) = (._g‘𝑅)
111	32, 110, 37	mulgnn0z 19068	. . . . . . 7 ⊢ ((𝑅 ∈ Mnd ∧ 𝑛 ∈ ℕ₀) → (𝑛(._g‘𝑅)(0_g‘𝑅)) = (0_g‘𝑅))
112	3, 111	sylan 581	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → (𝑛(._g‘𝑅)(0_g‘𝑅)) = (0_g‘𝑅))
113	13	psrbagf 21908	. . . . . . . . 9 ⊢ (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} → 𝑘:𝐼⟶ℕ₀)
114	113	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑘:𝐼⟶ℕ₀)
115	6	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑋 ∈ 𝐼)
116	114, 115	ffvelcdmd 7031	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑘‘𝑋) ∈ ℕ₀)
117		peano2nn0 12468	. . . . . . 7 ⊢ ((𝑘‘𝑋) ∈ ℕ₀ → ((𝑘‘𝑋) + 1) ∈ ℕ₀)
118	116, 117	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → ((𝑘‘𝑋) + 1) ∈ ℕ₀)
119		fvexd 6849	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) ∈ V)
120	109, 112, 118, 119, 19	suppssov2 8141	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑋) + 1)(._g‘𝑅)(𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))) supp (0_g‘𝑅)) ⊆ ((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) supp (0_g‘𝑅)))
121	108, 120	ssfid 9172	. . . 4 ⊢ (𝜑 → ((𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑋) + 1)(._g‘𝑅)(𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))) supp (0_g‘𝑅)) ∈ Fin)
122	18, 19, 21, 121	isfsuppd 9272	. . 3 ⊢ (𝜑 → (𝑘 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑋) + 1)(._g‘𝑅)(𝐹‘(𝑘 ∘_f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))) finSupp (0_g‘𝑅))
123	14, 122	eqbrtrd 5108	. 2 ⊢ (𝜑 → (((𝐼 mPSDer 𝑅)‘𝑋)‘𝐹) finSupp (0_g‘𝑅))
124	7, 1, 2, 37, 8	mplelbas 21979	. 2 ⊢ ((((𝐼 mPSDer 𝑅)‘𝑋)‘𝐹) ∈ 𝐵 ↔ ((((𝐼 mPSDer 𝑅)‘𝑋)‘𝐹) ∈ (Base‘(𝐼 mPwSer 𝑅)) ∧ (((𝐼 mPSDer 𝑅)‘𝑋)‘𝐹) finSupp (0_g‘𝑅)))
125	12, 123, 124	sylanbrc 584	1 ⊢ (𝜑 → (((𝐼 mPSDer 𝑅)‘𝑋)‘𝐹) ∈ 𝐵)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3390 Vcvv 3430 ifcif 4467 class class class wbr 5086 ↦ cmpt 5167 I cid 5518 ^◡ccnv 5623 ran crn 5625 ↾ cres 5626 “ cima 5627 ∘ ccom 5628 Fun wfun 6486 Fn wfn 6487 ⟶wf 6488 –1-1→wf1 6489 ‘cfv 6492 (class class class)co 7360 ∘_f cof 7622 supp csupp 8103 ↑_m cmap 8766 Fincfn 8886 finSupp cfsupp 9267 ℂcc 11027 0cc0 11029 1c1 11030 + caddc 11032 − cmin 11368 ℕcn 12165 ℕ₀cn0 12428 Basecbs 17170 0_gc0g 17393 Mgmcmgm 18597 Mndcmnd 18693 ._gcmg 19034 mPwSer cmps 21894 mPoly cmpl 21896 mPSDer cpsd 22106

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-iun 4936 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-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-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 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-er 8636 df-map 8768 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-fsupp 9268 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-uz 12780 df-fz 13453 df-seq 13955 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-tset 17230 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-mulg 19035 df-psr 21899 df-mpl 21901 df-psd 22132

This theorem is referenced by: (None)

W3C validator