MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  plymul0or Structured version   Visualization version   GIF version

Theorem plymul0or 26408
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.
StepHypRef Expression
1 dgrcl 26359 . . . . . . 7 (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0)
2 dgrcl 26359 . . . . . . 7 (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ0)
3 nn0addcl 12539 . . . . . . 7 (((deg‘𝐹) ∈ ℕ0 ∧ (deg‘𝐺) ∈ ℕ0) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
41, 2, 3syl2an 607 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
5 c0ex 11200 . . . . . . 7 0 ∈ V
65fvconst2 7203 . . . . . 6 (((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0 → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
74, 6syl 18 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
8 fveq2 6882 . . . . . . . 8 ((𝐹f · 𝐺) = 0𝑝 → (coeff‘(𝐹f · 𝐺)) = (coeff‘0𝑝))
9 coe0 26382 . . . . . . . 8 (coeff‘0𝑝) = (ℕ0 × {0})
108, 9eqtrdi 2820 . . . . . . 7 ((𝐹f · 𝐺) = 0𝑝 → (coeff‘(𝐹f · 𝐺)) = (ℕ0 × {0}))
1110fveq1d 6884 . . . . . 6 ((𝐹f · 𝐺) = 0𝑝 → ((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))))
1211eqeq1d 2771 . . . . 5 ((𝐹f · 𝐺) = 0𝑝 → (((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0))
137, 12syl5ibrcom 250 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹f · 𝐺) = 0𝑝 → ((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0))
14 eqid 2769 . . . . . . 7 (coeff‘𝐹) = (coeff‘𝐹)
15 eqid 2769 . . . . . . 7 (coeff‘𝐺) = (coeff‘𝐺)
16 eqid 2769 . . . . . . 7 (deg‘𝐹) = (deg‘𝐹)
17 eqid 2769 . . . . . . 7 (deg‘𝐺) = (deg‘𝐺)
1814, 15, 16, 17coemulhi 26380 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))))
1918eqeq1d 2771 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))) = 0))
2014coef3 26358 . . . . . . . 8 (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐹):ℕ0⟶ℂ)
2120adantr 485 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘𝐹):ℕ0⟶ℂ)
221adantr 485 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘𝐹) ∈ ℕ0)
2321, 22ffvelcdmd 7081 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐹)‘(deg‘𝐹)) ∈ ℂ)
2415coef3 26358 . . . . . . . 8 (𝐺 ∈ (Poly‘𝑆) → (coeff‘𝐺):ℕ0⟶ℂ)
2524adantl 486 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘𝐺):ℕ0⟶ℂ)
262adantl 486 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘𝐺) ∈ ℕ0)
2725, 26ffvelcdmd 7081 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐺)‘(deg‘𝐺)) ∈ ℂ)
2823, 27mul0ord 11862 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
2919, 28bitrd 282 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
3013, 29sylibd 242 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹f · 𝐺) = 0𝑝 → (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
3116, 14dgreq0 26391 . . . . 5 (𝐹 ∈ (Poly‘𝑆) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
3231adantr 485 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
3317, 15dgreq0 26391 . . . . 5 (𝐺 ∈ (Poly‘𝑆) → (𝐺 = 0𝑝 ↔ ((coeff‘𝐺)‘(deg‘𝐺)) = 0))
3433adantl 486 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐺 = 0𝑝 ↔ ((coeff‘𝐺)‘(deg‘𝐺)) = 0))
3532, 34orbi12d 931 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝𝐺 = 0𝑝) ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
3630, 35sylibrd 262 . 2 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹f · 𝐺) = 0𝑝 → (𝐹 = 0𝑝𝐺 = 0𝑝)))
37 cnex 11181 . . . . . . 7 ℂ ∈ V
3837a1i 11 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ℂ ∈ V)
39 plyf 26324 . . . . . . 7 (𝐺 ∈ (Poly‘𝑆) → 𝐺:ℂ⟶ℂ)
4039adantl 486 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐺:ℂ⟶ℂ)
41 0cnd 11199 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 0 ∈ ℂ)
42 mul02 11388 . . . . . . 7 (𝑥 ∈ ℂ → (0 · 𝑥) = 0)
4342adantl 486 . . . . . 6 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (0 · 𝑥) = 0)
4438, 40, 41, 41, 43caofid2 7711 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℂ × {0}) ∘f · 𝐺) = (ℂ × {0}))
45 id 23 . . . . . . . 8 (𝐹 = 0𝑝𝐹 = 0𝑝)
46 df-0p 25798 . . . . . . . 8 0𝑝 = (ℂ × {0})
4745, 46eqtrdi 2820 . . . . . . 7 (𝐹 = 0𝑝𝐹 = (ℂ × {0}))
4847oveq1d 7426 . . . . . 6 (𝐹 = 0𝑝 → (𝐹f · 𝐺) = ((ℂ × {0}) ∘f · 𝐺))
4948eqeq1d 2771 . . . . 5 (𝐹 = 0𝑝 → ((𝐹f · 𝐺) = (ℂ × {0}) ↔ ((ℂ × {0}) ∘f · 𝐺) = (ℂ × {0})))
5044, 49syl5ibrcom 250 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 → (𝐹f · 𝐺) = (ℂ × {0})))
51 plyf 26324 . . . . . . 7 (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
5251adantr 485 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐹:ℂ⟶ℂ)
53 mul01 11389 . . . . . . 7 (𝑥 ∈ ℂ → (𝑥 · 0) = 0)
5453adantl 486 . . . . . 6 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (𝑥 · 0) = 0)
5538, 52, 41, 41, 54caofid1 7710 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹f · (ℂ × {0})) = (ℂ × {0}))
56 id 23 . . . . . . . 8 (𝐺 = 0𝑝𝐺 = 0𝑝)
5756, 46eqtrdi 2820 . . . . . . 7 (𝐺 = 0𝑝𝐺 = (ℂ × {0}))
5857oveq2d 7427 . . . . . 6 (𝐺 = 0𝑝 → (𝐹f · 𝐺) = (𝐹f · (ℂ × {0})))
5958eqeq1d 2771 . . . . 5 (𝐺 = 0𝑝 → ((𝐹f · 𝐺) = (ℂ × {0}) ↔ (𝐹f · (ℂ × {0})) = (ℂ × {0})))
6055, 59syl5ibrcom 250 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐺 = 0𝑝 → (𝐹f · 𝐺) = (ℂ × {0})))
6150, 60jaod 872 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝𝐺 = 0𝑝) → (𝐹f · 𝐺) = (ℂ × {0})))
6246eqeq2i 2782 . . 3 ((𝐹f · 𝐺) = 0𝑝 ↔ (𝐹f · 𝐺) = (ℂ × {0}))
6361, 62imbitrrdi 255 . 2 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝𝐺 = 0𝑝) → (𝐹f · 𝐺) = 0𝑝))
6436, 63impbid 215 1 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹f · 𝐺) = 0𝑝 ↔ (𝐹 = 0𝑝𝐺 = 0𝑝)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wo 860   = wceq 1567  wcel 2149  Vcvv 3463  {csn 4594   × cxp 5660  wf 6533  cfv 6537  (class class class)co 7411  f cof 7673  cc 11098  0cc0 11100   + caddc 11103   · cmul 11105  0cn0 12504  0𝑝c0p 25797  Polycply 26310  coeffccoe 26312  degcdgr 26313
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-inf2 9610  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177  ax-pre-sup 11178
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-of 7675  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-map 8826  df-pm 8827  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-sup 9402  df-inf 9403  df-oi 9472  df-card 9925  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-div 11872  df-nn 12234  df-2 12303  df-3 12304  df-n0 12505  df-z 12592  df-uz 12863  df-rp 13017  df-fz 13536  df-fzo 13683  df-fl 13825  df-seq 14038  df-exp 14098  df-hash 14367  df-cj 15150  df-re 15151  df-im 15152  df-sqrt 15286  df-abs 15287  df-clim 15539  df-rlim 15540  df-sum 15738  df-0p 25798  df-ply 26314  df-coe 26316  df-dgr 26317
This theorem is referenced by:  plydiveu  26428  quotcan  26439  vieta1lem1  26440  vieta1lem2  26441
  Copyright terms: Public domain W3C validator