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

Theorem plymul0or 26259
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 26209 . . . . . . 7 (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0)
2 dgrcl 26209 . . . . . . 7 (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ0)
3 nn0addcl 12448 . . . . . . 7 (((deg‘𝐹) ∈ ℕ0 ∧ (deg‘𝐺) ∈ ℕ0) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
41, 2, 3syl2an 597 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0)
5 c0ex 11138 . . . . . . 7 0 ∈ V
65fvconst2 7160 . . . . . 6 (((deg‘𝐹) + (deg‘𝐺)) ∈ ℕ0 → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
74, 6syl 17 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0)
8 fveq2 6842 . . . . . . . 8 ((𝐹f · 𝐺) = 0𝑝 → (coeff‘(𝐹f · 𝐺)) = (coeff‘0𝑝))
9 coe0 26232 . . . . . . . 8 (coeff‘0𝑝) = (ℕ0 × {0})
108, 9eqtrdi 2788 . . . . . . 7 ((𝐹f · 𝐺) = 0𝑝 → (coeff‘(𝐹f · 𝐺)) = (ℕ0 × {0}))
1110fveq1d 6844 . . . . . 6 ((𝐹f · 𝐺) = 0𝑝 → ((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))))
1211eqeq1d 2739 . . . . 5 ((𝐹f · 𝐺) = 0𝑝 → (((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ ((ℕ0 × {0})‘((deg‘𝐹) + (deg‘𝐺))) = 0))
137, 12syl5ibrcom 247 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹f · 𝐺) = 0𝑝 → ((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0))
14 eqid 2737 . . . . . . 7 (coeff‘𝐹) = (coeff‘𝐹)
15 eqid 2737 . . . . . . 7 (coeff‘𝐺) = (coeff‘𝐺)
16 eqid 2737 . . . . . . 7 (deg‘𝐹) = (deg‘𝐹)
17 eqid 2737 . . . . . . 7 (deg‘𝐺) = (deg‘𝐺)
1814, 15, 16, 17coemulhi 26230 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))))
1918eqeq1d 2739 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))) = 0))
2014coef3 26208 . . . . . . . 8 (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐹):ℕ0⟶ℂ)
2120adantr 480 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘𝐹):ℕ0⟶ℂ)
221adantr 480 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘𝐹) ∈ ℕ0)
2321, 22ffvelcdmd 7039 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐹)‘(deg‘𝐹)) ∈ ℂ)
2415coef3 26208 . . . . . . . 8 (𝐺 ∈ (Poly‘𝑆) → (coeff‘𝐺):ℕ0⟶ℂ)
2524adantl 481 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘𝐺):ℕ0⟶ℂ)
262adantl 481 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘𝐺) ∈ ℕ0)
2725, 26ffvelcdmd 7039 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘𝐺)‘(deg‘𝐺)) ∈ ℂ)
2823, 27mul0ord 11797 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((((coeff‘𝐹)‘(deg‘𝐹)) · ((coeff‘𝐺)‘(deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
2919, 28bitrd 279 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((coeff‘(𝐹f · 𝐺))‘((deg‘𝐹) + (deg‘𝐺))) = 0 ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
3013, 29sylibd 239 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹f · 𝐺) = 0𝑝 → (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
3116, 14dgreq0 26242 . . . . 5 (𝐹 ∈ (Poly‘𝑆) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
3231adantr 480 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 ↔ ((coeff‘𝐹)‘(deg‘𝐹)) = 0))
3317, 15dgreq0 26242 . . . . 5 (𝐺 ∈ (Poly‘𝑆) → (𝐺 = 0𝑝 ↔ ((coeff‘𝐺)‘(deg‘𝐺)) = 0))
3433adantl 481 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐺 = 0𝑝 ↔ ((coeff‘𝐺)‘(deg‘𝐺)) = 0))
3532, 34orbi12d 919 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝𝐺 = 0𝑝) ↔ (((coeff‘𝐹)‘(deg‘𝐹)) = 0 ∨ ((coeff‘𝐺)‘(deg‘𝐺)) = 0)))
3630, 35sylibrd 259 . 2 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹f · 𝐺) = 0𝑝 → (𝐹 = 0𝑝𝐺 = 0𝑝)))
37 cnex 11119 . . . . . . 7 ℂ ∈ V
3837a1i 11 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ℂ ∈ V)
39 plyf 26174 . . . . . . 7 (𝐺 ∈ (Poly‘𝑆) → 𝐺:ℂ⟶ℂ)
4039adantl 481 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐺:ℂ⟶ℂ)
41 0cnd 11137 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 0 ∈ ℂ)
42 mul02 11323 . . . . . . 7 (𝑥 ∈ ℂ → (0 · 𝑥) = 0)
4342adantl 481 . . . . . 6 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (0 · 𝑥) = 0)
4438, 40, 41, 41, 43caofid2 7668 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((ℂ × {0}) ∘f · 𝐺) = (ℂ × {0}))
45 id 22 . . . . . . . 8 (𝐹 = 0𝑝𝐹 = 0𝑝)
46 df-0p 25642 . . . . . . . 8 0𝑝 = (ℂ × {0})
4745, 46eqtrdi 2788 . . . . . . 7 (𝐹 = 0𝑝𝐹 = (ℂ × {0}))
4847oveq1d 7383 . . . . . 6 (𝐹 = 0𝑝 → (𝐹f · 𝐺) = ((ℂ × {0}) ∘f · 𝐺))
4948eqeq1d 2739 . . . . 5 (𝐹 = 0𝑝 → ((𝐹f · 𝐺) = (ℂ × {0}) ↔ ((ℂ × {0}) ∘f · 𝐺) = (ℂ × {0})))
5044, 49syl5ibrcom 247 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 0𝑝 → (𝐹f · 𝐺) = (ℂ × {0})))
51 plyf 26174 . . . . . . 7 (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
5251adantr 480 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐹:ℂ⟶ℂ)
53 mul01 11324 . . . . . . 7 (𝑥 ∈ ℂ → (𝑥 · 0) = 0)
5453adantl 481 . . . . . 6 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑥 ∈ ℂ) → (𝑥 · 0) = 0)
5538, 52, 41, 41, 54caofid1 7667 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹f · (ℂ × {0})) = (ℂ × {0}))
56 id 22 . . . . . . . 8 (𝐺 = 0𝑝𝐺 = 0𝑝)
5756, 46eqtrdi 2788 . . . . . . 7 (𝐺 = 0𝑝𝐺 = (ℂ × {0}))
5857oveq2d 7384 . . . . . 6 (𝐺 = 0𝑝 → (𝐹f · 𝐺) = (𝐹f · (ℂ × {0})))
5958eqeq1d 2739 . . . . 5 (𝐺 = 0𝑝 → ((𝐹f · 𝐺) = (ℂ × {0}) ↔ (𝐹f · (ℂ × {0})) = (ℂ × {0})))
6055, 59syl5ibrcom 247 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐺 = 0𝑝 → (𝐹f · 𝐺) = (ℂ × {0})))
6150, 60jaod 860 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝𝐺 = 0𝑝) → (𝐹f · 𝐺) = (ℂ × {0})))
6246eqeq2i 2750 . . 3 ((𝐹f · 𝐺) = 0𝑝 ↔ (𝐹f · 𝐺) = (ℂ × {0}))
6361, 62imbitrrdi 252 . 2 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹 = 0𝑝𝐺 = 0𝑝) → (𝐹f · 𝐺) = 0𝑝))
6436, 63impbid 212 1 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝐹f · 𝐺) = 0𝑝 ↔ (𝐹 = 0𝑝𝐺 = 0𝑝)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 848   = wceq 1542  wcel 2114  Vcvv 3442  {csn 4582   × cxp 5630  wf 6496  cfv 6500  (class class class)co 7368  f cof 7630  cc 11036  0cc0 11038   + caddc 11041   · cmul 11043  0cn0 12413  0𝑝c0p 25641  Polycply 26160  coeffccoe 26162  degcdgr 26163
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-inf2 9562  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-of 7632  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-er 8645  df-map 8777  df-pm 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-sup 9357  df-inf 9358  df-oi 9427  df-card 9863  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-div 11807  df-nn 12158  df-2 12220  df-3 12221  df-n0 12414  df-z 12501  df-uz 12764  df-rp 12918  df-fz 13436  df-fzo 13583  df-fl 13724  df-seq 13937  df-exp 13997  df-hash 14266  df-cj 15034  df-re 15035  df-im 15036  df-sqrt 15170  df-abs 15171  df-clim 15423  df-rlim 15424  df-sum 15622  df-0p 25642  df-ply 26164  df-coe 26166  df-dgr 26167
This theorem is referenced by:  plydiveu  26277  quotcan  26288  vieta1lem1  26289  vieta1lem2  26290
  Copyright terms: Public domain W3C validator