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

Theorem bpolycl 14827
Description: Closure law for Bernoulli polynomials. (Contributed by Scott Fenton, 16-May-2014.) (Proof shortened by Mario Carneiro, 22-May-2014.)
Assertion
Ref Expression
bpolycl ((𝑁 ∈ ℕ0𝑋 ∈ ℂ) → (𝑁 BernPoly 𝑋) ∈ ℂ)

Proof of Theorem bpolycl
Dummy variables 𝑛 𝑘 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 6697 . . . . 5 (𝑛 = 𝑘 → (𝑛 BernPoly 𝑋) = (𝑘 BernPoly 𝑋))
21eleq1d 2715 . . . 4 (𝑛 = 𝑘 → ((𝑛 BernPoly 𝑋) ∈ ℂ ↔ (𝑘 BernPoly 𝑋) ∈ ℂ))
32imbi2d 329 . . 3 (𝑛 = 𝑘 → ((𝑋 ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ) ↔ (𝑋 ∈ ℂ → (𝑘 BernPoly 𝑋) ∈ ℂ)))
4 oveq1 6697 . . . . 5 (𝑛 = 𝑁 → (𝑛 BernPoly 𝑋) = (𝑁 BernPoly 𝑋))
54eleq1d 2715 . . . 4 (𝑛 = 𝑁 → ((𝑛 BernPoly 𝑋) ∈ ℂ ↔ (𝑁 BernPoly 𝑋) ∈ ℂ))
65imbi2d 329 . . 3 (𝑛 = 𝑁 → ((𝑋 ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ) ↔ (𝑋 ∈ ℂ → (𝑁 BernPoly 𝑋) ∈ ℂ)))
7 r19.21v 2989 . . . 4 (∀𝑘 ∈ (0...(𝑛 − 1))(𝑋 ∈ ℂ → (𝑘 BernPoly 𝑋) ∈ ℂ) ↔ (𝑋 ∈ ℂ → ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ))
8 bpolyval 14824 . . . . . . . 8 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ) → (𝑛 BernPoly 𝑋) = ((𝑋𝑛) − Σ𝑚 ∈ (0...(𝑛 − 1))((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1)))))
983adant3 1101 . . . . . . 7 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑛 BernPoly 𝑋) = ((𝑋𝑛) − Σ𝑚 ∈ (0...(𝑛 − 1))((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1)))))
10 simp2 1082 . . . . . . . . 9 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → 𝑋 ∈ ℂ)
11 simp1 1081 . . . . . . . . 9 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → 𝑛 ∈ ℕ0)
1210, 11expcld 13048 . . . . . . . 8 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑋𝑛) ∈ ℂ)
13 fzfid 12812 . . . . . . . . 9 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (0...(𝑛 − 1)) ∈ Fin)
14 elfzelz 12380 . . . . . . . . . . . 12 (𝑚 ∈ (0...(𝑛 − 1)) → 𝑚 ∈ ℤ)
15 bccl 13149 . . . . . . . . . . . 12 ((𝑛 ∈ ℕ0𝑚 ∈ ℤ) → (𝑛C𝑚) ∈ ℕ0)
1611, 14, 15syl2an 493 . . . . . . . . . . 11 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → (𝑛C𝑚) ∈ ℕ0)
1716nn0cnd 11391 . . . . . . . . . 10 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → (𝑛C𝑚) ∈ ℂ)
18 oveq1 6697 . . . . . . . . . . . . . 14 (𝑘 = 𝑚 → (𝑘 BernPoly 𝑋) = (𝑚 BernPoly 𝑋))
1918eleq1d 2715 . . . . . . . . . . . . 13 (𝑘 = 𝑚 → ((𝑘 BernPoly 𝑋) ∈ ℂ ↔ (𝑚 BernPoly 𝑋) ∈ ℂ))
2019rspccva 3339 . . . . . . . . . . . 12 ((∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ ∧ 𝑚 ∈ (0...(𝑛 − 1))) → (𝑚 BernPoly 𝑋) ∈ ℂ)
21203ad2antl3 1245 . . . . . . . . . . 11 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → (𝑚 BernPoly 𝑋) ∈ ℂ)
22 fzssp1 12422 . . . . . . . . . . . . . . 15 (0...(𝑛 − 1)) ⊆ (0...((𝑛 − 1) + 1))
2311nn0cnd 11391 . . . . . . . . . . . . . . . . 17 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → 𝑛 ∈ ℂ)
24 ax-1cn 10032 . . . . . . . . . . . . . . . . 17 1 ∈ ℂ
25 npcan 10328 . . . . . . . . . . . . . . . . 17 ((𝑛 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑛 − 1) + 1) = 𝑛)
2623, 24, 25sylancl 695 . . . . . . . . . . . . . . . 16 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → ((𝑛 − 1) + 1) = 𝑛)
2726oveq2d 6706 . . . . . . . . . . . . . . 15 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (0...((𝑛 − 1) + 1)) = (0...𝑛))
2822, 27syl5sseq 3686 . . . . . . . . . . . . . 14 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (0...(𝑛 − 1)) ⊆ (0...𝑛))
2928sselda 3636 . . . . . . . . . . . . 13 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → 𝑚 ∈ (0...𝑛))
30 fznn0sub 12411 . . . . . . . . . . . . 13 (𝑚 ∈ (0...𝑛) → (𝑛𝑚) ∈ ℕ0)
31 nn0p1nn 11370 . . . . . . . . . . . . 13 ((𝑛𝑚) ∈ ℕ0 → ((𝑛𝑚) + 1) ∈ ℕ)
3229, 30, 313syl 18 . . . . . . . . . . . 12 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑛𝑚) + 1) ∈ ℕ)
3332nncnd 11074 . . . . . . . . . . 11 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑛𝑚) + 1) ∈ ℂ)
3432nnne0d 11103 . . . . . . . . . . 11 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑛𝑚) + 1) ≠ 0)
3521, 33, 34divcld 10839 . . . . . . . . . 10 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1)) ∈ ℂ)
3617, 35mulcld 10098 . . . . . . . . 9 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1))) ∈ ℂ)
3713, 36fsumcl 14508 . . . . . . . 8 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → Σ𝑚 ∈ (0...(𝑛 − 1))((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1))) ∈ ℂ)
3812, 37subcld 10430 . . . . . . 7 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → ((𝑋𝑛) − Σ𝑚 ∈ (0...(𝑛 − 1))((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1)))) ∈ ℂ)
399, 38eqeltrd 2730 . . . . . 6 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑛 BernPoly 𝑋) ∈ ℂ)
40393exp 1283 . . . . 5 (𝑛 ∈ ℕ0 → (𝑋 ∈ ℂ → (∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ)))
4140a2d 29 . . . 4 (𝑛 ∈ ℕ0 → ((𝑋 ∈ ℂ → ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑋 ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ)))
427, 41syl5bi 232 . . 3 (𝑛 ∈ ℕ0 → (∀𝑘 ∈ (0...(𝑛 − 1))(𝑋 ∈ ℂ → (𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑋 ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ)))
433, 6, 42nn0sinds 12828 . 2 (𝑁 ∈ ℕ0 → (𝑋 ∈ ℂ → (𝑁 BernPoly 𝑋) ∈ ℂ))
4443imp 444 1 ((𝑁 ∈ ℕ0𝑋 ∈ ℂ) → (𝑁 BernPoly 𝑋) ∈ ℂ)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1054   = wceq 1523  wcel 2030  wral 2941  (class class class)co 6690  cc 9972  0cc0 9974  1c1 9975   + caddc 9977   · cmul 9979  cmin 10304   / cdiv 10722  cn 11058  0cn0 11330  cz 11415  ...cfz 12364  cexp 12900  Ccbc 13129  Σcsu 14460   BernPoly cbp 14821
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-inf2 8576  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051  ax-pre-sup 10052
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-fal 1529  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-se 5103  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-isom 5935  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-oadd 7609  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-sup 8389  df-oi 8456  df-card 8803  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-div 10723  df-nn 11059  df-2 11117  df-3 11118  df-n0 11331  df-z 11416  df-uz 11726  df-rp 11871  df-fz 12365  df-fzo 12505  df-seq 12842  df-exp 12901  df-fac 13101  df-bc 13130  df-hash 13158  df-cj 13883  df-re 13884  df-im 13885  df-sqrt 14019  df-abs 14020  df-clim 14263  df-sum 14461  df-bpoly 14822
This theorem is referenced by:  bpolysum  14828  bpolydiflem  14829  fsumkthpow  14831  bpoly3  14833  bpoly4  14834
  Copyright terms: Public domain W3C validator