Theorem mplmon2mul 21612

Description: Product of scaled monomials. (Contributed by Stefan O'Rear, 8-Mar-2015.)

Hypotheses

Ref	Expression
mplmon2cl.p	⊢ 𝑃 = (𝐼 mPoly 𝑅)
mplmon2cl.d	⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}
mplmon2cl.z	⊢ 0 = (0g‘𝑅)
mplmon2cl.c	⊢ 𝐶 = (Base‘𝑅)
mplmon2cl.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
mplmon2mul.r	⊢ (𝜑 → 𝑅 ∈ CRing)
mplmon2mul.t	⊢ ∙ = (.r‘𝑃)
mplmon2mul.u	⊢ · = (.r‘𝑅)
mplmon2mul.x	⊢ (𝜑 → 𝑋 ∈ 𝐷)
mplmon2mul.y	⊢ (𝜑 → 𝑌 ∈ 𝐷)
mplmon2mul.f	⊢ (𝜑 → 𝐹 ∈ 𝐶)
mplmon2mul.g	⊢ (𝜑 → 𝐺 ∈ 𝐶)

Assertion

Ref	Expression
mplmon2mul	⊢ (𝜑 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 𝐹, 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 𝐺, 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (𝐹 · 𝐺), 0 )))

Distinct variable groups:   𝜑,𝑦   𝑦,𝐶   𝑦,𝐷   𝑦,𝐹   𝑦,𝐺   𝑓,𝐼   𝑦,𝑅   𝑦, ·   𝑓,𝑋,𝑦   𝑓,𝑌,𝑦   𝑦, 0

Allowed substitution hints:   𝜑(𝑓)   𝐶(𝑓)   𝐷(𝑓)   𝑃(𝑦,𝑓)   𝑅(𝑓)   ∙ (𝑦,𝑓)   · (𝑓)   𝐹(𝑓)   𝐺(𝑓)   𝐼(𝑦)   𝑊(𝑦,𝑓)   0 (𝑓)

Proof of Theorem mplmon2mul

Step	Hyp	Ref	Expression
1		mplmon2cl.i	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
2		mplmon2mul.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ CRing)
3		mplmon2cl.p	. . . . . 6 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
4	3	mplassa 21563	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ CRing) → 𝑃 ∈ AssAlg)
5	1, 2, 4	syl2anc 585	. . . 4 ⊢ (𝜑 → 𝑃 ∈ AssAlg)
6		mplmon2mul.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝐶)
7		mplmon2cl.c	. . . . . 6 ⊢ 𝐶 = (Base‘𝑅)
8	3, 1, 2	mplsca 21554	. . . . . . 7 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑃))
9	8	fveq2d 6892	. . . . . 6 ⊢ (𝜑 → (Base‘𝑅) = (Base‘(Scalar‘𝑃)))
10	7, 9	eqtrid 2785	. . . . 5 ⊢ (𝜑 → 𝐶 = (Base‘(Scalar‘𝑃)))
11	6, 10	eleqtrd 2836	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (Base‘(Scalar‘𝑃)))
12		eqid 2733	. . . . 5 ⊢ (Base‘𝑃) = (Base‘𝑃)
13		mplmon2cl.z	. . . . 5 ⊢ 0 = (0g‘𝑅)
14		eqid 2733	. . . . 5 ⊢ (1r‘𝑅) = (1r‘𝑅)
15		mplmon2cl.d	. . . . 5 ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}
16		crngring 20059	. . . . . 6 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
17	2, 16	syl 17	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Ring)
18		mplmon2mul.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐷)
19	3, 12, 13, 14, 15, 1, 17, 18	mplmon 21572	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∈ (Base‘𝑃))
20		assalmod 21399	. . . . . 6 ⊢ (𝑃 ∈ AssAlg → 𝑃 ∈ LMod)
21	5, 20	syl 17	. . . . 5 ⊢ (𝜑 → 𝑃 ∈ LMod)
22		mplmon2mul.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ 𝐶)
23	22, 10	eleqtrd 2836	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ (Base‘(Scalar‘𝑃)))
24		mplmon2mul.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐷)
25	3, 12, 13, 14, 15, 1, 17, 24	mplmon 21572	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )) ∈ (Base‘𝑃))
26		eqid 2733	. . . . . 6 ⊢ (Scalar‘𝑃) = (Scalar‘𝑃)
27		eqid 2733	. . . . . 6 ⊢ ( ·𝑠 ‘𝑃) = ( ·𝑠 ‘𝑃)
28		eqid 2733	. . . . . 6 ⊢ (Base‘(Scalar‘𝑃)) = (Base‘(Scalar‘𝑃))
29	12, 26, 27, 28	lmodvscl 20477	. . . . 5 ⊢ ((𝑃 ∈ LMod ∧ 𝐺 ∈ (Base‘(Scalar‘𝑃)) ∧ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )) ∈ (Base‘𝑃)) → (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))) ∈ (Base‘𝑃))
30	21, 23, 25, 29	syl3anc 1372	. . . 4 ⊢ (𝜑 → (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))) ∈ (Base‘𝑃))
31		mplmon2mul.t	. . . . 5 ⊢ ∙ = (.r‘𝑃)
32	12, 26, 28, 27, 31	assaass 21397	. . . 4 ⊢ ((𝑃 ∈ AssAlg ∧ (𝐹 ∈ (Base‘(Scalar‘𝑃)) ∧ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∈ (Base‘𝑃) ∧ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))) ∈ (Base‘𝑃))) → ((𝐹( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 ))) ∙ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )))) = (𝐹( ·𝑠 ‘𝑃)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))))))
33	5, 11, 19, 30, 32	syl13anc 1373	. . 3 ⊢ (𝜑 → ((𝐹( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 ))) ∙ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )))) = (𝐹( ·𝑠 ‘𝑃)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))))))
34	12, 26, 28, 27, 31	assaassr 21398	. . . . 5 ⊢ ((𝑃 ∈ AssAlg ∧ (𝐺 ∈ (Base‘(Scalar‘𝑃)) ∧ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∈ (Base‘𝑃) ∧ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )) ∈ (Base‘𝑃))) → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )))) = (𝐺( ·𝑠 ‘𝑃)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )))))
35	5, 23, 19, 25, 34	syl13anc 1373	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )))) = (𝐺( ·𝑠 ‘𝑃)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )))))
36	35	oveq2d 7420	. . 3 ⊢ (𝜑 → (𝐹( ·𝑠 ‘𝑃)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))))) = (𝐹( ·𝑠 ‘𝑃)(𝐺( ·𝑠 ‘𝑃)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))))))
37	3, 12, 13, 14, 15, 1, 17, 18, 31, 24	mplmonmul 21573	. . . . . 6 ⊢ (𝜑 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 )))
38	37	oveq2d 7420	. . . . 5 ⊢ (𝜑 → (𝐺( ·𝑠 ‘𝑃)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )))) = (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 ))))
39	38	oveq2d 7420	. . . 4 ⊢ (𝜑 → (𝐹( ·𝑠 ‘𝑃)(𝐺( ·𝑠 ‘𝑃)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))))) = (𝐹( ·𝑠 ‘𝑃)(𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 )))))
40	15	psrbagaddcl 21463	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐷 ∧ 𝑌 ∈ 𝐷) → (𝑋 ∘f + 𝑌) ∈ 𝐷)
41	18, 24, 40	syl2anc 585	. . . . . 6 ⊢ (𝜑 → (𝑋 ∘f + 𝑌) ∈ 𝐷)
42	3, 12, 13, 14, 15, 1, 17, 41	mplmon 21572	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 )) ∈ (Base‘𝑃))
43		eqid 2733	. . . . . 6 ⊢ (.r‘(Scalar‘𝑃)) = (.r‘(Scalar‘𝑃))
44	12, 26, 27, 28, 43	lmodvsass 20485	. . . . 5 ⊢ ((𝑃 ∈ LMod ∧ (𝐹 ∈ (Base‘(Scalar‘𝑃)) ∧ 𝐺 ∈ (Base‘(Scalar‘𝑃)) ∧ (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 )) ∈ (Base‘𝑃))) → ((𝐹(.r‘(Scalar‘𝑃))𝐺)( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 ))) = (𝐹( ·𝑠 ‘𝑃)(𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 )))))
45	21, 11, 23, 42, 44	syl13anc 1373	. . . 4 ⊢ (𝜑 → ((𝐹(.r‘(Scalar‘𝑃))𝐺)( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 ))) = (𝐹( ·𝑠 ‘𝑃)(𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 )))))
46		mplmon2mul.u	. . . . . . 7 ⊢ · = (.r‘𝑅)
47	8	fveq2d 6892	. . . . . . 7 ⊢ (𝜑 → (.r‘𝑅) = (.r‘(Scalar‘𝑃)))
48	46, 47	eqtr2id 2786	. . . . . 6 ⊢ (𝜑 → (.r‘(Scalar‘𝑃)) = · )
49	48	oveqd 7421	. . . . 5 ⊢ (𝜑 → (𝐹(.r‘(Scalar‘𝑃))𝐺) = (𝐹 · 𝐺))
50	49	oveq1d 7419	. . . 4 ⊢ (𝜑 → ((𝐹(.r‘(Scalar‘𝑃))𝐺)( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 ))) = ((𝐹 · 𝐺)( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 ))))
51	39, 45, 50	3eqtr2d 2779	. . 3 ⊢ (𝜑 → (𝐹( ·𝑠 ‘𝑃)(𝐺( ·𝑠 ‘𝑃)((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))))) = ((𝐹 · 𝐺)( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 ))))
52	33, 36, 51	3eqtrd 2777	. 2 ⊢ (𝜑 → ((𝐹( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 ))) ∙ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )))) = ((𝐹 · 𝐺)( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 ))))
53	3, 27, 15, 14, 13, 7, 1, 17, 18, 6	mplmon2 21604	. . 3 ⊢ (𝜑 → (𝐹( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 𝐹, 0 )))
54	3, 27, 15, 14, 13, 7, 1, 17, 24, 22	mplmon2 21604	. . 3 ⊢ (𝜑 → (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 𝐺, 0 )))
55	53, 54	oveq12d 7422	. 2 ⊢ (𝜑 → ((𝐹( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, (1r‘𝑅), 0 ))) ∙ (𝐺( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, (1r‘𝑅), 0 )))) = ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 𝐹, 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 𝐺, 0 ))))
56	7, 46	ringcl 20064	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐶 ∧ 𝐺 ∈ 𝐶) → (𝐹 · 𝐺) ∈ 𝐶)
57	17, 6, 22, 56	syl3anc 1372	. . 3 ⊢ (𝜑 → (𝐹 · 𝐺) ∈ 𝐶)
58	3, 27, 15, 14, 13, 7, 1, 17, 41, 57	mplmon2 21604	. 2 ⊢ (𝜑 → ((𝐹 · 𝐺)( ·𝑠 ‘𝑃)(𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (1r‘𝑅), 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (𝐹 · 𝐺), 0 )))
59	52, 55, 58	3eqtr3d 2781	1 ⊢ (𝜑 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 𝐹, 0 )) ∙ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑌, 𝐺, 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = (𝑋 ∘f + 𝑌), (𝐹 · 𝐺), 0 )))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2107  {crab 3433  ifcif 4527   ↦ cmpt 5230  ^◡ccnv 5674   “ cima 5678  ‘cfv 6540  (class class class)co 7404   ∘_f cof 7663   ↑_m cmap 8816  Fincfn 8935   + caddc 11109  ℕcn 12208  ℕ₀cn0 12468  Basecbs 17140  ._rcmulr 17194  Scalarcsca 17196   ·_𝑠 cvsca 17197  0_gc0g 17381  1_rcur 19996  Ringcrg 20047  CRingccrg 20048  LModclmod 20459  AssAlgcasa 21389   mPoly cmpl 21441

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7720  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-tp 4632  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-iin 4999  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-se 5631  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7360  df-ov 7407  df-oprab 7408  df-mpo 7409  df-of 7665  df-ofr 7666  df-om 7851  df-1st 7970  df-2nd 7971  df-supp 8142  df-frecs 8261  df-wrecs 8292  df-recs 8366  df-rdg 8405  df-1o 8461  df-er 8699  df-map 8818  df-pm 8819  df-ixp 8888  df-en 8936  df-dom 8937  df-sdom 8938  df-fin 8939  df-fsupp 9358  df-sup 9433  df-oi 9501  df-card 9930  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11442  df-neg 11443  df-nn 12209  df-2 12271  df-3 12272  df-4 12273  df-5 12274  df-6 12275  df-7 12276  df-8 12277  df-9 12278  df-n0 12469  df-z 12555  df-dec 12674  df-uz 12819  df-fz 13481  df-fzo 13624  df-seq 13963  df-hash 14287  df-struct 17076  df-sets 17093  df-slot 17111  df-ndx 17123  df-base 17141  df-ress 17170  df-plusg 17206  df-mulr 17207  df-sca 17209  df-vsca 17210  df-ip 17211  df-tset 17212  df-ple 17213  df-ds 17215  df-hom 17217  df-cco 17218  df-0g 17383  df-gsum 17384  df-prds 17389  df-pws 17391  df-mre 17526  df-mrc 17527  df-acs 17529  df-mgm 18557  df-sgrp 18606  df-mnd 18622  df-mhm 18667  df-submnd 18668  df-grp 18818  df-minusg 18819  df-sbg 18820  df-mulg 18945  df-subg 18997  df-ghm 19084  df-cntz 19175  df-cmn 19643  df-abl 19644  df-mgp 19980  df-ur 19997  df-ring 20049  df-cring 20050  df-subrg 20349  df-lmod 20461  df-lss 20531  df-assa 21392  df-psr 21444  df-mpl 21446

This theorem is referenced by:  evlslem2  21624