Theorem plymul0or 26599

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 26552	. . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0)
2		dgrcl 26552	. . . . . . 7 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ0)
3		nn0addcl 12641	. . . . . . 7 ⊢ (((deg‘𝐹) ∈ ℕ0 ∧ (deg‘𝐺) ∈ ℕ0) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
4	1, 2, 3	syl2an 608	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
5		c0ex 11300	. . . . . . 7 ⊢ 0 ∈ V
6	5	fvconst2 7210	. . . . . 6 ⊢ (((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0 → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
7	4, 6	syl 18	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
8		fveq2 6885	. . . . . . . 8 ⊢ ((𝐹 ∘f · 𝐺) = 0𝑝 → (coeff‘(𝐹 ∘f · 𝐺)) = (coeff‘0𝑝))
9		coe0 26575	. . . . . . . 8 ⊢ (coeff‘0𝑝) = (ℕ0 × {0})
10	8, 9	eqtrdi 2812	. . . . . . 7 ⊢ ((𝐹 ∘f · 𝐺) = 0𝑝 → (coeff‘(𝐹 ∘f · 𝐺)) = (ℕ0 × {0}))
11	10	fveq1d 6887	. . . . . 6 ⊢ ((𝐹 ∘f · 𝐺) = 0𝑝 → ((coeff‘(𝐹 ∘f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))))
12	11	eqeq1d 2763	. . . . 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 2761	. . . . . . 7 ⊢ (coeff‘𝐹) = (coeff‘𝐹)
15		eqid 2761	. . . . . . 7 ⊢ (coeff‘𝐺) = (coeff‘𝐺)
16		eqid 2761	. . . . . . 7 ⊢ (deg‘𝐹) = (deg‘𝐹)
17		eqid 2761	. . . . . . 7 ⊢ (deg‘𝐺) = (deg‘𝐺)
18	14, 15, 16, 17	coemulhi 26573	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘(𝐹 ∘f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))))
19	18	eqeq1d 2763	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((coeff‘(𝐹 ∘f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))) = 0))
20	14	coef3 26551	. . . . . . . 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 7085	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐹)‘(deg‘𝐹)) ∈ ℂ)
24	15	coef3 26551	. . . . . . . 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 7085	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐺)‘(deg‘𝐺)) ∈ ℂ)
28	23, 27	mul0ord 11964	. . . . 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 26584	. . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
32	31	adantr 486	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
33	17, 15	dgreq0 26584	. . . . 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 11281	. . . . . . 7 ⊢ ℂ ∈ V
38	37	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ℂ ∈ V)
39		plyf 26516	. . . . . . 7 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺:ℂ⟶ℂ)
40	39	adantl 487	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐺:ℂ⟶ℂ)
41		0cnd 11299	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 0 ∈ ℂ)
42		mul02 11488	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (0 · 𝑥) = 0)
43	42	adantl 487	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (0 · 𝑥) = 0)
44	38, 40, 41, 41, 43	caofid2 7729	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℂ × {0}) ∘f · 𝐺) = (ℂ × {0}))
45		id 23	. . . . . . . 8 ⊢ (𝐹 = 0𝑝 → 𝐹 = 0𝑝)
46		df-0p 25991	. . . . . . . 8 ⊢ 0𝑝 = (ℂ × {0})
47	45, 46	eqtrdi 2812	. . . . . . 7 ⊢ (𝐹 = 0𝑝 → 𝐹 = (ℂ × {0}))
48	47	oveq1d 7435	. . . . . 6 ⊢ (𝐹 = 0𝑝 → (𝐹 ∘f · 𝐺) = ((ℂ × {0}) ∘f · 𝐺))
49	48	eqeq1d 2763	. . . . 5 ⊢ (𝐹 = 0𝑝 → ((𝐹 ∘f · 𝐺) = (ℂ × {0}) ↔ ((ℂ × {0}) ∘f · 𝐺) = (ℂ × {0})))
50	44, 49	syl5ibrcom 250	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 → (𝐹 ∘f · 𝐺) = (ℂ × {0})))
51		plyf 26516	. . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
52	51	adantr 486	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐹:ℂ⟶ℂ)
53		mul01 11489	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (𝑥 · 0) = 0)
54	53	adantl 487	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (𝑥 · 0) = 0)
55	38, 52, 41, 41, 54	caofid1 7728	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘f · (ℂ × {0})) = (ℂ × {0}))
56		id 23	. . . . . . . 8 ⊢ (𝐺 = 0𝑝 → 𝐺 = 0𝑝)
57	56, 46	eqtrdi 2812	. . . . . . 7 ⊢ (𝐺 = 0𝑝 → 𝐺 = (ℂ × {0}))
58	57	oveq2d 7436	. . . . . 6 ⊢ (𝐺 = 0𝑝 → (𝐹 ∘f · 𝐺) = (𝐹 ∘f · (ℂ × {0})))
59	58	eqeq1d 2763	. . . . 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 2774	. . 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 3451  {csn 4584   × cxp 5649  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ∘_f cof 7691  ℂcc 11198  0cc0 11200   + caddc 11203   · cmul 11205  ℕ₀cn0 12606  0_𝑝c0p 25990  Polycply 26502  coeffccoe 26504  degcdgr 26505

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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-inf2 9642  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277  ax-pre-sup 11278

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  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 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 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-er 8717  df-map 8849  df-pm 8850  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-sup 9434  df-inf 9435  df-oi 9504  df-card 10020  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-div 11974  df-nn 12336  df-2 12405  df-3 12406  df-n0 12607  df-z 12694  df-uz 12966  df-rp 13121  df-fz 13640  df-fzo 13789  df-fl 13932  df-seq 14145  df-exp 14205  df-hash 14475  df-cj 15266  df-re 15267  df-im 15268  df-sqrt 15402  df-abs 15403  df-clim 15655  df-rlim 15656  df-sum 15854  df-0p 25991  df-ply 26506  df-coe 26508  df-dgr 26509

This theorem is used by:  plydiveu  26619  quotcan  26632  vieta1lem1  26633  vieta1lem2  26634