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 30625
Description: Coefficients of a polynomial multiplyed by Xp. (Contributed by Thierry Arnoux, 25-Sep-2018.)
Assertion
Ref Expression
plymulx (𝐹 ∈ (Poly‘ℝ) → (coeff‘(𝐹𝑓 · 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 9993 . . . . . . 7 ℝ ⊆ ℂ
2 1re 10039 . . . . . . 7 1 ∈ ℝ
3 plyid 23965 . . . . . . 7 ((ℝ ⊆ ℂ ∧ 1 ∈ ℝ) → Xp ∈ (Poly‘ℝ))
41, 2, 3mp2an 708 . . . . . 6 Xp ∈ (Poly‘ℝ)
5 plymul02 30623 . . . . . . 7 (Xp ∈ (Poly‘ℝ) → (0𝑝𝑓 · Xp) = 0𝑝)
65fveq2d 6195 . . . . . 6 (Xp ∈ (Poly‘ℝ) → (coeff‘(0𝑝𝑓 · Xp)) = (coeff‘0𝑝))
74, 6ax-mp 5 . . . . 5 (coeff‘(0𝑝𝑓 · Xp)) = (coeff‘0𝑝)
8 fconstmpt 5163 . . . . . 6 (ℕ0 × {0}) = (𝑛 ∈ ℕ0 ↦ 0)
9 coe0 24012 . . . . . 6 (coeff‘0𝑝) = (ℕ0 × {0})
10 eqidd 2623 . . . . . . . 8 ((𝑛 ∈ ℕ0𝑛 = 0) → 0 = 0)
11 elnnne0 11306 . . . . . . . . . . 11 (𝑛 ∈ ℕ ↔ (𝑛 ∈ ℕ0𝑛 ≠ 0))
12 df-ne 2795 . . . . . . . . . . . 12 (𝑛 ≠ 0 ↔ ¬ 𝑛 = 0)
1312anbi2i 730 . . . . . . . . . . 11 ((𝑛 ∈ ℕ0𝑛 ≠ 0) ↔ (𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0))
1411, 13bitr2i 265 . . . . . . . . . 10 ((𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0) ↔ 𝑛 ∈ ℕ)
15 nnm1nn0 11334 . . . . . . . . . 10 (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ0)
1614, 15sylbi 207 . . . . . . . . 9 ((𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0) → (𝑛 − 1) ∈ ℕ0)
17 eqidd 2623 . . . . . . . . . 10 (𝑚 = (𝑛 − 1) → 0 = 0)
18 fconstmpt 5163 . . . . . . . . . . 11 (ℕ0 × {0}) = (𝑚 ∈ ℕ0 ↦ 0)
199, 18eqtri 2644 . . . . . . . . . 10 (coeff‘0𝑝) = (𝑚 ∈ ℕ0 ↦ 0)
20 c0ex 10034 . . . . . . . . . 10 0 ∈ V
2117, 19, 20fvmpt 6282 . . . . . . . . 9 ((𝑛 − 1) ∈ ℕ0 → ((coeff‘0𝑝)‘(𝑛 − 1)) = 0)
2216, 21syl 17 . . . . . . . 8 ((𝑛 ∈ ℕ0 ∧ ¬ 𝑛 = 0) → ((coeff‘0𝑝)‘(𝑛 − 1)) = 0)
2310, 22ifeqda 4121 . . . . . . 7 (𝑛 ∈ ℕ0 → if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1))) = 0)
2423mpteq2ia 4740 . . . . . 6 (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1)))) = (𝑛 ∈ ℕ0 ↦ 0)
258, 9, 243eqtr4ri 2655 . . . . 5 (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1)))) = (coeff‘0𝑝)
267, 25eqtr4i 2647 . . . 4 (coeff‘(0𝑝𝑓 · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1))))
27 oveq1 6657 . . . . 5 (𝐹 = 0𝑝 → (𝐹𝑓 · Xp) = (0𝑝𝑓 · Xp))
2827fveq2d 6195 . . . 4 (𝐹 = 0𝑝 → (coeff‘(𝐹𝑓 · Xp)) = (coeff‘(0𝑝𝑓 · Xp)))
29 simpl 473 . . . . . . . 8 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → 𝐹 = 0𝑝)
3029fveq2d 6195 . . . . . . 7 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → (coeff‘𝐹) = (coeff‘0𝑝))
3130fveq1d 6193 . . . . . 6 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → ((coeff‘𝐹)‘(𝑛 − 1)) = ((coeff‘0𝑝)‘(𝑛 − 1)))
3231ifeq2d 4105 . . . . 5 ((𝐹 = 0𝑝𝑛 ∈ ℕ0) → if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1))) = if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1))))
3332mpteq2dva 4744 . . . 4 (𝐹 = 0𝑝 → (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘0𝑝)‘(𝑛 − 1)))))
3426, 28, 333eqtr4a 2682 . . 3 (𝐹 = 0𝑝 → (coeff‘(𝐹𝑓 · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
3534adantl 482 . 2 ((𝐹 ∈ (Poly‘ℝ) ∧ 𝐹 = 0𝑝) → (coeff‘(𝐹𝑓 · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
36 simpl 473 . . . 4 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → 𝐹 ∈ (Poly‘ℝ))
37 elsng 4191 . . . . . 6 (𝐹 ∈ (Poly‘ℝ) → (𝐹 ∈ {0𝑝} ↔ 𝐹 = 0𝑝))
3837notbid 308 . . . . 5 (𝐹 ∈ (Poly‘ℝ) → (¬ 𝐹 ∈ {0𝑝} ↔ ¬ 𝐹 = 0𝑝))
3938biimpar 502 . . . 4 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → ¬ 𝐹 ∈ {0𝑝})
4036, 39eldifd 3585 . . 3 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → 𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}))
41 plymulx0 30624 . . 3 (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (coeff‘(𝐹𝑓 · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
4240, 41syl 17 . 2 ((𝐹 ∈ (Poly‘ℝ) ∧ ¬ 𝐹 = 0𝑝) → (coeff‘(𝐹𝑓 · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
4335, 42pm2.61dan 832 1 (𝐹 ∈ (Poly‘ℝ) → (coeff‘(𝐹𝑓 · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384   = wceq 1483  wcel 1990  wne 2794  cdif 3571  wss 3574  ifcif 4086  {csn 4177  cmpt 4729   × cxp 5112  cfv 5888  (class class class)co 6650  𝑓 cof 6895  cc 9934  cr 9935  0cc0 9936  1c1 9937   · cmul 9941  cmin 10266  cn 11020  0cn0 11292  0𝑝c0p 23436  Polycply 23940  Xpcidp 23941  coeffccoe 23942
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-inf2 8538  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013  ax-pre-sup 10014  ax-addf 10015
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-isom 5897  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-of 6897  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-map 7859  df-pm 7860  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-sup 8348  df-inf 8349  df-oi 8415  df-card 8765  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-div 10685  df-nn 11021  df-2 11079  df-3 11080  df-n0 11293  df-z 11378  df-uz 11688  df-rp 11833  df-fz 12327  df-fzo 12466  df-fl 12593  df-seq 12802  df-exp 12861  df-hash 13118  df-cj 13839  df-re 13840  df-im 13841  df-sqrt 13975  df-abs 13976  df-clim 14219  df-rlim 14220  df-sum 14417  df-0p 23437  df-ply 23944  df-idp 23945  df-coe 23946  df-dgr 23947
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator