Theorem matgsum 22660

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 7224	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈)) ∈ V)
3		matgsum.a	. . . . 5 ⊢ 𝐴 = (𝑁 Mat 𝑅)
4	3	ovexi 7448	. . . 4 ⊢ 𝐴 ∈ V
5	4	a1i 11	. . 3 ⊢ (𝜑 → 𝐴 ∈ V)
6		ovexd 7449	. . 3 ⊢ (𝜑 → (𝑅 freeLMod (𝑁 × 𝑁)) ∈ V)
7		matgsum.i	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ Fin)
8		matgsum.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Ring)
9		eqid 2760	. . . . . 6 ⊢ (𝑅 freeLMod (𝑁 × 𝑁)) = (𝑅 freeLMod (𝑁 × 𝑁))
10	3, 9	matbas 22636	. . . . 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 22637	. . . . 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 18781	. 2 ⊢ (𝜑 → (𝐴 Σg (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))) = ((𝑅 freeLMod (𝑁 × 𝑁)) Σg (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))))
17		mpompts 8063	. . . . . 6 ⊢ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈) = (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)
18	17	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈) = (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))
19	18	mpteq2dv 5199	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈)) = (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)))
20	19	oveq2d 7430	. . 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 9290	. . . . 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 5201	. . . . . 6 ⊢ (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)) = (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))
36		matgsum.z	. . . . . . 7 ⊢ 0 = (0g‘𝐴)
37	36	eqcomi 2769	. . . . . 6 ⊢ (0g‘𝐴) = 0
38	34, 35, 37	3brtr4g 5139	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)) finSupp (0g‘𝐴))
39	3, 9	mat0 22640	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (0g‘(𝑅 freeLMod (𝑁 × 𝑁))) = (0g‘𝐴))
40	7, 8, 39	syl2anc 596	. . . . 5 ⊢ (𝜑 → (0g‘(𝑅 freeLMod (𝑁 × 𝑁))) = (0g‘𝐴))
41	38, 40	breqtrrd 5133	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)) finSupp (0g‘(𝑅 freeLMod (𝑁 × 𝑁))))
42	9, 21, 22, 24, 1, 8, 33, 41	frlmgsum 21986	. . 3 ⊢ (𝜑 → ((𝑅 freeLMod (𝑁 × 𝑁)) Σg (𝑦 ∈ 𝐽 ↦ (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))) = (𝑧 ∈ (𝑁 × 𝑁) ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))))
43	20, 42	eqtrd 2795	. 2 ⊢ (𝜑 → ((𝑅 freeLMod (𝑁 × 𝑁)) Σg (𝑦 ∈ 𝐽 ↦ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ 𝑈))) = (𝑧 ∈ (𝑁 × 𝑁) ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))))
44		fvex 6892	. . . . . . . 8 ⊢ (2nd ‘𝑧) ∈ V
45		csbov2g 7462	. . . . . . . 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 6892	. . . . . . 7 ⊢ (1st ‘𝑧) ∈ V
49		csbov2g 7462	. . . . . . 7 ⊢ ((1st ‘𝑧) ∈ V → ⦋(1st ‘𝑧) / 𝑖⦌(𝑅 Σg ⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈)) = (𝑅 Σg ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈)))
50	48, 49	ax-mp 5	. . . . . 6 ⊢ ⦋(1st ‘𝑧) / 𝑖⦌(𝑅 Σg ⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈)) = (𝑅 Σg ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈))
51		csbmpt2 5537	. . . . . . . . . 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 5537	. . . . . . . . 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 7425	. . . . . 6 ⊢ (𝑅 Σg ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑦 ∈ 𝐽 ↦ 𝑈)) = (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))
58	47, 50, 57	3eqtrri 2788	. . . . 5 ⊢ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈)) = ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈))
59	58	mpteq2i 5201	. . . 4 ⊢ (𝑧 ∈ (𝑁 × 𝑁) ↦ (𝑅 Σg (𝑦 ∈ 𝐽 ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌𝑈))) = (𝑧 ∈ (𝑁 × 𝑁) ↦ ⦋(1st ‘𝑧) / 𝑖⦌⦋(2nd ‘𝑧) / 𝑗⦌(𝑅 Σg (𝑦 ∈ 𝐽 ↦ 𝑈)))
60		mpompts 8063	. . . 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 1570   ∈ wcel 2145  Vcvv 3450  ⦋csb 3847   class class class wbr 5103   ↦ cmpt 5186   × cxp 5653  ‘cfv 6533  (class class class)co 7414   ∈ cmpo 7416  1^st c1st 7985  2^nd c2nd 7986  Fincfn 8953   finSupp cfsupp 9332  Basecbs 17302  +_gcplusg 17343  0_gc0g 17525   Σ_g cgsu 17526  Ringcrg 20373   freeLMod cfrlm 21960   Mat cmat 22630

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 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11181  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201  ax-pre-mulgt0 11202

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-supp 8160  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8456  df-er 8697  df-map 8829  df-ixp 8906  df-en 8954  df-dom 8955  df-sdom 8956  df-fin 8957  df-fsupp 9333  df-sup 9413  df-oi 9483  df-card 9945  df-pnf 11270  df-mnf 11271  df-xr 11272  df-ltxr 11273  df-le 11274  df-sub 11468  df-neg 11469  df-nn 12259  df-2 12328  df-3 12329  df-4 12330  df-5 12331  df-6 12332  df-7 12333  df-8 12334  df-9 12335  df-n0 12530  df-z 12617  df-dec 12738  df-uz 12889  df-fz 13563  df-fzo 13711  df-seq 14067  df-hash 14396  df-struct 17240  df-sets 17257  df-slot 17275  df-ndx 17287  df-base 17303  df-ress 17324  df-plusg 17356  df-mulr 17357  df-sca 17359  df-vsca 17360  df-ip 17361  df-tset 17362  df-ple 17363  df-ds 17365  df-hom 17367  df-cco 17368  df-0g 17527  df-gsum 17528  df-prds 17533  df-pws 17535  df-mgm 18731  df-sgrp 18822  df-mnd 18838  df-mhm 18892  df-grp 19061  df-minusg 19062  df-sbg 19063  df-subg 19247  df-cntz 19445  df-cmn 19910  df-abl 19911  df-mgp 20275  df-rng 20289  df-ur 20322  df-ring 20375  df-subrg 20733  df-lmod 21047  df-lss 21117  df-sra 21358  df-rgmod 21359  df-dsmm 21946  df-frlm 21961  df-mat 22631

This theorem is used by:  decpmatmul  22998  pmatcollpw2  23004