Theorem matgsum 22761

Description: Finite commutative sums in a matrix algebra are taken componentwise. (Contributed by AV, 26-Sep-2019.)

Hypotheses

Ref	Expression
matgsum.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
matgsum.b	⊢ 𝐵 = (Base‘𝐴)
matgsum.z	⊢ 0 = (0g‘𝐴)
matgsum.i	⊢ (𝜑 → 𝑁 ∈ Fin)
matgsum.j	⊢ (𝜑 → 𝐽 ∈ 𝑊)
matgsum.r	⊢ (𝜑 → 𝑅 ∈ Ring)
matgsum.f	⊢ ((𝜑 ∧ 𝑦 ∈ 𝐽) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈) ∈ 𝐵)
matgsum.w	⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈)) finSupp 0 )

Assertion

Ref	Expression
matgsum	⊢ (𝜑 → (𝐴 Σg (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈))))

Distinct variable groups:   𝑖,𝐽,𝑗,𝑦   𝑖,𝑁,𝑗,𝑦   𝑅,𝑖,𝑗,𝑦   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑖, 𝑗)   𝐴(𝑦, 𝑖, 𝑗)   𝐵(𝑦, 𝑖, 𝑗)   𝑈(𝑦, 𝑖, 𝑗)   𝑊(𝑦, 𝑖, 𝑗)   0 (𝑦, 𝑖, 𝑗)

Proof of Theorem matgsum

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		matgsum.j	. . . 4 ⊢ (𝜑 → 𝐽 ∈ 𝑊)
2	1	mptexd 7234	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈)) ∈ V)
3		matgsum.a	. . . . 5 ⊢ 𝐴 = (𝑁 Mat 𝑅)
4	3	ovexi 7458	. . . 4 ⊢ 𝐴 ∈ V
5	4	a1i 11	. . 3 ⊢ (𝜑 → 𝐴 ∈ V)
6		ovexd 7459	. . 3 ⊢ (𝜑 → (𝑅 freeLMod (𝑁 × 𝑁)) ∈ V)
7		matgsum.i	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ Fin)
8		matgsum.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Ring)
9		eqid 2760	. . . . . 6 ⊢ (𝑅 freeLMod (𝑁 × 𝑁)) = (𝑅 freeLMod (𝑁 × 𝑁))
10	3, 9	matbas 22737	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘𝐴))
11	7, 8, 10	syl2anc 596	. . . 4 ⊢ (𝜑 → (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘𝐴))
12	11	eqcomd 2766	. . 3 ⊢ (𝜑 → (Base‘𝐴) = (Base‘(𝑅 freeLMod (𝑁 × 𝑁))))
13	3, 9	matplusg 22738	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (+g‘(𝑅 freeLMod (𝑁 × 𝑁))) = (+g‘𝐴))
14	7, 8, 13	syl2anc 596	. . . 4 ⊢ (𝜑 → (+g‘(𝑅 freeLMod (𝑁 × 𝑁))) = (+g‘𝐴))
15	14	eqcomd 2766	. . 3 ⊢ (𝜑 → (+g‘𝐴) = (+g‘(𝑅 freeLMod (𝑁 × 𝑁))))
16	2, 5, 6, 12, 15	gsumpropd 18876	. 2 ⊢ (𝜑 → (𝐴 Σg (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))) = ((𝑅 freeLMod (𝑁 × 𝑁)) Σg (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))))
17		mpompts 8081	. . . . . 6 ⊢ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈) = (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)
18	17	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈) = (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))
19	18	mpteq2dv 5198	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈)) = (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)))
20	19	oveq2d 7440	. . 3 ⊢ (𝜑 → ((𝑅 freeLMod (𝑁 × 𝑁)) Σg (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))) = ((𝑅 freeLMod (𝑁 × 𝑁)) Σg (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))))
21		eqid 2760	. . . 4 ⊢ (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘(𝑅 freeLMod (𝑁 × 𝑁)))
22		eqid 2760	. . . 4 ⊢ (0g‘(𝑅 freeLMod (𝑁 × 𝑁))) = (0g‘(𝑅 freeLMod (𝑁 × 𝑁)))
23		xpfi 9319	. . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑁 × 𝑁) ∈ Fin)
24	7, 7, 23	syl2anc 596	. . . 4 ⊢ (𝜑 → (𝑁 × 𝑁) ∈ Fin)
25		matgsum.f	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐽) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈) ∈ 𝐵)
26		matgsum.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐴)
27	25, 26	eleqtrdi 2870	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐽) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈) ∈ (Base‘𝐴))
28	17	eqcomi 2769	. . . . . 6 ⊢ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈)
29	28	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐽) → (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))
30	7, 8	jca 521	. . . . . . 7 ⊢ (𝜑 → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring))
31	30	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐽) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring))
32	31, 10	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐽) → (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘𝐴))
33	27, 29, 32	3eltr4d 2875	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐽) → (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈) ∈ (Base‘(𝑅 freeLMod (𝑁 × 𝑁))))
34		matgsum.w	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈)) finSupp 0 )
35	28	mpteq2i 5200	. . . . . 6 ⊢ (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)) = (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))
36		matgsum.z	. . . . . . 7 ⊢ 0 = (0g‘𝐴)
37	36	eqcomi 2769	. . . . . 6 ⊢ (0g‘𝐴) = 0
38	34, 35, 37	3brtr4g 5138	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)) finSupp (0g‘𝐴))
39	3, 9	mat0 22741	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (0g‘(𝑅 freeLMod (𝑁 × 𝑁))) = (0g‘𝐴))
40	7, 8, 39	syl2anc 596	. . . . 5 ⊢ (𝜑 → (0g‘(𝑅 freeLMod (𝑁 × 𝑁))) = (0g‘𝐴))
41	38, 40	breqtrrd 5132	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)) finSupp (0g‘(𝑅 freeLMod (𝑁 × 𝑁))))
42	9, 21, 22, 24, 1, 8, 33, 41	frlmgsum 22087	. . 3 ⊢ (𝜑 → ((𝑅 freeLMod (𝑁 × 𝑁)) Σg (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))) = (𝑧 ∈ (𝑁 × 𝑁) ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))))
43	20, 42	eqtrd 2795	. 2 ⊢ (𝜑 → ((𝑅 freeLMod (𝑁 × 𝑁)) Σg (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))) = (𝑧 ∈ (𝑁 × 𝑁) ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))))
44		fvex 6903	. . . . . . . 8 ⊢ (2nd ‘𝑧) ∈ V
45		csbov2g 7472	. . . . . . . 8 ⊢ ((2nd ‘𝑧) ∈ V → ⦋(2nd ‘𝑧) / 𝑗⦌(𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈)) = (𝑅 Σg ⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈)))
46	44, 45	ax-mp 5	. . . . . . 7 ⊢ ⦋(2nd ‘𝑧) / 𝑗⦌(𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈)) = (𝑅 Σg ⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈))
47	46	csbeq2i 3855	. . . . . 6 ⊢ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈)) = ⦋(1st ‘𝑧) / 𝑖⦌(𝑅 Σg ⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈))
48		fvex 6903	. . . . . . 7 ⊢ (1st ‘𝑧) ∈ V
49		csbov2g 7472	. . . . . . 7 ⊢ ((1st ‘𝑧) ∈ V → ⦋(1st ‘𝑧) / 𝑖⦌(𝑅 Σg ⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈)) = (𝑅 Σg ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈)))
50	48, 49	ax-mp 5	. . . . . 6 ⊢ ⦋(1st ‘𝑧) / 𝑖⦌(𝑅 Σg ⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈)) = (𝑅 Σg ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈))
51		csbmpt2 5533	. . . . . . . . . 10 ⊢ ((2nd ‘𝑧) ∈ V → ⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈) = (𝑦 ∈ 𝐽 ↦ ⦋(2nd ‘𝑧) / 𝑗⦌𝑈))
52	44, 51	ax-mp 5	. . . . . . . . 9 ⊢ ⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈) = (𝑦 ∈ 𝐽 ↦ ⦋(2nd ‘𝑧) / 𝑗⦌𝑈)
53	52	csbeq2i 3855	. . . . . . . 8 ⊢ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈) = ⦋(1st ‘𝑧) / 𝑖⦌(𝑦 ∈ 𝐽 ↦ ⦋(2nd ‘𝑧) / 𝑗⦌𝑈)
54		csbmpt2 5533	. . . . . . . . 9 ⊢ ((1st ‘𝑧) ∈ V → ⦋(1st ‘𝑧) / 𝑖⦌(𝑦 ∈ 𝐽 ↦ ⦋(2nd ‘𝑧) / 𝑗⦌𝑈) = (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))
55	48, 54	ax-mp 5	. . . . . . . 8 ⊢ ⦋(1st ‘𝑧) / 𝑖⦌(𝑦 ∈ 𝐽 ↦ ⦋(2nd ‘𝑧) / 𝑗⦌𝑈) = (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)
56	53, 55	eqtri 2783	. . . . . . 7 ⊢ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈) = (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)
57	56	oveq2i 7435	. . . . . 6 ⊢ (𝑅 Σg ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈)) = (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))
58	47, 50, 57	3eqtrri 2788	. . . . 5 ⊢ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)) = ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈))
59	58	mpteq2i 5200	. . . 4 ⊢ (𝑧 ∈ (𝑁 × 𝑁) ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))) = (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈)))
60		mpompts 8081	. . . 4 ⊢ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈))) = (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈)))
61	59, 60	eqtr4i 2786	. . 3 ⊢ (𝑧 ∈ (𝑁 × 𝑁) ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈)))
62	61	a1i 11	. 2 ⊢ (𝜑 → (𝑧 ∈ (𝑁 × 𝑁) ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈))))
63	16, 43, 62	3eqtrd 2799	1 ⊢ (𝜑 → (𝐴 Σg (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ⦋csb 3847   class class class wbr 5102   ↦ cmpt 5185   × cxp 5649  ‘cfv 6543  (class class class)co 7424   ∈ cmpo 7426  1^st c1st 8003  2^nd c2nd 8004  Fincfn 8981   finSupp cfsupp 9361  Basecbs 17396  +_gcplusg 17437  0_gc0g 17619   Σ_g cgsu 17620  Ringcrg 20468   freeLMod cfrlm 22061   Mat cmat 22731

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-cnex 11263  ax-resscn 11264  ax-1cn 11265  ax-icn 11266  ax-addcl 11267  ax-addrcl 11268  ax-mulcl 11269  ax-mulrcl 11270  ax-mulcom 11271  ax-addass 11272  ax-mulass 11273  ax-distr 11274  ax-i2m1 11275  ax-1ne0 11276  ax-1rid 11277  ax-rnegex 11278  ax-rrecex 11279  ax-cnre 11280  ax-pre-lttri 11281  ax-pre-lttrn 11282  ax-pre-ltadd 11283  ax-pre-mulgt0 11284

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-ot 4858  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-om 7882  df-1st 8005  df-2nd 8006  df-supp 8185  df-frecs 8307  df-wrecs 8338  df-recs 8387  df-rdg 8426  df-1o 8484  df-er 8725  df-map 8857  df-ixp 8934  df-en 8982  df-dom 8983  df-sdom 8984  df-fin 8985  df-fsupp 9362  df-sup 9441  df-oi 9511  df-card 10027  df-pnf 11352  df-mnf 11353  df-xr 11354  df-ltxr 11355  df-le 11356  df-sub 11550  df-neg 11551  df-nn 12343  df-2 12412  df-3 12413  df-4 12414  df-5 12415  df-6 12416  df-7 12417  df-8 12418  df-9 12419  df-n0 12614  df-z 12701  df-dec 12822  df-uz 12973  df-fz 13647  df-fzo 13796  df-seq 14152  df-hash 14482  df-struct 17334  df-sets 17351  df-slot 17369  df-ndx 17381  df-base 17397  df-ress 17418  df-plusg 17450  df-mulr 17451  df-sca 17453  df-vsca 17454  df-ip 17455  df-tset 17456  df-ple 17457  df-ds 17459  df-hom 17461  df-cco 17462  df-0g 17621  df-gsum 17622  df-prds 17627  df-pws 17629  df-mgm 18825  df-sgrp 18917  df-mnd 18933  df-mhm 18987  df-grp 19156  df-minusg 19157  df-sbg 19158  df-subg 19342  df-cntz 19540  df-cmn 20005  df-abl 20006  df-mgp 20370  df-rng 20384  df-ur 20417  df-ring 20470  df-subrg 20831  df-lmod 21146  df-lss 21216  df-sra 21457  df-rgmod 21458  df-dsmm 22047  df-frlm 22062  df-mat 22732

This theorem is used by:  decpmatmul  23099  pmatcollpw2  23105