Theorem plymul0or 26511

Description: Polynomial multiplication has no zero divisors. (Contributed by Mario Carneiro, 26-Jul-2014.)

Assertion

Ref	Expression
plymul0or	⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 ∘f · 𝐺) = 0𝑝 ↔ (𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝)))

Proof of Theorem plymul0or

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dgrcl 26462	. . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0)
2		dgrcl 26462	. . . . . . 7 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ0)
3		nn0addcl 12566	. . . . . . 7 ⊢ (((deg‘𝐹) ∈ ℕ0 ∧ (deg‘𝐺) ∈ ℕ0) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
4	1, 2, 3	syl2an 608	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
5		c0ex 11227	. . . . . . 7 ⊢ 0 ∈ V
6	5	fvconst2 7204	. . . . . 6 ⊢ (((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0 → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
7	4, 6	syl 18	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
8		fveq2 6879	. . . . . . . 8 ⊢ ((𝐹 ∘f · 𝐺) = 0𝑝 → (coeff‘(𝐹 ∘f · 𝐺)) = (coeff‘0𝑝))
9		coe0 26485	. . . . . . . 8 ⊢ (coeff‘0𝑝) = (ℕ0 × {0})
10	8, 9	eqtrdi 2811	. . . . . . 7 ⊢ ((𝐹 ∘f · 𝐺) = 0𝑝 → (coeff‘(𝐹 ∘f · 𝐺)) = (ℕ0 × {0}))
11	10	fveq1d 6881	. . . . . 6 ⊢ ((𝐹 ∘f · 𝐺) = 0𝑝 → ((coeff‘(𝐹 ∘f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))))
12	11	eqeq1d 2762	. . . . 5 ⊢ ((𝐹 ∘f · 𝐺) = 0𝑝 → (((coeff‘(𝐹 ∘f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0))
13	7, 12	syl5ibrcom 250	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 ∘f · 𝐺) = 0𝑝 → ((coeff‘(𝐹 ∘f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0))
14		eqid 2760	. . . . . . 7 ⊢ (coeff‘𝐹) = (coeff‘𝐹)
15		eqid 2760	. . . . . . 7 ⊢ (coeff‘𝐺) = (coeff‘𝐺)
16		eqid 2760	. . . . . . 7 ⊢ (deg‘𝐹) = (deg‘𝐹)
17		eqid 2760	. . . . . . 7 ⊢ (deg‘𝐺) = (deg‘𝐺)
18	14, 15, 16, 17	coemulhi 26483	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘(𝐹 ∘f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))))
19	18	eqeq1d 2762	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((coeff‘(𝐹 ∘f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))) = 0))
20	14	coef3 26461	. . . . . . . 8 ⊢ (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐹):ℕ0⟶ℂ)
21	20	adantr 486	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘𝐹):ℕ0⟶ℂ)
22	1	adantr 486	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘𝐹) ∈ ℕ0)
23	21, 22	ffvelcdmd 7079	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐹)‘(deg‘𝐹)) ∈ ℂ)
24	15	coef3 26461	. . . . . . . 8 ⊢ (𝐺 ∈ (Poly‘𝑆) → (coeff‘𝐺):ℕ0⟶ℂ)
25	24	adantl 487	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘𝐺):ℕ0⟶ℂ)
26	2	adantl 487	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘𝐺) ∈ ℕ0)
27	25, 26	ffvelcdmd 7079	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐺)‘(deg‘𝐺)) ∈ ℂ)
28	23, 27	mul0ord 11889	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
29	19, 28	bitrd 282	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((coeff‘(𝐹 ∘f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
30	13, 29	sylibd 242	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 ∘f · 𝐺) = 0𝑝 → (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
31	16, 14	dgreq0 26494	. . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
32	31	adantr 486	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
33	17, 15	dgreq0 26494	. . . . 5 ⊢ (𝐺 ∈ (Poly‘𝑆) → (𝐺 = 0𝑝 ↔ ((coeff‘𝐺)‘(deg‘𝐺)) = 0))
34	33	adantl 487	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐺 = 0𝑝 ↔ ((coeff‘𝐺)‘(deg‘𝐺)) = 0))
35	32, 34	orbi12d 932	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝) ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
36	30, 35	sylibrd 262	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 ∘f · 𝐺) = 0𝑝 → (𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝)))
37		cnex 11208	. . . . . . 7 ⊢ ℂ ∈ V
38	37	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ℂ ∈ V)
39		plyf 26426	. . . . . . 7 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺:ℂ⟶ℂ)
40	39	adantl 487	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐺:ℂ⟶ℂ)
41		0cnd 11226	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 0 ∈ ℂ)
42		mul02 11415	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (0 · 𝑥) = 0)
43	42	adantl 487	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (0 · 𝑥) = 0)
44	38, 40, 41, 41, 43	caofid2 7715	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℂ × {0}) ∘f · 𝐺) = (ℂ × {0}))
45		id 23	. . . . . . . 8 ⊢ (𝐹 = 0𝑝 → 𝐹 = 0𝑝)
46		df-0p 25901	. . . . . . . 8 ⊢ 0𝑝 = (ℂ × {0})
47	45, 46	eqtrdi 2811	. . . . . . 7 ⊢ (𝐹 = 0𝑝 → 𝐹 = (ℂ × {0}))
48	47	oveq1d 7429	. . . . . 6 ⊢ (𝐹 = 0𝑝 → (𝐹 ∘f · 𝐺) = ((ℂ × {0}) ∘f · 𝐺))
49	48	eqeq1d 2762	. . . . 5 ⊢ (𝐹 = 0𝑝 → ((𝐹 ∘f · 𝐺) = (ℂ × {0}) ↔ ((ℂ × {0}) ∘f · 𝐺) = (ℂ × {0})))
50	44, 49	syl5ibrcom 250	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 → (𝐹 ∘f · 𝐺) = (ℂ × {0})))
51		plyf 26426	. . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
52	51	adantr 486	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐹:ℂ⟶ℂ)
53		mul01 11416	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (𝑥 · 0) = 0)
54	53	adantl 487	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (𝑥 · 0) = 0)
55	38, 52, 41, 41, 54	caofid1 7714	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘f · (ℂ × {0})) = (ℂ × {0}))
56		id 23	. . . . . . . 8 ⊢ (𝐺 = 0𝑝 → 𝐺 = 0𝑝)
57	56, 46	eqtrdi 2811	. . . . . . 7 ⊢ (𝐺 = 0𝑝 → 𝐺 = (ℂ × {0}))
58	57	oveq2d 7430	. . . . . 6 ⊢ (𝐺 = 0𝑝 → (𝐹 ∘f · 𝐺) = (𝐹 ∘f · (ℂ × {0})))
59	58	eqeq1d 2762	. . . . 5 ⊢ (𝐺 = 0𝑝 → ((𝐹 ∘f · 𝐺) = (ℂ × {0}) ↔ (𝐹 ∘f · (ℂ × {0})) = (ℂ × {0})))
60	55, 59	syl5ibrcom 250	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐺 = 0𝑝 → (𝐹 ∘f · 𝐺) = (ℂ × {0})))
61	50, 60	jaod 873	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝) → (𝐹 ∘f · 𝐺) = (ℂ × {0})))
62	46	eqeq2i 2773	. . 3 ⊢ ((𝐹 ∘f · 𝐺) = 0𝑝 ↔ (𝐹 ∘f · 𝐺) = (ℂ × {0}))
63	61, 62	imbitrrdi 255	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝) → (𝐹 ∘f · 𝐺) = 0𝑝))
64	36, 63	impbid 215	1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 ∘f · 𝐺) = 0𝑝 ↔ (𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145  Vcvv 3450  {csn 4584   × cxp 5653  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414   ∘_f cof 7677  ℂcc 11125  0cc0 11127   + caddc 11130   · cmul 11132  ℕ₀cn0 12531  0_𝑝c0p 25900  Polycply 26412  coeffccoe 26414  degcdgr 26415

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-inf2 9623  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204  ax-pre-sup 11205

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-op 4591  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-of 7679  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8458  df-er 8699  df-map 8831  df-pm 8832  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-sup 9415  df-inf 9416  df-oi 9485  df-card 9947  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-div 11899  df-nn 12261  df-2 12330  df-3 12331  df-n0 12532  df-z 12619  df-uz 12891  df-rp 13046  df-fz 13565  df-fzo 13713  df-fl 13856  df-seq 14069  df-exp 14129  df-hash 14398  df-cj 15189  df-re 15190  df-im 15191  df-sqrt 15325  df-abs 15326  df-clim 15578  df-rlim 15579  df-sum 15777  df-0p 25901  df-ply 26416  df-coe 26418  df-dgr 26419

This theorem is used by:  plydiveu  26531  quotcan  26544  vieta1lem1  26545  vieta1lem2  26546