Theorem plymul0or 23840

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

Assertion

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

Proof of Theorem plymul0or

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dgrcl 23793	. . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0)
2		dgrcl 23793	. . . . . . 7 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ0)
3		nn0addcl 11205	. . . . . . 7 ⊢ (((deg‘𝐹) ∈ ℕ0 ∧ (deg‘𝐺) ∈ ℕ0) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
4	1, 2, 3	syl2an 493	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
5		c0ex 9913	. . . . . . 7 ⊢ 0 ∈ V
6	5	fvconst2 6374	. . . . . 6 ⊢ (((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0 → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
7	4, 6	syl 17	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
8		fveq2 6103	. . . . . . . 8 ⊢ ((𝐹 ∘𝑓 · 𝐺) = 0𝑝 → (coeff‘(𝐹 ∘𝑓 · 𝐺)) = (coeff‘0𝑝))
9		coe0 23816	. . . . . . . 8 ⊢ (coeff‘0𝑝) = (ℕ0 × {0})
10	8, 9	syl6eq 2660	. . . . . . 7 ⊢ ((𝐹 ∘𝑓 · 𝐺) = 0𝑝 → (coeff‘(𝐹 ∘𝑓 · 𝐺)) = (ℕ0 × {0}))
11	10	fveq1d 6105	. . . . . 6 ⊢ ((𝐹 ∘𝑓 · 𝐺) = 0𝑝 → ((coeff‘(𝐹 ∘𝑓 · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))))
12	11	eqeq1d 2612	. . . . 5 ⊢ ((𝐹 ∘𝑓 · 𝐺) = 0𝑝 → (((coeff‘(𝐹 ∘𝑓 · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0))
13	7, 12	syl5ibrcom 236	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 ∘𝑓 · 𝐺) = 0𝑝 → ((coeff‘(𝐹 ∘𝑓 · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0))
14		eqid 2610	. . . . . . 7 ⊢ (coeff‘𝐹) = (coeff‘𝐹)
15		eqid 2610	. . . . . . 7 ⊢ (coeff‘𝐺) = (coeff‘𝐺)
16		eqid 2610	. . . . . . 7 ⊢ (deg‘𝐹) = (deg‘𝐹)
17		eqid 2610	. . . . . . 7 ⊢ (deg‘𝐺) = (deg‘𝐺)
18	14, 15, 16, 17	coemulhi 23814	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘(𝐹 ∘𝑓 · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))))
19	18	eqeq1d 2612	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((coeff‘(𝐹 ∘𝑓 · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))) = 0))
20	14	coef3 23792	. . . . . . . 8 ⊢ (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐹):ℕ0⟶ℂ)
21	20	adantr 480	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘𝐹):ℕ0⟶ℂ)
22	1	adantr 480	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘𝐹) ∈ ℕ0)
23	21, 22	ffvelrnd 6268	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐹)‘(deg‘𝐹)) ∈ ℂ)
24	15	coef3 23792	. . . . . . . 8 ⊢ (𝐺 ∈ (Poly‘𝑆) → (coeff‘𝐺):ℕ0⟶ℂ)
25	24	adantl 481	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘𝐺):ℕ0⟶ℂ)
26	2	adantl 481	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘𝐺) ∈ ℕ0)
27	25, 26	ffvelrnd 6268	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐺)‘(deg‘𝐺)) ∈ ℂ)
28	23, 27	mul0ord 10556	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
29	19, 28	bitrd 267	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((coeff‘(𝐹 ∘𝑓 · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
30	13, 29	sylibd 228	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 ∘𝑓 · 𝐺) = 0𝑝 → (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
31	16, 14	dgreq0 23825	. . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
32	31	adantr 480	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
33	17, 15	dgreq0 23825	. . . . 5 ⊢ (𝐺 ∈ (Poly‘𝑆) → (𝐺 = 0𝑝 ↔ ((coeff‘𝐺)‘(deg‘𝐺)) = 0))
34	33	adantl 481	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐺 = 0𝑝 ↔ ((coeff‘𝐺)‘(deg‘𝐺)) = 0))
35	32, 34	orbi12d 742	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝) ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
36	30, 35	sylibrd 248	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 ∘𝑓 · 𝐺) = 0𝑝 → (𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝)))
37		cnex 9896	. . . . . . 7 ⊢ ℂ ∈ V
38	37	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ℂ ∈ V)
39		plyf 23758	. . . . . . 7 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺:ℂ⟶ℂ)
40	39	adantl 481	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐺:ℂ⟶ℂ)
41		0cnd 9912	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 0 ∈ ℂ)
42		mul02 10093	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (0 · 𝑥) = 0)
43	42	adantl 481	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (0 · 𝑥) = 0)
44	38, 40, 41, 41, 43	caofid2 6826	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℂ × {0}) ∘𝑓 · 𝐺) = (ℂ × {0}))
45		id 22	. . . . . . . 8 ⊢ (𝐹 = 0𝑝 → 𝐹 = 0𝑝)
46		df-0p 23243	. . . . . . . 8 ⊢ 0𝑝 = (ℂ × {0})
47	45, 46	syl6eq 2660	. . . . . . 7 ⊢ (𝐹 = 0𝑝 → 𝐹 = (ℂ × {0}))
48	47	oveq1d 6564	. . . . . 6 ⊢ (𝐹 = 0𝑝 → (𝐹 ∘𝑓 · 𝐺) = ((ℂ × {0}) ∘𝑓 · 𝐺))
49	48	eqeq1d 2612	. . . . 5 ⊢ (𝐹 = 0𝑝 → ((𝐹 ∘𝑓 · 𝐺) = (ℂ × {0}) ↔ ((ℂ × {0}) ∘𝑓 · 𝐺) = (ℂ × {0})))
50	44, 49	syl5ibrcom 236	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 → (𝐹 ∘𝑓 · 𝐺) = (ℂ × {0})))
51		plyf 23758	. . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
52	51	adantr 480	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐹:ℂ⟶ℂ)
53		mul01 10094	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (𝑥 · 0) = 0)
54	53	adantl 481	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (𝑥 · 0) = 0)
55	38, 52, 41, 41, 54	caofid1 6825	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘𝑓 · (ℂ × {0})) = (ℂ × {0}))
56		id 22	. . . . . . . 8 ⊢ (𝐺 = 0𝑝 → 𝐺 = 0𝑝)
57	56, 46	syl6eq 2660	. . . . . . 7 ⊢ (𝐺 = 0𝑝 → 𝐺 = (ℂ × {0}))
58	57	oveq2d 6565	. . . . . 6 ⊢ (𝐺 = 0𝑝 → (𝐹 ∘𝑓 · 𝐺) = (𝐹 ∘𝑓 · (ℂ × {0})))
59	58	eqeq1d 2612	. . . . 5 ⊢ (𝐺 = 0𝑝 → ((𝐹 ∘𝑓 · 𝐺) = (ℂ × {0}) ↔ (𝐹 ∘𝑓 · (ℂ × {0})) = (ℂ × {0})))
60	55, 59	syl5ibrcom 236	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐺 = 0𝑝 → (𝐹 ∘𝑓 · 𝐺) = (ℂ × {0})))
61	50, 60	jaod 394	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝) → (𝐹 ∘𝑓 · 𝐺) = (ℂ × {0})))
62	46	eqeq2i 2622	. . 3 ⊢ ((𝐹 ∘𝑓 · 𝐺) = 0𝑝 ↔ (𝐹 ∘𝑓 · 𝐺) = (ℂ × {0}))
63	61, 62	syl6ibr 241	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝) → (𝐹 ∘𝑓 · 𝐺) = 0𝑝))
64	36, 63	impbid 201	1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 ∘𝑓 · 𝐺) = 0𝑝 ↔ (𝐹 = 0𝑝 ∨ 𝐺 = 0𝑝)))

Syntax hints:   → wi 4   ↔ wb 195   ∨ wo 382   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  {csn 4125   × cxp 5036  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549   ∘_𝑓 cof 6793  ℂcc 9813  0cc0 9815   + caddc 9818   · cmul 9820  ℕ₀cn0 11169  0_𝑝c0p 23242  Polycply 23744  coeffccoe 23746  degcdgr 23747

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893  ax-addf 9894

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-of 6795  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-inf 8232  df-oi 8298  df-card 8648  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-z 11255  df-uz 11564  df-rp 11709  df-fz 12198  df-fzo 12335  df-fl 12455  df-seq 12664  df-exp 12723  df-hash 12980  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-clim 14067  df-rlim 14068  df-sum 14265  df-0p 23243  df-ply 23748  df-coe 23750  df-dgr 23751

This theorem is referenced by:  plydiveu  23857  quotcan  23868  vieta1lem1  23869  vieta1lem2  23870