Theorem cply1mul 22183

Description: The product of two constant polynomials is a constant polynomial. (Contributed by AV, 18-Nov-2019.)

Hypotheses

Ref	Expression
cply1mul.p	⊢ 𝑃 = (Poly1‘𝑅)
cply1mul.b	⊢ 𝐵 = (Base‘𝑃)
cply1mul.0	⊢ 0 = (0g‘𝑅)
cply1mul.m	⊢ × = (.r‘𝑃)

Assertion

Ref	Expression
cply1mul	⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 ) → ∀𝑐 ∈ ℕ ((coe1‘(𝐹 × 𝐺))‘𝑐) = 0 ))

Distinct variable groups:   𝐹,𝑐   𝐺,𝑐   × ,𝑐   0 ,𝑐

Allowed substitution hints:   𝐵(𝑐)   𝑃(𝑐)   𝑅(𝑐)

Proof of Theorem cply1mul

Dummy variables 𝑘 𝑛 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cply1mul.p	. . . . . . . . . 10 ⊢ 𝑃 = (Poly1‘𝑅)
2		cply1mul.m	. . . . . . . . . 10 ⊢ × = (.r‘𝑃)
3		eqid 2729	. . . . . . . . . 10 ⊢ (.r‘𝑅) = (.r‘𝑅)
4		cply1mul.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑃)
5	1, 2, 3, 4	coe1mul 22156	. . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (coe1‘(𝐹 × 𝐺)) = (𝑠 ∈ ℕ0 ↦ (𝑅 Σg (𝑘 ∈ (0...𝑠) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑠 − 𝑘)))))))
6	5	3expb 1120	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (coe1‘(𝐹 × 𝐺)) = (𝑠 ∈ ℕ0 ↦ (𝑅 Σg (𝑘 ∈ (0...𝑠) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑠 − 𝑘)))))))
7	6	adantr 480	. . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) → (coe1‘(𝐹 × 𝐺)) = (𝑠 ∈ ℕ0 ↦ (𝑅 Σg (𝑘 ∈ (0...𝑠) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑠 − 𝑘)))))))
8	7	adantr 480	. . . . . 6 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) → (coe1‘(𝐹 × 𝐺)) = (𝑠 ∈ ℕ0 ↦ (𝑅 Σg (𝑘 ∈ (0...𝑠) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑠 − 𝑘)))))))
9		oveq2 7395	. . . . . . . . 9 ⊢ (𝑠 = 𝑛 → (0...𝑠) = (0...𝑛))
10		fvoveq1 7410	. . . . . . . . . 10 ⊢ (𝑠 = 𝑛 → ((coe1‘𝐺)‘(𝑠 − 𝑘)) = ((coe1‘𝐺)‘(𝑛 − 𝑘)))
11	10	oveq2d 7403	. . . . . . . . 9 ⊢ (𝑠 = 𝑛 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑠 − 𝑘))) = (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))))
12	9, 11	mpteq12dv 5194	. . . . . . . 8 ⊢ (𝑠 = 𝑛 → (𝑘 ∈ (0...𝑠) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑠 − 𝑘)))) = (𝑘 ∈ (0...𝑛) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘)))))
13	12	oveq2d 7403	. . . . . . 7 ⊢ (𝑠 = 𝑛 → (𝑅 Σg (𝑘 ∈ (0...𝑠) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑠 − 𝑘))))) = (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))))))
14	13	adantl 481	. . . . . 6 ⊢ (((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) ∧ 𝑠 = 𝑛) → (𝑅 Σg (𝑘 ∈ (0...𝑠) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑠 − 𝑘))))) = (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))))))
15		nnnn0 12449	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ0)
16	15	adantl 481	. . . . . 6 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ0)
17		ovexd 7422	. . . . . 6 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) → (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))))) ∈ V)
18	8, 14, 16, 17	fvmptd 6975	. . . . 5 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) → ((coe1‘(𝐹 × 𝐺))‘𝑛) = (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))))))
19		r19.26 3091	. . . . . . . . . 10 ⊢ (∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 ) ↔ (∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 ∧ ∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 ))
20		oveq2 7395	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 = 0 → (𝑛 − 𝑘) = (𝑛 − 0))
21		nncn 12194	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℂ)
22	21	subid1d 11522	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℕ → (𝑛 − 0) = 𝑛)
23	22	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (𝑛 − 0) = 𝑛)
24	20, 23	sylan9eqr 2786	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0) → (𝑛 − 𝑘) = 𝑛)
25		simpll 766	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0) → 𝑛 ∈ ℕ)
26	24, 25	eqeltrd 2828	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0) → (𝑛 − 𝑘) ∈ ℕ)
27		fveqeq2 6867	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑐 = (𝑛 − 𝑘) → (((coe1‘𝐺)‘𝑐) = 0 ↔ ((coe1‘𝐺)‘(𝑛 − 𝑘)) = 0 ))
28	27	rspcv 3584	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 − 𝑘) ∈ ℕ → (∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 → ((coe1‘𝐺)‘(𝑛 − 𝑘)) = 0 ))
29	26, 28	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0) → (∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 → ((coe1‘𝐺)‘(𝑛 − 𝑘)) = 0 ))
30		oveq2 7395	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((coe1‘𝐺)‘(𝑛 − 𝑘)) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = (((coe1‘𝐹)‘𝑘)(.r‘𝑅) 0 ))
31		simpll 766	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0)) → 𝑅 ∈ Ring)
32		simprl 770	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → 𝐹 ∈ 𝐵)
33		elfznn0 13581	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑘 ∈ (0...𝑛) → 𝑘 ∈ ℕ0)
34	33	adantl 481	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → 𝑘 ∈ ℕ0)
35	34	adantr 480	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0) → 𝑘 ∈ ℕ0)
36		eqid 2729	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (coe1‘𝐹) = (coe1‘𝐹)
37		eqid 2729	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (Base‘𝑅) = (Base‘𝑅)
38	36, 4, 1, 37	coe1fvalcl 22097	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝑘 ∈ ℕ0) → ((coe1‘𝐹)‘𝑘) ∈ (Base‘𝑅))
39	32, 35, 38	syl2an 596	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0)) → ((coe1‘𝐹)‘𝑘) ∈ (Base‘𝑅))
40		cply1mul.0	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 0 = (0g‘𝑅)
41	37, 3, 40	ringrz 20203	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑅 ∈ Ring ∧ ((coe1‘𝐹)‘𝑘) ∈ (Base‘𝑅)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅) 0 ) = 0 )
42	31, 39, 41	syl2anc 584	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅) 0 ) = 0 )
43	30, 42	sylan9eqr 2786	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0)) ∧ ((coe1‘𝐺)‘(𝑛 − 𝑘)) = 0 ) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )
44	43	ex 412	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0)) → (((coe1‘𝐺)‘(𝑛 − 𝑘)) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))
45	44	expcom 413	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0) → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (((coe1‘𝐺)‘(𝑛 − 𝑘)) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )))
46	45	com23 86	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0) → (((coe1‘𝐺)‘(𝑛 − 𝑘)) = 0 → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )))
47	29, 46	syldc 48	. . . . . . . . . . . . . . 15 ⊢ (∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 → (((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) ∧ 𝑘 = 0) → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )))
48	47	expd 415	. . . . . . . . . . . . . 14 ⊢ (∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (𝑘 = 0 → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
49	48	com24 95	. . . . . . . . . . . . 13 ⊢ (∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (𝑘 = 0 → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
50	49	adantl 481	. . . . . . . . . . . 12 ⊢ ((∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 ∧ ∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 ) → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (𝑘 = 0 → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
51	50	com13 88	. . . . . . . . . . 11 ⊢ (𝑘 = 0 → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → ((∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 ∧ ∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 ) → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
52		neqne 2933	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (¬ 𝑘 = 0 → 𝑘 ≠ 0)
53	52, 33	anim12ci 614	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((¬ 𝑘 = 0 ∧ 𝑘 ∈ (0...𝑛)) → (𝑘 ∈ ℕ0 ∧ 𝑘 ≠ 0))
54		elnnne0 12456	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ ℕ ↔ (𝑘 ∈ ℕ0 ∧ 𝑘 ≠ 0))
55	53, 54	sylibr 234	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((¬ 𝑘 = 0 ∧ 𝑘 ∈ (0...𝑛)) → 𝑘 ∈ ℕ)
56		fveqeq2 6867	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑐 = 𝑘 → (((coe1‘𝐹)‘𝑐) = 0 ↔ ((coe1‘𝐹)‘𝑘) = 0 ))
57	56	rspcv 3584	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ ℕ → (∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 → ((coe1‘𝐹)‘𝑘) = 0 ))
58	55, 57	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ ((¬ 𝑘 = 0 ∧ 𝑘 ∈ (0...𝑛)) → (∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 → ((coe1‘𝐹)‘𝑘) = 0 ))
59		oveq1 7394	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((coe1‘𝐹)‘𝑘) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = ( 0 (.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))))
60		simpll 766	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ 𝑘 ∈ (0...𝑛)) → 𝑅 ∈ Ring)
61	4	eleq2i 2820	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝐺 ∈ 𝐵 ↔ 𝐺 ∈ (Base‘𝑃))
62	61	biimpi 216	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝐺 ∈ 𝐵 → 𝐺 ∈ (Base‘𝑃))
63	62	adantl 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → 𝐺 ∈ (Base‘𝑃))
64	63	adantl 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → 𝐺 ∈ (Base‘𝑃))
65		fznn0sub 13517	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑘 ∈ (0...𝑛) → (𝑛 − 𝑘) ∈ ℕ0)
66		eqid 2729	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (coe1‘𝐺) = (coe1‘𝐺)
67		eqid 2729	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (Base‘𝑃) = (Base‘𝑃)
68	66, 67, 1, 37	coe1fvalcl 22097	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝐺 ∈ (Base‘𝑃) ∧ (𝑛 − 𝑘) ∈ ℕ0) → ((coe1‘𝐺)‘(𝑛 − 𝑘)) ∈ (Base‘𝑅))
69	64, 65, 68	syl2an 596	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ 𝑘 ∈ (0...𝑛)) → ((coe1‘𝐺)‘(𝑛 − 𝑘)) ∈ (Base‘𝑅))
70	37, 3, 40	ringlz 20202	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑅 ∈ Ring ∧ ((coe1‘𝐺)‘(𝑛 − 𝑘)) ∈ (Base‘𝑅)) → ( 0 (.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )
71	60, 69, 70	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ 𝑘 ∈ (0...𝑛)) → ( 0 (.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )
72	59, 71	sylan9eqr 2786	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ 𝑘 ∈ (0...𝑛)) ∧ ((coe1‘𝐹)‘𝑘) = 0 ) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )
73	72	ex 412	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))
74	73	ex 412	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (𝑘 ∈ (0...𝑛) → (((coe1‘𝐹)‘𝑘) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )))
75	74	com23 86	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (((coe1‘𝐹)‘𝑘) = 0 → (𝑘 ∈ (0...𝑛) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )))
76	75	a1dd 50	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (((coe1‘𝐹)‘𝑘) = 0 → (𝑛 ∈ ℕ → (𝑘 ∈ (0...𝑛) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
77	76	com14 96	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (0...𝑛) → (((coe1‘𝐹)‘𝑘) = 0 → (𝑛 ∈ ℕ → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
78	77	adantl 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((¬ 𝑘 = 0 ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘) = 0 → (𝑛 ∈ ℕ → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
79	58, 78	syld 47	. . . . . . . . . . . . . . . . . 18 ⊢ ((¬ 𝑘 = 0 ∧ 𝑘 ∈ (0...𝑛)) → (∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 → (𝑛 ∈ ℕ → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
80	79	com24 95	. . . . . . . . . . . . . . . . 17 ⊢ ((¬ 𝑘 = 0 ∧ 𝑘 ∈ (0...𝑛)) → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (𝑛 ∈ ℕ → (∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
81	80	ex 412	. . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑘 = 0 → (𝑘 ∈ (0...𝑛) → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (𝑛 ∈ ℕ → (∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )))))
82	81	com14 96	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (𝑘 ∈ (0...𝑛) → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (¬ 𝑘 = 0 → (∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )))))
83	82	imp 406	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (¬ 𝑘 = 0 → (∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
84	83	com14 96	. . . . . . . . . . . . 13 ⊢ (∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (¬ 𝑘 = 0 → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
85	84	adantr 480	. . . . . . . . . . . 12 ⊢ ((∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 ∧ ∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 ) → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (¬ 𝑘 = 0 → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
86	85	com13 88	. . . . . . . . . . 11 ⊢ (¬ 𝑘 = 0 → ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → ((∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 ∧ ∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 ) → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))))
87	51, 86	pm2.61i 182	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → ((∀𝑐 ∈ ℕ ((coe1‘𝐹)‘𝑐) = 0 ∧ ∀𝑐 ∈ ℕ ((coe1‘𝐺)‘𝑐) = 0 ) → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )))
88	19, 87	biimtrid 242	. . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 ) → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )))
89	88	imp 406	. . . . . . . 8 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) → ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 ))
90	89	impl 455	. . . . . . 7 ⊢ (((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (0...𝑛)) → (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))) = 0 )
91	90	mpteq2dva 5200	. . . . . 6 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) → (𝑘 ∈ (0...𝑛) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘)))) = (𝑘 ∈ (0...𝑛) ↦ 0 ))
92	91	oveq2d 7403	. . . . 5 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) → (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ (((coe1‘𝐹)‘𝑘)(.r‘𝑅)((coe1‘𝐺)‘(𝑛 − 𝑘))))) = (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ 0 )))
93		ringmnd 20152	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Mnd)
94		ovexd 7422	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (0...𝑛) ∈ V)
95	40	gsumz 18763	. . . . . . . . 9 ⊢ ((𝑅 ∈ Mnd ∧ (0...𝑛) ∈ V) → (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ 0 )) = 0 )
96	93, 94, 95	syl2anc 584	. . . . . . . 8 ⊢ (𝑅 ∈ Ring → (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ 0 )) = 0 )
97	96	adantr 480	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ 0 )) = 0 )
98	97	adantr 480	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) → (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ 0 )) = 0 )
99	98	adantr 480	. . . . 5 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) → (𝑅 Σg (𝑘 ∈ (0...𝑛) ↦ 0 )) = 0 )
100	18, 92, 99	3eqtrd 2768	. . . 4 ⊢ ((((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) ∧ 𝑛 ∈ ℕ) → ((coe1‘(𝐹 × 𝐺))‘𝑛) = 0 )
101	100	ralrimiva 3125	. . 3 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) → ∀𝑛 ∈ ℕ ((coe1‘(𝐹 × 𝐺))‘𝑛) = 0 )
102		fveqeq2 6867	. . . 4 ⊢ (𝑐 = 𝑛 → (((coe1‘(𝐹 × 𝐺))‘𝑐) = 0 ↔ ((coe1‘(𝐹 × 𝐺))‘𝑛) = 0 ))
103	102	cbvralvw 3215	. . 3 ⊢ (∀𝑐 ∈ ℕ ((coe1‘(𝐹 × 𝐺))‘𝑐) = 0 ↔ ∀𝑛 ∈ ℕ ((coe1‘(𝐹 × 𝐺))‘𝑛) = 0 )
104	101, 103	sylibr 234	. 2 ⊢ (((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) ∧ ∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 )) → ∀𝑐 ∈ ℕ ((coe1‘(𝐹 × 𝐺))‘𝑐) = 0 )
105	104	ex 412	1 ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 ) → ∀𝑐 ∈ ℕ ((coe1‘(𝐹 × 𝐺))‘𝑐) = 0 ))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  Vcvv 3447   ↦ cmpt 5188  ‘cfv 6511  (class class class)co 7387  0cc0 11068   − cmin 11405  ℕcn 12186  ℕ₀cn0 12442  ...cfz 13468  Basecbs 17179  ._rcmulr 17221  0_gc0g 17402   Σ_g cgsu 17403  Mndcmnd 18661  Ringcrg 20142  Poly₁cpl1 22061  coe₁cco1 22062

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-iin 4958  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-isom 6520  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-of 7653  df-ofr 7654  df-om 7843  df-1st 7968  df-2nd 7969  df-supp 8140  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-2o 8435  df-er 8671  df-map 8801  df-pm 8802  df-ixp 8871  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-fsupp 9313  df-sup 9393  df-oi 9463  df-card 9892  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-nn 12187  df-2 12249  df-3 12250  df-4 12251  df-5 12252  df-6 12253  df-7 12254  df-8 12255  df-9 12256  df-n0 12443  df-z 12530  df-dec 12650  df-uz 12794  df-fz 13469  df-fzo 13616  df-seq 13967  df-hash 14296  df-struct 17117  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-mulr 17234  df-sca 17236  df-vsca 17237  df-ip 17238  df-tset 17239  df-ple 17240  df-ds 17242  df-hom 17244  df-cco 17245  df-0g 17404  df-gsum 17405  df-prds 17410  df-pws 17412  df-mre 17547  df-mrc 17548  df-acs 17550  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-mhm 18710  df-submnd 18711  df-grp 18868  df-minusg 18869  df-mulg 19000  df-ghm 19145  df-cntz 19249  df-cmn 19712  df-abl 19713  df-mgp 20050  df-rng 20062  df-ur 20091  df-ring 20144  df-psr 21818  df-mpl 21820  df-opsr 21822  df-psr1 22064  df-ply1 22066  df-coe1 22067

This theorem is referenced by:  cpmatmcllem  22605