Theorem mplmonmul 22058

Description: The product of two monomials adds the exponent vectors together. For example, the product of (𝑥↑2)(𝑦↑2) with (𝑦↑1)(𝑧↑3) is (𝑥↑2)(𝑦↑3)(𝑧↑3), where the exponent vectors ⟨2, 2, 0⟩ and ⟨0, 1, 3⟩ are added to give ⟨2, 3, 3⟩. (Contributed by Mario Carneiro, 9-Jan-2015.)

Hypotheses

Ref	Expression
mplmon.s	⊢ 𝑃 = (𝐼 mPoly 𝑅)
mplmon.b	⊢ 𝐵 = (Base‘𝑃)
mplmon.z	⊢ 0 = (0g‘𝑅)
mplmon.o	⊢ 1 = (1r‘𝑅)
mplmon.d	⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}
mplmon.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
mplmon.r	⊢ (𝜑 → 𝑅 ∈ Ring)
mplmon.x	⊢ (𝜑 → 𝑋 ∈ 𝐷)
mplmonmul.t	⊢ · = (.r‘𝑃)
mplmonmul.x	⊢ (𝜑 → 𝑌 ∈ 𝐷)

Assertion

Ref	Expression
mplmonmul	⊢ (𝜑 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) · (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), 1 , 0 )))

Distinct variable groups:   𝑦,𝐷   𝑓,𝐼   𝜑,𝑦   𝑦,𝑓,𝑋   𝑦, 0   𝑦, 1   𝑦,𝑅   𝑓,𝑌,𝑦

Allowed substitution hints:   𝜑(𝑓)   𝐵(𝑦,𝑓)   𝐷(𝑓)   𝑃(𝑦,𝑓)   𝑅(𝑓)   · (𝑦,𝑓)   1 (𝑓)   𝐼(𝑦)   𝑊(𝑦,𝑓)   0 (𝑓)

Proof of Theorem mplmonmul

Dummy variables 𝑗 𝑘 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mplmon.s	. . 3 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
2		mplmon.b	. . 3 ⊢ 𝐵 = (Base‘𝑃)
3		eqid 2752	. . 3 ⊢ (.r‘𝑅) = (.r‘𝑅)
4		mplmonmul.t	. . 3 ⊢ · = (.r‘𝑃)
5		mplmon.d	. . 3 ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}
6		mplmon.z	. . . 4 ⊢ 0 = (0g‘𝑅)
7		mplmon.o	. . . 4 ⊢ 1 = (1r‘𝑅)
8		mplmon.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
9		mplmon.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Ring)
10		mplmon.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐷)
11	1, 2, 6, 7, 5, 8, 9, 10	mplmon 22057	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ 𝐵)
12		mplmonmul.x	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐷)
13	1, 2, 6, 7, 5, 8, 9, 12	mplmon 22057	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 )) ∈ 𝐵)
14	1, 2, 3, 4, 5, 11, 13	mplmul 22031	. 2 ⊢ (𝜑 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) · (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))) = (𝑘 ∈ 𝐷 ↦ (𝑅 Σg (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))))))
15		eqeq1 2756	. . . . 5 ⊢ (𝑦 = 𝑘 → (𝑦 = (𝑋 ∘f + 𝑌) ↔ 𝑘 = (𝑋 ∘f + 𝑌)))
16	15	ifbid 4494	. . . 4 ⊢ (𝑦 = 𝑘 → if(𝑦 = (𝑋 ∘f + 𝑌), 1 , 0 ) = if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ))
17	16	cbvmptv 5194	. . 3 ⊢ (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), 1 , 0 )) = (𝑘 ∈ 𝐷 ↦ if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ))
18		simpr 487	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
19	18	snssd 4735	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → {𝑋} ⊆ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
20	19	resmptd 6015	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋}) = (𝑗 ∈ {𝑋} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))))
21	20	oveq2d 7397	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑅 Σg ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋})) = (𝑅 Σg (𝑗 ∈ {𝑋} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))))))
22	9	ad2antrr 734	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑅 ∈ Ring)
23		ringmnd 20261	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Mnd)
24	22, 23	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑅 ∈ Mnd)
25	10	ad2antrr 734	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑋 ∈ 𝐷)
26		iftrue 4476	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑋 → if(𝑦 = 𝑋, 1 , 0 ) = 1 )
27		eqid 2752	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))
28	7	fvexi 6866	. . . . . . . . . . . . 13 ⊢ 1 ∈ V
29	26, 27, 28	fvmpt 6960	. . . . . . . . . . . 12 ⊢ (𝑋 ∈ 𝐷 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋) = 1 )
30	25, 29	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋) = 1 )
31		ssrab2 4024	. . . . . . . . . . . . 13 ⊢ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ⊆ 𝐷
32		simplr 776	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑘 ∈ 𝐷)
33		eqid 2752	. . . . . . . . . . . . . . 15 ⊢ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} = {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}
34	5, 33	psrbagconcl 21948	. . . . . . . . . . . . . 14 ⊢ ((𝑘 ∈ 𝐷 ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑋) ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
35	32, 18, 34	syl2anc 592	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑋) ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
36	31, 35	sselid 3925	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑋) ∈ 𝐷)
37		eqeq1 2756	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑘 ∘f − 𝑋) → (𝑦 = 𝑌 ↔ (𝑘 ∘f − 𝑋) = 𝑌))
38	37	ifbid 4494	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑘 ∘f − 𝑋) → if(𝑦 = 𝑌, 1 , 0 ) = if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ))
39		eqid 2752	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 )) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))
40	6	fvexi 6866	. . . . . . . . . . . . . 14 ⊢ 0 ∈ V
41	28, 40	ifex 4521	. . . . . . . . . . . . 13 ⊢ if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ) ∈ V
42	38, 39, 41	fvmpt 6960	. . . . . . . . . . . 12 ⊢ ((𝑘 ∘f − 𝑋) ∈ 𝐷 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋)) = if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ))
43	36, 42	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋)) = if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ))
44	30, 43	oveq12d 7399	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋))) = ( 1 (.r‘𝑅)if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 )))
45		eqid 2752	. . . . . . . . . . . . . 14 ⊢ (Base‘𝑅) = (Base‘𝑅)
46	45, 7	ringidcl 20283	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ Ring → 1 ∈ (Base‘𝑅))
47	45, 6	ring0cl 20285	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ Ring → 0 ∈ (Base‘𝑅))
48	46, 47	ifcld 4517	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ Ring → if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ) ∈ (Base‘𝑅))
49	22, 48	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ) ∈ (Base‘𝑅))
50	45, 3, 7	ringlidm 20287	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ) ∈ (Base‘𝑅)) → ( 1 (.r‘𝑅)if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 )) = if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ))
51	22, 49, 50	syl2anc 592	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ( 1 (.r‘𝑅)if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 )) = if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ))
52	5	psrbagf 21939	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ 𝐷 → 𝑘:𝐼⟶ℕ0)
53	32, 52	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑘:𝐼⟶ℕ0)
54	53	ffvelcdmda 7050	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) ∧ 𝑧 ∈ 𝐼) → (𝑘‘𝑧) ∈ ℕ0)
55	10	adantr 483	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝑋 ∈ 𝐷)
56	5	psrbagf 21939	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑋 ∈ 𝐷 → 𝑋:𝐼⟶ℕ0)
57	55, 56	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝑋:𝐼⟶ℕ0)
58	57	ffvelcdmda 7050	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑧 ∈ 𝐼) → (𝑋‘𝑧) ∈ ℕ0)
59	58	adantlr 723	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) ∧ 𝑧 ∈ 𝐼) → (𝑋‘𝑧) ∈ ℕ0)
60	5	psrbagf 21939	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑌 ∈ 𝐷 → 𝑌:𝐼⟶ℕ0)
61	12, 60	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝑌:𝐼⟶ℕ0)
62	61	adantr 483	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝑌:𝐼⟶ℕ0)
63	62	ffvelcdmda 7050	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑧 ∈ 𝐼) → (𝑌‘𝑧) ∈ ℕ0)
64	63	adantlr 723	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) ∧ 𝑧 ∈ 𝐼) → (𝑌‘𝑧) ∈ ℕ0)
65		nn0cn 12477	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘‘𝑧) ∈ ℕ0 → (𝑘‘𝑧) ∈ ℂ)
66		nn0cn 12477	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑋‘𝑧) ∈ ℕ0 → (𝑋‘𝑧) ∈ ℂ)
67		nn0cn 12477	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑌‘𝑧) ∈ ℕ0 → (𝑌‘𝑧) ∈ ℂ)
68		subadd 11419	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑘‘𝑧) ∈ ℂ ∧ (𝑋‘𝑧) ∈ ℂ ∧ (𝑌‘𝑧) ∈ ℂ) → (((𝑘‘𝑧) − (𝑋‘𝑧)) = (𝑌‘𝑧) ↔ ((𝑋‘𝑧) + (𝑌‘𝑧)) = (𝑘‘𝑧)))
69	65, 66, 67, 68	syl3an 1169	. . . . . . . . . . . . . . . 16 ⊢ (((𝑘‘𝑧) ∈ ℕ0 ∧ (𝑋‘𝑧) ∈ ℕ0 ∧ (𝑌‘𝑧) ∈ ℕ0) → (((𝑘‘𝑧) − (𝑋‘𝑧)) = (𝑌‘𝑧) ↔ ((𝑋‘𝑧) + (𝑌‘𝑧)) = (𝑘‘𝑧)))
70	54, 59, 64, 69	syl3anc 1382	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) ∧ 𝑧 ∈ 𝐼) → (((𝑘‘𝑧) − (𝑋‘𝑧)) = (𝑌‘𝑧) ↔ ((𝑋‘𝑧) + (𝑌‘𝑧)) = (𝑘‘𝑧)))
71		eqcom 2759	. . . . . . . . . . . . . . 15 ⊢ (((𝑋‘𝑧) + (𝑌‘𝑧)) = (𝑘‘𝑧) ↔ (𝑘‘𝑧) = ((𝑋‘𝑧) + (𝑌‘𝑧)))
72	70, 71	bitrdi 289	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) ∧ 𝑧 ∈ 𝐼) → (((𝑘‘𝑧) − (𝑋‘𝑧)) = (𝑌‘𝑧) ↔ (𝑘‘𝑧) = ((𝑋‘𝑧) + (𝑌‘𝑧))))
73	72	ralbidva 3173	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (∀𝑧 ∈ 𝐼 ((𝑘‘𝑧) − (𝑋‘𝑧)) = (𝑌‘𝑧) ↔ ∀𝑧 ∈ 𝐼 (𝑘‘𝑧) = ((𝑋‘𝑧) + (𝑌‘𝑧))))
74		mpteqb 6980	. . . . . . . . . . . . . 14 ⊢ (∀𝑧 ∈ 𝐼 ((𝑘‘𝑧) − (𝑋‘𝑧)) ∈ V → ((𝑧 ∈ 𝐼 ↦ ((𝑘‘𝑧) − (𝑋‘𝑧))) = (𝑧 ∈ 𝐼 ↦ (𝑌‘𝑧)) ↔ ∀𝑧 ∈ 𝐼 ((𝑘‘𝑧) − (𝑋‘𝑧)) = (𝑌‘𝑧)))
75		ovexd 7416	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝐼 → ((𝑘‘𝑧) − (𝑋‘𝑧)) ∈ V)
76	74, 75	mprg 3072	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝐼 ↦ ((𝑘‘𝑧) − (𝑋‘𝑧))) = (𝑧 ∈ 𝐼 ↦ (𝑌‘𝑧)) ↔ ∀𝑧 ∈ 𝐼 ((𝑘‘𝑧) − (𝑋‘𝑧)) = (𝑌‘𝑧))
77		mpteqb 6980	. . . . . . . . . . . . . 14 ⊢ (∀𝑧 ∈ 𝐼 (𝑘‘𝑧) ∈ V → ((𝑧 ∈ 𝐼 ↦ (𝑘‘𝑧)) = (𝑧 ∈ 𝐼 ↦ ((𝑋‘𝑧) + (𝑌‘𝑧))) ↔ ∀𝑧 ∈ 𝐼 (𝑘‘𝑧) = ((𝑋‘𝑧) + (𝑌‘𝑧))))
78		fvexd 6867	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝐼 → (𝑘‘𝑧) ∈ V)
79	77, 78	mprg 3072	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝐼 ↦ (𝑘‘𝑧)) = (𝑧 ∈ 𝐼 ↦ ((𝑋‘𝑧) + (𝑌‘𝑧))) ↔ ∀𝑧 ∈ 𝐼 (𝑘‘𝑧) = ((𝑋‘𝑧) + (𝑌‘𝑧)))
80	73, 76, 79	3bitr4g 316	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ((𝑧 ∈ 𝐼 ↦ ((𝑘‘𝑧) − (𝑋‘𝑧))) = (𝑧 ∈ 𝐼 ↦ (𝑌‘𝑧)) ↔ (𝑧 ∈ 𝐼 ↦ (𝑘‘𝑧)) = (𝑧 ∈ 𝐼 ↦ ((𝑋‘𝑧) + (𝑌‘𝑧)))))
81	8	ad2antrr 734	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝐼 ∈ 𝑊)
82	53	feqmptd 6920	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑘 = (𝑧 ∈ 𝐼 ↦ (𝑘‘𝑧)))
83	57	feqmptd 6920	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝑋 = (𝑧 ∈ 𝐼 ↦ (𝑋‘𝑧)))
84	83	adantr 483	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑋 = (𝑧 ∈ 𝐼 ↦ (𝑋‘𝑧)))
85	81, 54, 59, 82, 84	offval2 7665	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑋) = (𝑧 ∈ 𝐼 ↦ ((𝑘‘𝑧) − (𝑋‘𝑧))))
86	62	feqmptd 6920	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝑌 = (𝑧 ∈ 𝐼 ↦ (𝑌‘𝑧)))
87	86	adantr 483	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑌 = (𝑧 ∈ 𝐼 ↦ (𝑌‘𝑧)))
88	85, 87	eqeq12d 2768	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ((𝑘 ∘f − 𝑋) = 𝑌 ↔ (𝑧 ∈ 𝐼 ↦ ((𝑘‘𝑧) − (𝑋‘𝑧))) = (𝑧 ∈ 𝐼 ↦ (𝑌‘𝑧))))
89	8	adantr 483	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝐼 ∈ 𝑊)
90	89, 58, 63, 83, 86	offval2 7665	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → (𝑋 ∘f + 𝑌) = (𝑧 ∈ 𝐼 ↦ ((𝑋‘𝑧) + (𝑌‘𝑧))))
91	90	adantr 483	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑋 ∘f + 𝑌) = (𝑧 ∈ 𝐼 ↦ ((𝑋‘𝑧) + (𝑌‘𝑧))))
92	82, 91	eqeq12d 2768	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑘 = (𝑋 ∘f + 𝑌) ↔ (𝑧 ∈ 𝐼 ↦ (𝑘‘𝑧)) = (𝑧 ∈ 𝐼 ↦ ((𝑋‘𝑧) + (𝑌‘𝑧)))))
93	80, 88, 92	3bitr4d 313	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ((𝑘 ∘f − 𝑋) = 𝑌 ↔ 𝑘 = (𝑋 ∘f + 𝑌)))
94	93	ifbid 4494	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → if((𝑘 ∘f − 𝑋) = 𝑌, 1 , 0 ) = if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ))
95	44, 51, 94	3eqtrd 2791	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋))) = if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ))
96	94, 49	eqeltrrd 2853	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ) ∈ (Base‘𝑅))
97	95, 96	eqeltrd 2852	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋))) ∈ (Base‘𝑅))
98		fveq2 6852	. . . . . . . . . 10 ⊢ (𝑗 = 𝑋 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗) = ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋))
99		oveq2 7389	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑋 → (𝑘 ∘f − 𝑗) = (𝑘 ∘f − 𝑋))
100	99	fveq2d 6856	. . . . . . . . . 10 ⊢ (𝑗 = 𝑋 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)) = ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋)))
101	98, 100	oveq12d 7399	. . . . . . . . 9 ⊢ (𝑗 = 𝑋 → (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))) = (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋))))
102	45, 101	gsumsn 19966	. . . . . . . 8 ⊢ ((𝑅 ∈ Mnd ∧ 𝑋 ∈ 𝐷 ∧ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋))) ∈ (Base‘𝑅)) → (𝑅 Σg (𝑗 ∈ {𝑋} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))))) = (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋))))
103	24, 25, 97, 102	syl3anc 1382	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑅 Σg (𝑗 ∈ {𝑋} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))))) = (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑋)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑋))))
104	21, 103, 95	3eqtrd 2791	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑅 Σg ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋})) = if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ))
105	6	gsum0 18690	. . . . . . 7 ⊢ (𝑅 Σg ∅) = 0
106		disjsn 4660	. . . . . . . . 9 ⊢ (({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∩ {𝑋}) = ∅ ↔ ¬ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
107	9	ad2antrr 734	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑅 ∈ Ring)
108	1, 45, 2, 5, 11	mplelf 22018	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )):𝐷⟶(Base‘𝑅))
109	108	ad2antrr 734	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )):𝐷⟶(Base‘𝑅))
110		simpr 487	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
111	31, 110	sselid 3925	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑗 ∈ 𝐷)
112	109, 111	ffvelcdmd 7051	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗) ∈ (Base‘𝑅))
113	1, 45, 2, 5, 13	mplelf 22018	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 )):𝐷⟶(Base‘𝑅))
114	113	ad2antrr 734	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 )):𝐷⟶(Base‘𝑅))
115		simplr 776	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → 𝑘 ∈ 𝐷)
116	5, 33	psrbagconcl 21948	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 ∈ 𝐷 ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑗) ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
117	115, 110, 116	syl2anc 592	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑗) ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
118	31, 117	sselid 3925	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑘 ∘f − 𝑗) ∈ 𝐷)
119	114, 118	ffvelcdmd 7051	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)) ∈ (Base‘𝑅))
120	45, 3	ringcl 20268	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ Ring ∧ ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗) ∈ (Base‘𝑅) ∧ ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)) ∈ (Base‘𝑅)) → (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))) ∈ (Base‘𝑅))
121	107, 112, 119, 120	syl3anc 1382	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))) ∈ (Base‘𝑅))
122	121	fmpttd 7081	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))):{𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}⟶(Base‘𝑅))
123		ffn 6676	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))):{𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}⟶(Base‘𝑅) → (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) Fn {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
124		fnresdisj 6626	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) Fn {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} → (({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∩ {𝑋}) = ∅ ↔ ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋}) = ∅))
125	122, 123, 124	3syl 18	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → (({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∩ {𝑋}) = ∅ ↔ ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋}) = ∅))
126	125	biimpa 479	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∩ {𝑋}) = ∅) → ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋}) = ∅)
127	106, 126	sylan2br 603	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ ¬ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋}) = ∅)
128	127	oveq2d 7397	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ ¬ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑅 Σg ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋})) = (𝑅 Σg ∅))
129		breq1 5093	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝑥 ∘r ≤ (𝑋 ∘f + 𝑌) ↔ 𝑋 ∘r ≤ (𝑋 ∘f + 𝑌)))
130	58	nn0red 12529	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑧 ∈ 𝐼) → (𝑋‘𝑧) ∈ ℝ)
131		nn0addge1 12513	. . . . . . . . . . . . . 14 ⊢ (((𝑋‘𝑧) ∈ ℝ ∧ (𝑌‘𝑧) ∈ ℕ0) → (𝑋‘𝑧) ≤ ((𝑋‘𝑧) + (𝑌‘𝑧)))
132	130, 63, 131	syl2anc 592	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑧 ∈ 𝐼) → (𝑋‘𝑧) ≤ ((𝑋‘𝑧) + (𝑌‘𝑧)))
133	132	ralrimiva 3144	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → ∀𝑧 ∈ 𝐼 (𝑋‘𝑧) ≤ ((𝑋‘𝑧) + (𝑌‘𝑧)))
134		ovexd 7416	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑧 ∈ 𝐼) → ((𝑋‘𝑧) + (𝑌‘𝑧)) ∈ V)
135	89, 58, 134, 83, 90	ofrfval2 7666	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → (𝑋 ∘r ≤ (𝑋 ∘f + 𝑌) ↔ ∀𝑧 ∈ 𝐼 (𝑋‘𝑧) ≤ ((𝑋‘𝑧) + (𝑌‘𝑧))))
136	133, 135	mpbird 259	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝑋 ∘r ≤ (𝑋 ∘f + 𝑌))
137	129, 55, 136	elrabd 3643	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝑋 ∘f + 𝑌)})
138		breq2 5094	. . . . . . . . . . . 12 ⊢ (𝑘 = (𝑋 ∘f + 𝑌) → (𝑥 ∘r ≤ 𝑘 ↔ 𝑥 ∘r ≤ (𝑋 ∘f + 𝑌)))
139	138	rabbidv 3411	. . . . . . . . . . 11 ⊢ (𝑘 = (𝑋 ∘f + 𝑌) → {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} = {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝑋 ∘f + 𝑌)})
140	139	eleq2d 2838	. . . . . . . . . 10 ⊢ (𝑘 = (𝑋 ∘f + 𝑌) → (𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↔ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝑋 ∘f + 𝑌)}))
141	137, 140	syl5ibrcom 249	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → (𝑘 = (𝑋 ∘f + 𝑌) → 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}))
142	141	con3dimp 411	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ ¬ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ¬ 𝑘 = (𝑋 ∘f + 𝑌))
143	142	iffalsed 4481	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ ¬ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ) = 0 )
144	105, 128, 143	3eqtr4a 2813	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ ¬ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → (𝑅 Σg ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋})) = if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ))
145	104, 144	pm2.61dan 820	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → (𝑅 Σg ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋})) = if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ))
146	9	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝑅 ∈ Ring)
147		ringcmn 20300	. . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ CMnd)
148	146, 147	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝑅 ∈ CMnd)
149	5	psrbaglefi 21947	. . . . . . 7 ⊢ (𝑘 ∈ 𝐷 → {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∈ Fin)
150	149	adantl 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∈ Fin)
151		ssdif 4088	. . . . . . . . . . . 12 ⊢ ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ⊆ 𝐷 → ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∖ {𝑋}) ⊆ (𝐷 ∖ {𝑋}))
152	31, 151	ax-mp 5	. . . . . . . . . . 11 ⊢ ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∖ {𝑋}) ⊆ (𝐷 ∖ {𝑋})
153	152	sseli 3923	. . . . . . . . . 10 ⊢ (𝑗 ∈ ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∖ {𝑋}) → 𝑗 ∈ (𝐷 ∖ {𝑋}))
154	108	adantr 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )):𝐷⟶(Base‘𝑅))
155		eldifsni 4740	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ (𝐷 ∖ {𝑋}) → 𝑦 ≠ 𝑋)
156	155	adantl 484	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑦 ∈ (𝐷 ∖ {𝑋})) → 𝑦 ≠ 𝑋)
157	156	neneqd 2952	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑦 ∈ (𝐷 ∖ {𝑋})) → ¬ 𝑦 = 𝑋)
158	157	iffalsed 4481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑦 ∈ (𝐷 ∖ {𝑋})) → if(𝑦 = 𝑋, 1 , 0 ) = 0 )
159		ovex 7414	. . . . . . . . . . . . . 14 ⊢ (ℕ0 ↑m 𝐼) ∈ V
160	5, 159	rabex2 5287	. . . . . . . . . . . . 13 ⊢ 𝐷 ∈ V
161	160	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 𝐷 ∈ V)
162	158, 161	suppss2 8164	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) supp 0 ) ⊆ {𝑋})
163	40	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → 0 ∈ V)
164	154, 162, 161, 163	suppssr 8159	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ (𝐷 ∖ {𝑋})) → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗) = 0 )
165	153, 164	sylan2 601	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∖ {𝑋})) → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗) = 0 )
166	165	oveq1d 7396	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∖ {𝑋})) → (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))) = ( 0 (.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))))
167		eldifi 4075	. . . . . . . . 9 ⊢ (𝑗 ∈ ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∖ {𝑋}) → 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘})
168	45, 3, 6	ringlz 20311	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)) ∈ (Base‘𝑅)) → ( 0 (.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))) = 0 )
169	107, 119, 168	syl2anc 592	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘}) → ( 0 (.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))) = 0 )
170	167, 169	sylan2 601	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∖ {𝑋})) → ( 0 (.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))) = 0 )
171	166, 170	eqtrd 2787	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐷) ∧ 𝑗 ∈ ({𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∖ {𝑋})) → (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))) = 0 )
172	160	rabex 5285	. . . . . . . 8 ⊢ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∈ V
173	172	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ∈ V)
174	171, 173	suppss2 8164	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) supp 0 ) ⊆ {𝑋})
175	160	mptrabex 7194	. . . . . . . . 9 ⊢ (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ∈ V
176		funmpt 6544	. . . . . . . . 9 ⊢ Fun (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))))
177	175, 176, 40	3pm3.2i 1349	. . . . . . . 8 ⊢ ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ∈ V ∧ Fun (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ∧ 0 ∈ V)
178	177	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ∈ V ∧ Fun (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ∧ 0 ∈ V))
179		snfi 9009	. . . . . . . 8 ⊢ {𝑋} ∈ Fin
180	179	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → {𝑋} ∈ Fin)
181		suppssfifsupp 9312	. . . . . . 7 ⊢ ((((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ∈ V ∧ Fun (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ∧ 0 ∈ V) ∧ ({𝑋} ∈ Fin ∧ ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) supp 0 ) ⊆ {𝑋})) → (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) finSupp 0 )
182	178, 180, 174, 181	syl12anc 845	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) finSupp 0 )
183	45, 6, 148, 150, 122, 174, 182	gsumres 19925	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → (𝑅 Σg ((𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))) ↾ {𝑋})) = (𝑅 Σg (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))))))
184	145, 183	eqtr3d 2789	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐷) → if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 ) = (𝑅 Σg (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗))))))
185	184	mpteq2dva 5183	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐷 ↦ if(𝑘 = (𝑋 ∘f + 𝑌), 1 , 0 )) = (𝑘 ∈ 𝐷 ↦ (𝑅 Σg (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))))))
186	17, 185	eqtrid 2799	. 2 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), 1 , 0 )) = (𝑘 ∈ 𝐷 ↦ (𝑅 Σg (𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ 𝑘} ↦ (((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))‘𝑗)(.r‘𝑅)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))‘(𝑘 ∘f − 𝑗)))))))
187	14, 186	eqtr4d 2790	1 ⊢ (𝜑 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) · (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 1 , 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), 1 , 0 )))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1095   = wceq 1550   ∈ wcel 2132   ≠ wne 2947  ∀wral 3066  {crab 3404  Vcvv 3444   ∖ cdif 3892   ∩ cin 3894   ⊆ wss 3895  ∅c0 4276  ifcif 4470  {csn 4572   class class class wbr 5090   ↦ cmpt 5171  ^◡ccnv 5635   ↾ cres 5638   “ cima 5639  Fun wfun 6500   Fn wfn 6501  ⟶wf 6502  ‘cfv 6506  (class class class)co 7381   ∘_f cof 7643   ∘_r cofr 7644   supp csupp 8124   ↑_m cmap 8792  Fincfn 8912   finSupp cfsupp 9293  ℂcc 11057  ℝcr 11058   + caddc 11062   ≤ cle 11203   − cmin 11400  ℕcn 12196  ℕ₀cn0 12467  Basecbs 17217  ._rcmulr 17259  0_gc0g 17440   Σ_g cgsu 17441  Mndcmnd 18740  CMndccmn 19792  1_rcur 20199  Ringcrg 20251   mPoly cmpl 21927

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pow 5312  ax-pr 5380  ax-un 7703  ax-cnex 11115  ax-resscn 11116  ax-1cn 11117  ax-icn 11118  ax-addcl 11119  ax-addrcl 11120  ax-mulcl 11121  ax-mulrcl 11122  ax-mulcom 11123  ax-addass 11124  ax-mulass 11125  ax-distr 11126  ax-i2m1 11127  ax-1ne0 11128  ax-1rid 11129  ax-rnegex 11130  ax-rrecex 11131  ax-cnre 11132  ax-pre-lttri 11133  ax-pre-lttrn 11134  ax-pre-ltadd 11135  ax-pre-mulgt0 11136

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-nel 3052  df-ral 3067  df-rex 3077  df-rmo 3357  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-pss 3915  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-tp 4577  df-op 4579  df-uni 4856  df-int 4896  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-tr 5198  df-id 5531  df-eprel 5536  df-po 5544  df-so 5545  df-fr 5589  df-se 5590  df-we 5591  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-pred 6273  df-ord 6334  df-on 6335  df-lim 6336  df-suc 6337  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-isom 6515  df-riota 7338  df-ov 7384  df-oprab 7385  df-mpo 7386  df-of 7645  df-ofr 7646  df-om 7832  df-1st 7955  df-2nd 7956  df-supp 8125  df-frecs 8246  df-wrecs 8277  df-recs 8326  df-rdg 8365  df-1o 8421  df-er 8662  df-map 8794  df-pm 8795  df-ixp 8865  df-en 8913  df-dom 8914  df-sdom 8915  df-fin 8916  df-fsupp 9294  df-oi 9444  df-card 9883  df-pnf 11204  df-mnf 11205  df-xr 11206  df-ltxr 11207  df-le 11208  df-sub 11402  df-neg 11403  df-nn 12197  df-2 12266  df-3 12267  df-4 12268  df-5 12269  df-6 12270  df-7 12271  df-8 12272  df-9 12273  df-n0 12468  df-z 12555  df-uz 12826  df-fz 13499  df-fzo 13646  df-seq 14001  df-hash 14330  df-struct 17155  df-sets 17172  df-slot 17190  df-ndx 17202  df-base 17218  df-ress 17239  df-plusg 17271  df-mulr 17272  df-sca 17274  df-vsca 17275  df-tset 17277  df-0g 17442  df-gsum 17443  df-mgm 18646  df-sgrp 18725  df-mnd 18741  df-grp 18950  df-minusg 18951  df-mulg 19082  df-cntz 19329  df-cmn 19794  df-abl 19795  df-mgp 20159  df-rng 20171  df-ur 20200  df-ring 20253  df-psr 21930  df-mpl 21932

This theorem is referenced by:  mplcoe3  22060  mplcoe5  22062  mplmon2mul  22091