Theorem psdmvr 22116

Description: The partial derivative of a variable is the Kronecker delta if(𝑋 = 𝑌, 1 , 0 ). (Contributed by SN, 16-Oct-2025.)

Hypotheses

Ref	Expression
psdmvr.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
psdmvr.z	⊢ 0 = (0g‘𝑆)
psdmvr.o	⊢ 1 = (1r‘𝑆)
psdmvr.v	⊢ 𝑉 = (𝐼 mVar 𝑅)
psdmvr.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
psdmvr.r	⊢ (𝜑 → 𝑅 ∈ Ring)
psdmvr.x	⊢ (𝜑 → 𝑋 ∈ 𝐼)
psdmvr.y	⊢ (𝜑 → 𝑌 ∈ 𝐼)

Assertion

Ref	Expression
psdmvr	⊢ (𝜑 → (((𝐼 mPSDer 𝑅)‘𝑋)‘(𝑉‘𝑌)) = if(𝑋 = 𝑌, 1 , 0 ))

Proof of Theorem psdmvr

Dummy variables ℎ 𝑘 𝑦 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		psdmvr.s	. . 3 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
2		eqid 2737	. . 3 ⊢ (Base‘𝑆) = (Base‘𝑆)
3		eqid 2737	. . 3 ⊢ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
4		psdmvr.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐼)
5		psdmvr.v	. . . 4 ⊢ 𝑉 = (𝐼 mVar 𝑅)
6		psdmvr.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
7		psdmvr.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Ring)
8		psdmvr.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐼)
9	1, 5, 2, 6, 7, 8	mvrcl2 21946	. . 3 ⊢ (𝜑 → (𝑉‘𝑌) ∈ (Base‘𝑆))
10	1, 2, 3, 4, 9	psdval 22106	. 2 ⊢ (𝜑 → (((𝐼 mPSDer 𝑅)‘𝑋)‘(𝑉‘𝑌)) = (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑋) + 1)(.g‘𝑅)((𝑉‘𝑌)‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))))
11		eqid 2737	. . . . . . 7 ⊢ (0g‘𝑅) = (0g‘𝑅)
12		eqid 2737	. . . . . . 7 ⊢ (1r‘𝑅) = (1r‘𝑅)
13	6	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → 𝐼 ∈ 𝑊)
14	7	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → 𝑅 ∈ Ring)
15	8	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → 𝑌 ∈ 𝐼)
16		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
17	3	psrbagsn 22022	. . . . . . . . . 10 ⊢ (𝐼 ∈ 𝑊 → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
18	6, 17	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
19	18	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
20	3	psrbagaddcl 21884	. . . . . . . 8 ⊢ ((𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∧ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
21	16, 19, 20	syl2anc 585	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
22	5, 3, 11, 12, 13, 14, 15, 21	mvrval2 21942	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → ((𝑉‘𝑌)‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) = if((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)), (1r‘𝑅), (0g‘𝑅)))
23		1red 11137	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → 1 ∈ ℝ)
24	3	psrbagf 21878	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} → 𝑘:𝐼⟶ℕ0)
25	24	ad2antlr 728	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → 𝑘:𝐼⟶ℕ0)
26	4	ad2antrr 727	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → 𝑋 ∈ 𝐼)
27	25, 26	ffvelcdmd 7032	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → (𝑘‘𝑋) ∈ ℕ0)
28		nn0addge2 12452	. . . . . . . . . . . . . 14 ⊢ ((1 ∈ ℝ ∧ (𝑘‘𝑋) ∈ ℕ0) → 1 ≤ ((𝑘‘𝑋) + 1))
29	23, 27, 28	syl2anc 585	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → 1 ≤ ((𝑘‘𝑋) + 1))
30		fveq1 6834	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)) → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))‘𝑋) = ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))‘𝑋))
31	30	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))‘𝑋) = ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))‘𝑋))
32	24	ffnd 6664	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} → 𝑘 Fn 𝐼)
33	32	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → 𝑘 Fn 𝐼)
34		1re 11136	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 1 ∈ ℝ
35		0re 11138	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 0 ∈ ℝ
36	34, 35	ifcli 4528	. . . . . . . . . . . . . . . . . . . 20 ⊢ if(𝑦 = 𝑋, 1, 0) ∈ ℝ
37	36	elexi 3464	. . . . . . . . . . . . . . . . . . 19 ⊢ if(𝑦 = 𝑋, 1, 0) ∈ V
38		eqid 2737	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))
39	37, 38	fnmpti 6636	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) Fn 𝐼
40	39	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) Fn 𝐼)
41		inidm 4180	. . . . . . . . . . . . . . . . 17 ⊢ (𝐼 ∩ 𝐼) = 𝐼
42		eqidd 2738	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑋 ∈ 𝐼) → (𝑘‘𝑋) = (𝑘‘𝑋))
43		iftrue 4486	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑋 → if(𝑦 = 𝑋, 1, 0) = 1)
44		1ex 11132	. . . . . . . . . . . . . . . . . . 19 ⊢ 1 ∈ V
45	43, 38, 44	fvmpt 6942	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑋 ∈ 𝐼 → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))‘𝑋) = 1)
46	45	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑋 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))‘𝑋) = 1)
47	33, 40, 13, 13, 41, 42, 46	ofval 7635	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑋 ∈ 𝐼) → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))‘𝑋) = ((𝑘‘𝑋) + 1))
48	4, 47	mpidan 690	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))‘𝑋) = ((𝑘‘𝑋) + 1))
49	48	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))‘𝑋) = ((𝑘‘𝑋) + 1))
50		eqid 2737	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))
51		eqeq1 2741	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑋 → (𝑦 = 𝑌 ↔ 𝑋 = 𝑌))
52	51	ifbid 4504	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑋 → if(𝑦 = 𝑌, 1, 0) = if(𝑋 = 𝑌, 1, 0))
53	34, 35	ifcli 4528	. . . . . . . . . . . . . . . . 17 ⊢ if(𝑋 = 𝑌, 1, 0) ∈ ℝ
54	53	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → if(𝑋 = 𝑌, 1, 0) ∈ ℝ)
55	50, 52, 4, 54	fvmptd3 6966	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))‘𝑋) = if(𝑋 = 𝑌, 1, 0))
56	55	ad2antrr 727	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))‘𝑋) = if(𝑋 = 𝑌, 1, 0))
57	31, 49, 56	3eqtr3d 2780	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → ((𝑘‘𝑋) + 1) = if(𝑋 = 𝑌, 1, 0))
58	29, 57	breqtrd 5125	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → 1 ≤ if(𝑋 = 𝑌, 1, 0))
59		1le1 11769	. . . . . . . . . . . . . 14 ⊢ 1 ≤ 1
60		0le1 11664	. . . . . . . . . . . . . 14 ⊢ 0 ≤ 1
61		anifp 1072	. . . . . . . . . . . . . 14 ⊢ ((1 ≤ 1 ∧ 0 ≤ 1) → if-(𝑋 = 𝑌, 1 ≤ 1, 0 ≤ 1))
62	59, 60, 61	mp2an 693	. . . . . . . . . . . . 13 ⊢ if-(𝑋 = 𝑌, 1 ≤ 1, 0 ≤ 1)
63		brif1 7457	. . . . . . . . . . . . 13 ⊢ (if(𝑋 = 𝑌, 1, 0) ≤ 1 ↔ if-(𝑋 = 𝑌, 1 ≤ 1, 0 ≤ 1))
64	62, 63	mpbir 231	. . . . . . . . . . . 12 ⊢ if(𝑋 = 𝑌, 1, 0) ≤ 1
65	34, 53	letri3i 11253	. . . . . . . . . . . 12 ⊢ (1 = if(𝑋 = 𝑌, 1, 0) ↔ (1 ≤ if(𝑋 = 𝑌, 1, 0) ∧ if(𝑋 = 𝑌, 1, 0) ≤ 1))
66	58, 64, 65	sylanblrc 591	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → 1 = if(𝑋 = 𝑌, 1, 0))
67	66	eqcomd 2743	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → if(𝑋 = 𝑌, 1, 0) = 1)
68		ax-1ne0 11099	. . . . . . . . . . 11 ⊢ 1 ≠ 0
69		iftrueb 4493	. . . . . . . . . . 11 ⊢ (1 ≠ 0 → (if(𝑋 = 𝑌, 1, 0) = 1 ↔ 𝑋 = 𝑌))
70	68, 69	ax-mp 5	. . . . . . . . . 10 ⊢ (if(𝑋 = 𝑌, 1, 0) = 1 ↔ 𝑋 = 𝑌)
71	67, 70	sylib 218	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) → 𝑋 = 𝑌)
72		eqeq2 2749	. . . . . . . . . . . . . 14 ⊢ (𝑋 = 𝑌 → (𝑦 = 𝑋 ↔ 𝑦 = 𝑌))
73	72	ifbid 4504	. . . . . . . . . . . . 13 ⊢ (𝑋 = 𝑌 → if(𝑦 = 𝑋, 1, 0) = if(𝑦 = 𝑌, 1, 0))
74	73	mpteq2dv 5193	. . . . . . . . . . . 12 ⊢ (𝑋 = 𝑌 → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)))
75	74	oveq2d 7376	. . . . . . . . . . 11 ⊢ (𝑋 = 𝑌 → (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))))
76	75	eqeq1d 2739	. . . . . . . . . 10 ⊢ (𝑋 = 𝑌 → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)) ↔ (𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))))
77	24	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → 𝑘:𝐼⟶ℕ0)
78		1nn0 12421	. . . . . . . . . . . . . . 15 ⊢ 1 ∈ ℕ0
79		0nn0 12420	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ ℕ0
80	78, 79	ifcli 4528	. . . . . . . . . . . . . 14 ⊢ if(𝑦 = 𝑌, 1, 0) ∈ ℕ0
81	80	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝐼 → if(𝑦 = 𝑌, 1, 0) ∈ ℕ0)
82	50, 81	fmpti 7059	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)):𝐼⟶ℕ0
83	82	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)):𝐼⟶ℕ0)
84		nn0cn 12415	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ0 → 𝑛 ∈ ℂ)
85		nn0cn 12415	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ ℂ)
86		addcom 11323	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 ∈ ℂ ∧ 𝑚 ∈ ℂ) → (𝑛 + 𝑚) = (𝑚 + 𝑛))
87	86	eqeq1d 2739	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℂ ∧ 𝑚 ∈ ℂ) → ((𝑛 + 𝑚) = 𝑚 ↔ (𝑚 + 𝑛) = 𝑚))
88		addid0 11560	. . . . . . . . . . . . . . 15 ⊢ ((𝑚 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑚 + 𝑛) = 𝑚 ↔ 𝑛 = 0))
89	88	ancoms 458	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℂ ∧ 𝑚 ∈ ℂ) → ((𝑚 + 𝑛) = 𝑚 ↔ 𝑛 = 0))
90	87, 89	bitrd 279	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℂ ∧ 𝑚 ∈ ℂ) → ((𝑛 + 𝑚) = 𝑚 ↔ 𝑛 = 0))
91	84, 85, 90	syl2an 597	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑚 ∈ ℕ0) → ((𝑛 + 𝑚) = 𝑚 ↔ 𝑛 = 0))
92	91	adantl 481	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑛 ∈ ℕ0 ∧ 𝑚 ∈ ℕ0)) → ((𝑛 + 𝑚) = 𝑚 ↔ 𝑛 = 0))
93	13, 77, 83, 92	caofidlcan 7662	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)) ↔ 𝑘 = (𝐼 × {0})))
94	76, 93	sylan9bbr 510	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑋 = 𝑌) → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)) ↔ 𝑘 = (𝐼 × {0})))
95	71, 94	biadanid 823	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)) ↔ (𝑋 = 𝑌 ∧ 𝑘 = (𝐼 × {0}))))
96	95	biancomd 463	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → ((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)) ↔ (𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌)))
97	96	ifbid 4504	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → if((𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑌, 1, 0)), (1r‘𝑅), (0g‘𝑅)) = if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅)))
98	22, 97	eqtrd 2772	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → ((𝑉‘𝑌)‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) = if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅)))
99	98	oveq2d 7376	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (((𝑘‘𝑋) + 1)(.g‘𝑅)((𝑉‘𝑌)‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) = (((𝑘‘𝑋) + 1)(.g‘𝑅)if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅))))
100		ovif2 7459	. . . . 5 ⊢ (((𝑘‘𝑋) + 1)(.g‘𝑅)if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅))) = if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (((𝑘‘𝑋) + 1)(.g‘𝑅)(1r‘𝑅)), (((𝑘‘𝑋) + 1)(.g‘𝑅)(0g‘𝑅)))
101		fveq1 6834	. . . . . . . . . . 11 ⊢ (𝑘 = (𝐼 × {0}) → (𝑘‘𝑋) = ((𝐼 × {0})‘𝑋))
102	101	oveq1d 7375	. . . . . . . . . 10 ⊢ (𝑘 = (𝐼 × {0}) → ((𝑘‘𝑋) + 1) = (((𝐼 × {0})‘𝑋) + 1))
103	4	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → 𝑋 ∈ 𝐼)
104		c0ex 11130	. . . . . . . . . . . . . 14 ⊢ 0 ∈ V
105	104	fvconst2 7152	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ 𝐼 → ((𝐼 × {0})‘𝑋) = 0)
106	103, 105	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → ((𝐼 × {0})‘𝑋) = 0)
107	106	oveq1d 7375	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (((𝐼 × {0})‘𝑋) + 1) = (0 + 1))
108		0p1e1 12266	. . . . . . . . . . 11 ⊢ (0 + 1) = 1
109	107, 108	eqtrdi 2788	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (((𝐼 × {0})‘𝑋) + 1) = 1)
110	102, 109	sylan9eqr 2794	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ 𝑘 = (𝐼 × {0})) → ((𝑘‘𝑋) + 1) = 1)
111	110	adantrr 718	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌)) → ((𝑘‘𝑋) + 1) = 1)
112	111	oveq1d 7375	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌)) → (((𝑘‘𝑋) + 1)(.g‘𝑅)(1r‘𝑅)) = (1(.g‘𝑅)(1r‘𝑅)))
113		eqid 2737	. . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝑅)
114	113, 12, 7	ringidcld 20205	. . . . . . . . 9 ⊢ (𝜑 → (1r‘𝑅) ∈ (Base‘𝑅))
115		eqid 2737	. . . . . . . . . 10 ⊢ (.g‘𝑅) = (.g‘𝑅)
116	113, 115	mulg1 19015	. . . . . . . . 9 ⊢ ((1r‘𝑅) ∈ (Base‘𝑅) → (1(.g‘𝑅)(1r‘𝑅)) = (1r‘𝑅))
117	114, 116	syl 17	. . . . . . . 8 ⊢ (𝜑 → (1(.g‘𝑅)(1r‘𝑅)) = (1r‘𝑅))
118	117	ad2antrr 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌)) → (1(.g‘𝑅)(1r‘𝑅)) = (1r‘𝑅))
119	112, 118	eqtrd 2772	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ (𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌)) → (((𝑘‘𝑋) + 1)(.g‘𝑅)(1r‘𝑅)) = (1r‘𝑅))
120	7	ringgrpd 20181	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ Grp)
121	120	grpmndd 18880	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ Mnd)
122	121	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → 𝑅 ∈ Mnd)
123	77, 103	ffvelcdmd 7032	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (𝑘‘𝑋) ∈ ℕ0)
124	78	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → 1 ∈ ℕ0)
125	123, 124	nn0addcld 12470	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → ((𝑘‘𝑋) + 1) ∈ ℕ0)
126	113, 115, 11	mulgnn0z 19035	. . . . . . . 8 ⊢ ((𝑅 ∈ Mnd ∧ ((𝑘‘𝑋) + 1) ∈ ℕ0) → (((𝑘‘𝑋) + 1)(.g‘𝑅)(0g‘𝑅)) = (0g‘𝑅))
127	122, 125, 126	syl2anc 585	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (((𝑘‘𝑋) + 1)(.g‘𝑅)(0g‘𝑅)) = (0g‘𝑅))
128	127	adantr 480	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ∧ ¬ (𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌)) → (((𝑘‘𝑋) + 1)(.g‘𝑅)(0g‘𝑅)) = (0g‘𝑅))
129	119, 128	ifeq12da 4514	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (((𝑘‘𝑋) + 1)(.g‘𝑅)(1r‘𝑅)), (((𝑘‘𝑋) + 1)(.g‘𝑅)(0g‘𝑅))) = if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅)))
130	100, 129	eqtrid 2784	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (((𝑘‘𝑋) + 1)(.g‘𝑅)if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅))) = if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅)))
131		ancom 460	. . . . . . 7 ⊢ ((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌) ↔ (𝑋 = 𝑌 ∧ 𝑘 = (𝐼 × {0})))
132		ifbi 4503	. . . . . . 7 ⊢ (((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌) ↔ (𝑋 = 𝑌 ∧ 𝑘 = (𝐼 × {0}))) → if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅)) = if((𝑋 = 𝑌 ∧ 𝑘 = (𝐼 × {0})), (1r‘𝑅), (0g‘𝑅)))
133	131, 132	ax-mp 5	. . . . . 6 ⊢ if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅)) = if((𝑋 = 𝑌 ∧ 𝑘 = (𝐼 × {0})), (1r‘𝑅), (0g‘𝑅))
134		ifan 4534	. . . . . 6 ⊢ if((𝑋 = 𝑌 ∧ 𝑘 = (𝐼 × {0})), (1r‘𝑅), (0g‘𝑅)) = if(𝑋 = 𝑌, if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅)), (0g‘𝑅))
135	133, 134	eqtri 2760	. . . . 5 ⊢ if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅)) = if(𝑋 = 𝑌, if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅)), (0g‘𝑅))
136	135	a1i 11	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → if((𝑘 = (𝐼 × {0}) ∧ 𝑋 = 𝑌), (1r‘𝑅), (0g‘𝑅)) = if(𝑋 = 𝑌, if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅)), (0g‘𝑅)))
137	99, 130, 136	3eqtrd 2776	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → (((𝑘‘𝑋) + 1)(.g‘𝑅)((𝑉‘𝑌)‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))) = if(𝑋 = 𝑌, if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅)), (0g‘𝑅)))
138	137	mpteq2dva 5192	. 2 ⊢ (𝜑 → (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (((𝑘‘𝑋) + 1)(.g‘𝑅)((𝑉‘𝑌)‘(𝑘 ∘f + (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))))) = (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑋 = 𝑌, if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅)), (0g‘𝑅))))
139		ifmpt2v 7462	. . 3 ⊢ (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑋 = 𝑌, if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅)), (0g‘𝑅))) = if(𝑋 = 𝑌, (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅))), (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (0g‘𝑅)))
140		psdmvr.o	. . . . 5 ⊢ 1 = (1r‘𝑆)
141	1, 6, 7, 3, 11, 12, 140	psr1 21930	. . . 4 ⊢ (𝜑 → 1 = (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅))))
142		psdmvr.z	. . . . . 6 ⊢ 0 = (0g‘𝑆)
143	1, 6, 120, 3, 11, 142	psr0 21917	. . . . 5 ⊢ (𝜑 → 0 = ({ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(0g‘𝑅)}))
144		fconstmpt 5687	. . . . 5 ⊢ ({ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} × {(0g‘𝑅)}) = (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (0g‘𝑅))
145	143, 144	eqtrdi 2788	. . . 4 ⊢ (𝜑 → 0 = (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (0g‘𝑅)))
146	141, 145	ifeq12d 4502	. . 3 ⊢ (𝜑 → if(𝑋 = 𝑌, 1 , 0 ) = if(𝑋 = 𝑌, (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅))), (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ (0g‘𝑅))))
147	139, 146	eqtr4id 2791	. 2 ⊢ (𝜑 → (𝑘 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑋 = 𝑌, if(𝑘 = (𝐼 × {0}), (1r‘𝑅), (0g‘𝑅)), (0g‘𝑅))) = if(𝑋 = 𝑌, 1 , 0 ))
148	10, 138, 147	3eqtrd 2776	1 ⊢ (𝜑 → (((𝐼 mPSDer 𝑅)‘𝑋)‘(𝑉‘𝑌)) = if(𝑋 = 𝑌, 1 , 0 ))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  if-wif 1063   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  {crab 3400  ifcif 4480  {csn 4581   class class class wbr 5099   ↦ cmpt 5180   × cxp 5623  ^◡ccnv 5624   “ cima 5628   Fn wfn 6488  ⟶wf 6489  ‘cfv 6493  (class class class)co 7360   ∘_f cof 7622   ↑_m cmap 8767  Fincfn 8887  ℂcc 11028  ℝcr 11029  0cc0 11030  1c1 11031   + caddc 11033   ≤ cle 11171  ℕcn 12149  ℕ₀cn0 12405  Basecbs 17140  0_gc0g 17363  Mndcmnd 18663  ._gcmg 19001  1_rcur 20120  Ringcrg 20172   mPwSer cmps 21864   mVar cmvr 21865   mPSDer cpsd 22077

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 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682  ax-cnex 11086  ax-resscn 11087  ax-1cn 11088  ax-icn 11089  ax-addcl 11090  ax-addrcl 11091  ax-mulcl 11092  ax-mulrcl 11093  ax-mulcom 11094  ax-addass 11095  ax-mulass 11096  ax-distr 11097  ax-i2m1 11098  ax-1ne0 11099  ax-1rid 11100  ax-rnegex 11101  ax-rrecex 11102  ax-cnre 11103  ax-pre-lttri 11104  ax-pre-lttrn 11105  ax-pre-ltadd 11106  ax-pre-mulgt0 11107

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-ifp 1064  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 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-iin 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-isom 6502  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-of 7624  df-ofr 7625  df-om 7811  df-1st 7935  df-2nd 7936  df-supp 8105  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-1o 8399  df-2o 8400  df-er 8637  df-map 8769  df-pm 8770  df-ixp 8840  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-fsupp 9269  df-sup 9349  df-oi 9419  df-card 9855  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12150  df-2 12212  df-3 12213  df-4 12214  df-5 12215  df-6 12216  df-7 12217  df-8 12218  df-9 12219  df-n0 12406  df-z 12493  df-dec 12612  df-uz 12756  df-fz 13428  df-fzo 13575  df-seq 13929  df-hash 14258  df-struct 17078  df-sets 17095  df-slot 17113  df-ndx 17125  df-base 17141  df-ress 17162  df-plusg 17194  df-mulr 17195  df-sca 17197  df-vsca 17198  df-ip 17199  df-tset 17200  df-ple 17201  df-ds 17203  df-hom 17205  df-cco 17206  df-0g 17365  df-gsum 17366  df-prds 17371  df-pws 17373  df-mre 17509  df-mrc 17510  df-acs 17512  df-mgm 18569  df-sgrp 18648  df-mnd 18664  df-mhm 18712  df-submnd 18713  df-grp 18870  df-minusg 18871  df-mulg 19002  df-ghm 19146  df-cntz 19250  df-cmn 19715  df-abl 19716  df-mgp 20080  df-rng 20092  df-ur 20121  df-ring 20174  df-psr 21869  df-mvr 21870  df-psd 22103

This theorem is referenced by: (None)