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 34741
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 11087 . . . . . . 7 ℝ ⊆ ℂ
2 1re 11136 . . . . . . 7 1 ∈ ℝ
3 plyid 26193 . . . . . . 7 ((ℝ ⊆ ℂ ∧ 1 ∈ ℝ) → Xp ∈ (Poly‘ℝ))
41, 2, 3mp2an 698 . . . . . 6 Xp ∈ (Poly‘ℝ)
5 plymul02 34739 . . . . . . 7 (Xp ∈ (Poly‘ℝ) → (0𝑝f · Xp) = 0𝑝)
65fveq2d 6832 . . . . . 6 (Xp ∈ (Poly‘ℝ) → (coeff‘(0𝑝f · Xp)) = (coeff‘0𝑝))
74, 6ax-mp 5 . . . . 5 (coeff‘(0𝑝f · Xp)) = (coeff‘0𝑝)
8 fconstmpt 5681 . . . . . 6 (ℕ0 × {0}) = (𝑛 ∈ ℕ0 ↦ 0)
9 coe0 26240 . . . . . 6 (coeff‘0𝑝) = (ℕ0 × {0})
10 eqidd 2740 . . . . . . . 8 ((𝑛 ∈ ℕ0𝑛 = 0) → 0 = 0)
11 elnnne0 12443 . . . . . . . . . . 11 (𝑛 ∈ ℕ ↔ (𝑛 ∈ ℕ0𝑛 ≠ 0))
12 df-ne 2935 . . . . . . . . . . . 12 (𝑛 ≠ 0 ↔ ¬ 𝑛 = 0)
1312anbi2i 629 . . . . . . . . . . 11 ((𝑛 ∈ ℕ0𝑛 ≠ 0) ↔ (𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0))
1411, 13bitr2i 277 . . . . . . . . . 10 ((𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0) ↔ 𝑛 ∈ ℕ)
15 nnm1nn0 12470 . . . . . . . . . 10 (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ0)
1614, 15sylbi 218 . . . . . . . . 9 ((𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0) → (𝑛 − 1) ∈ ℕ0)
17 eqidd 2740 . . . . . . . . . 10 (𝑚 = (𝑛 − 1) → 0 = 0)
18 fconstmpt 5681 . . . . . . . . . . 11 (ℕ0 × {0}) = (𝑚 ∈ ℕ0 ↦ 0)
199, 18eqtri 2762 . . . . . . . . . 10 (coeff‘0𝑝) = (𝑚 ∈ ℕ0 ↦ 0)
20 c0ex 11130 . . . . . . . . . 10 0 ∈ V
2117, 19, 20fvmpt 6936 . . . . . . . . 9 ((𝑛 − 1) ∈ ℕ0 → ((coeff‘0𝑝)‘(𝑛 − 1)) = 0)
2216, 21syl 17 . . . . . . . 8 ((𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0) → ((coeff‘0𝑝)‘(𝑛 − 1)) = 0)
2310, 22ifeqda 4492 . . . . . . 7 (𝑛 ∈ ℕ0 → if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1))) = 0)
2423mpteq2ia 5168 . . . . . 6 (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1)))) = (𝑛 ∈ ℕ0 ↦ 0)
258, 9, 243eqtr4ri 2773 . . . . 5 (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1)))) = (coeff‘0𝑝)
267, 25eqtr4i 2765 . . . 4 (coeff‘(0𝑝f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1))))
27 fvoveq1 7380 . . . 4 (𝐹 = 0𝑝 → (coeff‘(𝐹f · Xp)) = (coeff‘(0𝑝f · Xp)))
28 simpl 483 . . . . . . . 8 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → 𝐹 = 0𝑝)
2928fveq2d 6832 . . . . . . 7 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → (coeff‘𝐹) = (coeff‘0𝑝))
3029fveq1d 6830 . . . . . 6 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → ((coeff‘𝐹)‘(𝑛 − 1)) = ((coeff‘0𝑝)‘(𝑛 − 1)))
3130ifeq2d 4476 . . . . 5 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1))) = if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1))))
3231mpteq2dva 5166 . . . 4 (𝐹 = 0𝑝 → (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1)))))
3326, 27, 323eqtr4a 2800 . . 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 4570 . . . . . 6 (𝐹 ∈ (Poly‘ℝ) → (𝐹 ∈ {0𝑝} ↔ 𝐹 = 0𝑝))
3736notbid 319 . . . . 5 (𝐹 ∈ (Poly‘ℝ) → (¬ 𝐹 ∈ {0𝑝} ↔ ¬ 𝐹 = 0𝑝))
3837biimpar 478 . . . 4 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → ¬ 𝐹 ∈ {0𝑝})
3935, 38eldifd 3894 . . 3 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → 𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}))
40 plymulx0 34740 . . 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 818 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 1547  wcel 2119  wne 2934  cdif 3880  wss 3883  ifcif 4455  {csn 4556  cmpt 5154   × cxp 5617  cfv 6486  (class class class)co 7357  f cof 7619  cc 11028  cr 11029  0cc0 11030  1c1 11031   · cmul 11035  cmin 11369  cn 12166  0cn0 12429  0𝑝c0p 25655  Polycply 26168  Xpcidp 26169  coeffccoe 26170
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 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5200  ax-sep 5219  ax-nul 5229  ax-pow 5295  ax-pr 5363  ax-un 7679  ax-inf2 9554  ax-cnex 11086  ax-resscn 11087  ax-1cn 11088  ax-icn 11089  ax-addcl 11090  ax-addrcl 11091  ax-mulcl 11092  ax-mulrcl 11093  ax-mulcom 11094  ax-addass 11095  ax-mulass 11096  ax-distr 11097  ax-i2m1 11098  ax-1ne0 11099  ax-1rid 11100  ax-rnegex 11101  ax-rrecex 11102  ax-cnre 11103  ax-pre-lttri 11104  ax-pre-lttrn 11105  ax-pre-ltadd 11106  ax-pre-mulgt0 11107  ax-pre-sup 11108
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4263  df-if 4456  df-pw 4532  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4840  df-int 4879  df-iun 4924  df-br 5074  df-opab 5136  df-mpt 5155  df-tr 5181  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-se 5573  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-isom 6495  df-riota 7314  df-ov 7360  df-oprab 7361  df-mpo 7362  df-of 7621  df-om 7808  df-1st 7932  df-2nd 7933  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-1o 8396  df-er 8634  df-map 8766  df-pm 8767  df-en 8885  df-dom 8886  df-sdom 8887  df-fin 8888  df-sup 9346  df-inf 9347  df-oi 9416  df-card 9855  df-pnf 11173  df-mnf 11174  df-xr 11175  df-ltxr 11176  df-le 11177  df-sub 11371  df-neg 11372  df-div 11800  df-nn 12167  df-2 12236  df-3 12237  df-n0 12430  df-z 12517  df-uz 12781  df-rp 12935  df-fz 13454  df-fzo 13601  df-fl 13743  df-seq 13956  df-exp 14016  df-hash 14285  df-cj 15053  df-re 15054  df-im 15055  df-sqrt 15189  df-abs 15190  df-clim 15442  df-rlim 15443  df-sum 15641  df-0p 25656  df-ply 26172  df-idp 26173  df-coe 26174  df-dgr 26175
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator