Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  plymulx Structured version   Visualization version   GIF version

Theorem plymulx 32521
Description: Coefficients of a polynomial multiplied by Xp. (Contributed by Thierry Arnoux, 25-Sep-2018.)
Assertion
Ref Expression
plymulx (𝐹 ∈ (Poly‘ℝ) → (coeff‘(𝐹f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
Distinct variable group:   𝑛,𝐹

Proof of Theorem plymulx
Dummy variable 𝑚 is distinct from all other variables.
StepHypRef Expression
1 ax-resscn 10927 . . . . . . 7 ℝ ⊆ ℂ
2 1re 10974 . . . . . . 7 1 ∈ ℝ
3 plyid 25366 . . . . . . 7 ((ℝ ⊆ ℂ ∧ 1 ∈ ℝ) → Xp ∈ (Poly‘ℝ))
41, 2, 3mp2an 689 . . . . . 6 Xp ∈ (Poly‘ℝ)
5 plymul02 32519 . . . . . . 7 (Xp ∈ (Poly‘ℝ) → (0𝑝f · Xp) = 0𝑝)
65fveq2d 6773 . . . . . 6 (Xp ∈ (Poly‘ℝ) → (coeff‘(0𝑝f · Xp)) = (coeff‘0𝑝))
74, 6ax-mp 5 . . . . 5 (coeff‘(0𝑝f · Xp)) = (coeff‘0𝑝)
8 fconstmpt 5649 . . . . . 6 (ℕ0 × {0}) = (𝑛 ∈ ℕ0 ↦ 0)
9 coe0 25413 . . . . . 6 (coeff‘0𝑝) = (ℕ0 × {0})
10 eqidd 2741 . . . . . . . 8 ((𝑛 ∈ ℕ0𝑛 = 0) → 0 = 0)
11 elnnne0 12245 . . . . . . . . . . 11 (𝑛 ∈ ℕ ↔ (𝑛 ∈ ℕ0𝑛 ≠ 0))
12 df-ne 2946 . . . . . . . . . . . 12 (𝑛 ≠ 0 ↔ ¬ 𝑛 = 0)
1312anbi2i 623 . . . . . . . . . . 11 ((𝑛 ∈ ℕ0𝑛 ≠ 0) ↔ (𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0))
1411, 13bitr2i 275 . . . . . . . . . 10 ((𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0) ↔ 𝑛 ∈ ℕ)
15 nnm1nn0 12272 . . . . . . . . . 10 (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ0)
1614, 15sylbi 216 . . . . . . . . 9 ((𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0) → (𝑛 − 1) ∈ ℕ0)
17 eqidd 2741 . . . . . . . . . 10 (𝑚 = (𝑛 − 1) → 0 = 0)
18 fconstmpt 5649 . . . . . . . . . . 11 (ℕ0 × {0}) = (𝑚 ∈ ℕ0 ↦ 0)
199, 18eqtri 2768 . . . . . . . . . 10 (coeff‘0𝑝) = (𝑚 ∈ ℕ0 ↦ 0)
20 c0ex 10968 . . . . . . . . . 10 0 ∈ V
2117, 19, 20fvmpt 6870 . . . . . . . . 9 ((𝑛 − 1) ∈ ℕ0 → ((coeff‘0𝑝)‘(𝑛 − 1)) = 0)
2216, 21syl 17 . . . . . . . 8 ((𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0) → ((coeff‘0𝑝)‘(𝑛 − 1)) = 0)
2310, 22ifeqda 4501 . . . . . . 7 (𝑛 ∈ ℕ0 → if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1))) = 0)
2423mpteq2ia 5182 . . . . . 6 (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1)))) = (𝑛 ∈ ℕ0 ↦ 0)
258, 9, 243eqtr4ri 2779 . . . . 5 (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1)))) = (coeff‘0𝑝)
267, 25eqtr4i 2771 . . . 4 (coeff‘(0𝑝f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1))))
27 fvoveq1 7292 . . . 4 (𝐹 = 0𝑝 → (coeff‘(𝐹f · Xp)) = (coeff‘(0𝑝f · Xp)))
28 simpl 483 . . . . . . . 8 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → 𝐹 = 0𝑝)
2928fveq2d 6773 . . . . . . 7 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → (coeff‘𝐹) = (coeff‘0𝑝))
3029fveq1d 6771 . . . . . 6 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → ((coeff‘𝐹)‘(𝑛 − 1)) = ((coeff‘0𝑝)‘(𝑛 − 1)))
3130ifeq2d 4485 . . . . 5 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1))) = if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1))))
3231mpteq2dva 5179 . . . 4 (𝐹 = 0𝑝 → (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1)))))
3326, 27, 323eqtr4a 2806 . . 3 (𝐹 = 0𝑝 → (coeff‘(𝐹f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
3433adantl 482 . 2 ((𝐹 ∈ (Poly‘ℝ) ∧ 𝐹 = 0𝑝) → (coeff‘(𝐹f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
35 simpl 483 . . . 4 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → 𝐹 ∈ (Poly‘ℝ))
36 elsng 4581 . . . . . 6 (𝐹 ∈ (Poly‘ℝ) → (𝐹 ∈ {0𝑝} ↔ 𝐹 = 0𝑝))
3736notbid 318 . . . . 5 (𝐹 ∈ (Poly‘ℝ) → (¬ 𝐹 ∈ {0𝑝} ↔ ¬ 𝐹 = 0𝑝))
3837biimpar 478 . . . 4 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → ¬ 𝐹 ∈ {0𝑝})
3935, 38eldifd 3903 . . 3 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → 𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}))
40 plymulx0 32520 . . 3 (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (coeff‘(𝐹f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
4139, 40syl 17 . 2 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → (coeff‘(𝐹f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
4234, 41pm2.61dan 810 1 (𝐹 ∈ (Poly‘ℝ) → (coeff‘(𝐹f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396   = wceq 1542  wcel 2110  wne 2945  cdif 3889  wss 3892  ifcif 4465  {csn 4567  cmpt 5162   × cxp 5587  cfv 6431  (class class class)co 7269  f cof 7523  cc 10868  cr 10869  0cc0 10870  1c1 10871   · cmul 10875  cmin 11203  cn 11971  0cn0 12231  0𝑝c0p 24829  Polycply 25341  Xpcidp 25342  coeffccoe 25343
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2711  ax-rep 5214  ax-sep 5227  ax-nul 5234  ax-pow 5292  ax-pr 5356  ax-un 7580  ax-inf2 9375  ax-cnex 10926  ax-resscn 10927  ax-1cn 10928  ax-icn 10929  ax-addcl 10930  ax-addrcl 10931  ax-mulcl 10932  ax-mulrcl 10933  ax-mulcom 10934  ax-addass 10935  ax-mulass 10936  ax-distr 10937  ax-i2m1 10938  ax-1ne0 10939  ax-1rid 10940  ax-rnegex 10941  ax-rrecex 10942  ax-cnre 10943  ax-pre-lttri 10944  ax-pre-lttrn 10945  ax-pre-ltadd 10946  ax-pre-mulgt0 10947  ax-pre-sup 10948
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2072  df-mo 2542  df-eu 2571  df-clab 2718  df-cleq 2732  df-clel 2818  df-nfc 2891  df-ne 2946  df-nel 3052  df-ral 3071  df-rex 3072  df-reu 3073  df-rmo 3074  df-rab 3075  df-v 3433  df-sbc 3721  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-pss 3911  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4846  df-int 4886  df-iun 4932  df-br 5080  df-opab 5142  df-mpt 5163  df-tr 5197  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6200  df-ord 6267  df-on 6268  df-lim 6269  df-suc 6270  df-iota 6389  df-fun 6433  df-fn 6434  df-f 6435  df-f1 6436  df-fo 6437  df-f1o 6438  df-fv 6439  df-isom 6440  df-riota 7226  df-ov 7272  df-oprab 7273  df-mpo 7274  df-of 7525  df-om 7705  df-1st 7822  df-2nd 7823  df-frecs 8086  df-wrecs 8117  df-recs 8191  df-rdg 8230  df-1o 8286  df-er 8479  df-map 8598  df-pm 8599  df-en 8715  df-dom 8716  df-sdom 8717  df-fin 8718  df-sup 9177  df-inf 9178  df-oi 9245  df-card 9696  df-pnf 11010  df-mnf 11011  df-xr 11012  df-ltxr 11013  df-le 11014  df-sub 11205  df-neg 11206  df-div 11631  df-nn 11972  df-2 12034  df-3 12035  df-n0 12232  df-z 12318  df-uz 12580  df-rp 12728  df-fz 13237  df-fzo 13380  df-fl 13508  df-seq 13718  df-exp 13779  df-hash 14041  df-cj 14806  df-re 14807  df-im 14808  df-sqrt 14942  df-abs 14943  df-clim 15193  df-rlim 15194  df-sum 15394  df-0p 24830  df-ply 25345  df-idp 25346  df-coe 25347  df-dgr 25348
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator