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

Theorem bpolycl 14622
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 6556 . . . . 5 (𝑛 = 𝑘 → (𝑛 BernPoly 𝑋) = (𝑘 BernPoly 𝑋))
21eleq1d 2672 . . . 4 (𝑛 = 𝑘 → ((𝑛 BernPoly 𝑋) ∈ ℂ ↔ (𝑘 BernPoly 𝑋) ∈ ℂ))
32imbi2d 329 . . 3 (𝑛 = 𝑘 → ((𝑋 ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ) ↔ (𝑋 ∈ ℂ → (𝑘 BernPoly 𝑋) ∈ ℂ)))
4 oveq1 6556 . . . . 5 (𝑛 = 𝑁 → (𝑛 BernPoly 𝑋) = (𝑁 BernPoly 𝑋))
54eleq1d 2672 . . . 4 (𝑛 = 𝑁 → ((𝑛 BernPoly 𝑋) ∈ ℂ ↔ (𝑁 BernPoly 𝑋) ∈ ℂ))
65imbi2d 329 . . 3 (𝑛 = 𝑁 → ((𝑋 ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ) ↔ (𝑋 ∈ ℂ → (𝑁 BernPoly 𝑋) ∈ ℂ)))
7 r19.21v 2943 . . . 4 (∀𝑘 ∈ (0...(𝑛 − 1))(𝑋 ∈ ℂ → (𝑘 BernPoly 𝑋) ∈ ℂ) ↔ (𝑋 ∈ ℂ → ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ))
8 bpolyval 14619 . . . . . . . 8 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ) → (𝑛 BernPoly 𝑋) = ((𝑋𝑛) − Σ𝑚 ∈ (0...(𝑛 − 1))((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1)))))
983adant3 1074 . . . . . . 7 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑛 BernPoly 𝑋) = ((𝑋𝑛) − Σ𝑚 ∈ (0...(𝑛 − 1))((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1)))))
10 simp2 1055 . . . . . . . . 9 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → 𝑋 ∈ ℂ)
11 simp1 1054 . . . . . . . . 9 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → 𝑛 ∈ ℕ0)
1210, 11expcld 12870 . . . . . . . 8 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑋𝑛) ∈ ℂ)
13 fzfid 12634 . . . . . . . . 9 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (0...(𝑛 − 1)) ∈ Fin)
14 elfzelz 12213 . . . . . . . . . . . 12 (𝑚 ∈ (0...(𝑛 − 1)) → 𝑚 ∈ ℤ)
15 bccl 12971 . . . . . . . . . . . 12 ((𝑛 ∈ ℕ0𝑚 ∈ ℤ) → (𝑛C𝑚) ∈ ℕ0)
1611, 14, 15syl2an 493 . . . . . . . . . . 11 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → (𝑛C𝑚) ∈ ℕ0)
1716nn0cnd 11230 . . . . . . . . . 10 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → (𝑛C𝑚) ∈ ℂ)
18 oveq1 6556 . . . . . . . . . . . . . 14 (𝑘 = 𝑚 → (𝑘 BernPoly 𝑋) = (𝑚 BernPoly 𝑋))
1918eleq1d 2672 . . . . . . . . . . . . 13 (𝑘 = 𝑚 → ((𝑘 BernPoly 𝑋) ∈ ℂ ↔ (𝑚 BernPoly 𝑋) ∈ ℂ))
2019rspccva 3281 . . . . . . . . . . . 12 ((∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ ∧ 𝑚 ∈ (0...(𝑛 − 1))) → (𝑚 BernPoly 𝑋) ∈ ℂ)
21203ad2antl3 1218 . . . . . . . . . . 11 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → (𝑚 BernPoly 𝑋) ∈ ℂ)
22 fzssp1 12255 . . . . . . . . . . . . . . 15 (0...(𝑛 − 1)) ⊆ (0...((𝑛 − 1) + 1))
2311nn0cnd 11230 . . . . . . . . . . . . . . . . 17 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → 𝑛 ∈ ℂ)
24 ax-1cn 9873 . . . . . . . . . . . . . . . . 17 1 ∈ ℂ
25 npcan 10169 . . . . . . . . . . . . . . . . 17 ((𝑛 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑛 − 1) + 1) = 𝑛)
2623, 24, 25sylancl 693 . . . . . . . . . . . . . . . 16 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → ((𝑛 − 1) + 1) = 𝑛)
2726oveq2d 6565 . . . . . . . . . . . . . . 15 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (0...((𝑛 − 1) + 1)) = (0...𝑛))
2822, 27syl5sseq 3616 . . . . . . . . . . . . . 14 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (0...(𝑛 − 1)) ⊆ (0...𝑛))
2928sselda 3568 . . . . . . . . . . . . 13 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → 𝑚 ∈ (0...𝑛))
30 fznn0sub 12244 . . . . . . . . . . . . 13 (𝑚 ∈ (0...𝑛) → (𝑛𝑚) ∈ ℕ0)
31 nn0p1nn 11209 . . . . . . . . . . . . 13 ((𝑛𝑚) ∈ ℕ0 → ((𝑛𝑚) + 1) ∈ ℕ)
3229, 30, 313syl 18 . . . . . . . . . . . 12 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑛𝑚) + 1) ∈ ℕ)
3332nncnd 10913 . . . . . . . . . . 11 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑛𝑚) + 1) ∈ ℂ)
3432nnne0d 10942 . . . . . . . . . . 11 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑛𝑚) + 1) ≠ 0)
3521, 33, 34divcld 10680 . . . . . . . . . 10 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1)) ∈ ℂ)
3617, 35mulcld 9939 . . . . . . . . 9 (((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) ∧ 𝑚 ∈ (0...(𝑛 − 1))) → ((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1))) ∈ ℂ)
3713, 36fsumcl 14311 . . . . . . . 8 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → Σ𝑚 ∈ (0...(𝑛 − 1))((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1))) ∈ ℂ)
3812, 37subcld 10271 . . . . . . 7 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → ((𝑋𝑛) − Σ𝑚 ∈ (0...(𝑛 − 1))((𝑛C𝑚) · ((𝑚 BernPoly 𝑋) / ((𝑛𝑚) + 1)))) ∈ ℂ)
399, 38eqeltrd 2688 . . . . . 6 ((𝑛 ∈ ℕ0𝑋 ∈ ℂ ∧ ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑛 BernPoly 𝑋) ∈ ℂ)
40393exp 1256 . . . . 5 (𝑛 ∈ ℕ0 → (𝑋 ∈ ℂ → (∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ)))
4140a2d 29 . . . 4 (𝑛 ∈ ℕ0 → ((𝑋 ∈ ℂ → ∀𝑘 ∈ (0...(𝑛 − 1))(𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑋 ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ)))
427, 41syl5bi 231 . . 3 (𝑛 ∈ ℕ0 → (∀𝑘 ∈ (0...(𝑛 − 1))(𝑋 ∈ ℂ → (𝑘 BernPoly 𝑋) ∈ ℂ) → (𝑋 ∈ ℂ → (𝑛 BernPoly 𝑋) ∈ ℂ)))
433, 6, 42nn0sinds 12650 . 2 (𝑁 ∈ ℕ0 → (𝑋 ∈ ℂ → (𝑁 BernPoly 𝑋) ∈ ℂ))
4443imp 444 1 ((𝑁 ∈ ℕ0𝑋 ∈ ℂ) → (𝑁 BernPoly 𝑋) ∈ ℂ)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1031   = wceq 1475  wcel 1977  wral 2896  (class class class)co 6549  cc 9813  0cc0 9815  1c1 9816   + caddc 9818   · cmul 9820  cmin 10145   / cdiv 10563  cn 10897  0cn0 11169  cz 11254  ...cfz 12197  cexp 12722  Ccbc 12951  Σcsu 14264   BernPoly cbp 14616
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-oi 8298  df-card 8648  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-z 11255  df-uz 11564  df-rp 11709  df-fz 12198  df-fzo 12335  df-seq 12664  df-exp 12723  df-fac 12923  df-bc 12952  df-hash 12980  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-clim 14067  df-sum 14265  df-bpoly 14617
This theorem is referenced by:  bpolysum  14623  bpolydiflem  14624  fsumkthpow  14626  bpoly3  14628  bpoly4  14629
  Copyright terms: Public domain W3C validator