Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dirkerval2 | Structured version Visualization version GIF version |
Description: The Nth Dirichlet Kernel evaluated at a specific point 𝑆. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
Ref | Expression |
---|---|
dirkerval2.1 | ⊢ 𝐷 = (𝑛 ∈ ℕ ↦ (𝑠 ∈ ℝ ↦ if((𝑠 mod (2 · π)) = 0, (((2 · 𝑛) + 1) / (2 · π)), ((sin‘((𝑛 + (1 / 2)) · 𝑠)) / ((2 · π) · (sin‘(𝑠 / 2))))))) |
Ref | Expression |
---|---|
dirkerval2 | ⊢ ((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) → ((𝐷‘𝑁)‘𝑆) = if((𝑆 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑆)) / ((2 · π) · (sin‘(𝑆 / 2)))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dirkerval2.1 | . . . . 5 ⊢ 𝐷 = (𝑛 ∈ ℕ ↦ (𝑠 ∈ ℝ ↦ if((𝑠 mod (2 · π)) = 0, (((2 · 𝑛) + 1) / (2 · π)), ((sin‘((𝑛 + (1 / 2)) · 𝑠)) / ((2 · π) · (sin‘(𝑠 / 2))))))) | |
2 | 1 | dirkerval 38984 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝐷‘𝑁) = (𝑠 ∈ ℝ ↦ if((𝑠 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑠)) / ((2 · π) · (sin‘(𝑠 / 2))))))) |
3 | oveq1 6556 | . . . . . . 7 ⊢ (𝑠 = 𝑡 → (𝑠 mod (2 · π)) = (𝑡 mod (2 · π))) | |
4 | 3 | eqeq1d 2612 | . . . . . 6 ⊢ (𝑠 = 𝑡 → ((𝑠 mod (2 · π)) = 0 ↔ (𝑡 mod (2 · π)) = 0)) |
5 | oveq2 6557 | . . . . . . . 8 ⊢ (𝑠 = 𝑡 → ((𝑁 + (1 / 2)) · 𝑠) = ((𝑁 + (1 / 2)) · 𝑡)) | |
6 | 5 | fveq2d 6107 | . . . . . . 7 ⊢ (𝑠 = 𝑡 → (sin‘((𝑁 + (1 / 2)) · 𝑠)) = (sin‘((𝑁 + (1 / 2)) · 𝑡))) |
7 | oveq1 6556 | . . . . . . . . 9 ⊢ (𝑠 = 𝑡 → (𝑠 / 2) = (𝑡 / 2)) | |
8 | 7 | fveq2d 6107 | . . . . . . . 8 ⊢ (𝑠 = 𝑡 → (sin‘(𝑠 / 2)) = (sin‘(𝑡 / 2))) |
9 | 8 | oveq2d 6565 | . . . . . . 7 ⊢ (𝑠 = 𝑡 → ((2 · π) · (sin‘(𝑠 / 2))) = ((2 · π) · (sin‘(𝑡 / 2)))) |
10 | 6, 9 | oveq12d 6567 | . . . . . 6 ⊢ (𝑠 = 𝑡 → ((sin‘((𝑁 + (1 / 2)) · 𝑠)) / ((2 · π) · (sin‘(𝑠 / 2)))) = ((sin‘((𝑁 + (1 / 2)) · 𝑡)) / ((2 · π) · (sin‘(𝑡 / 2))))) |
11 | 4, 10 | ifbieq2d 4061 | . . . . 5 ⊢ (𝑠 = 𝑡 → if((𝑠 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑠)) / ((2 · π) · (sin‘(𝑠 / 2))))) = if((𝑡 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑡)) / ((2 · π) · (sin‘(𝑡 / 2)))))) |
12 | 11 | cbvmptv 4678 | . . . 4 ⊢ (𝑠 ∈ ℝ ↦ if((𝑠 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑠)) / ((2 · π) · (sin‘(𝑠 / 2)))))) = (𝑡 ∈ ℝ ↦ if((𝑡 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑡)) / ((2 · π) · (sin‘(𝑡 / 2)))))) |
13 | 2, 12 | syl6eq 2660 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝐷‘𝑁) = (𝑡 ∈ ℝ ↦ if((𝑡 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑡)) / ((2 · π) · (sin‘(𝑡 / 2))))))) |
14 | 13 | adantr 480 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) → (𝐷‘𝑁) = (𝑡 ∈ ℝ ↦ if((𝑡 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑡)) / ((2 · π) · (sin‘(𝑡 / 2))))))) |
15 | simpr 476 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → 𝑡 = 𝑆) | |
16 | 15 | oveq1d 6564 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → (𝑡 mod (2 · π)) = (𝑆 mod (2 · π))) |
17 | 16 | eqeq1d 2612 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → ((𝑡 mod (2 · π)) = 0 ↔ (𝑆 mod (2 · π)) = 0)) |
18 | 15 | oveq2d 6565 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → ((𝑁 + (1 / 2)) · 𝑡) = ((𝑁 + (1 / 2)) · 𝑆)) |
19 | 18 | fveq2d 6107 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → (sin‘((𝑁 + (1 / 2)) · 𝑡)) = (sin‘((𝑁 + (1 / 2)) · 𝑆))) |
20 | 15 | oveq1d 6564 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → (𝑡 / 2) = (𝑆 / 2)) |
21 | 20 | fveq2d 6107 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → (sin‘(𝑡 / 2)) = (sin‘(𝑆 / 2))) |
22 | 21 | oveq2d 6565 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → ((2 · π) · (sin‘(𝑡 / 2))) = ((2 · π) · (sin‘(𝑆 / 2)))) |
23 | 19, 22 | oveq12d 6567 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → ((sin‘((𝑁 + (1 / 2)) · 𝑡)) / ((2 · π) · (sin‘(𝑡 / 2)))) = ((sin‘((𝑁 + (1 / 2)) · 𝑆)) / ((2 · π) · (sin‘(𝑆 / 2))))) |
24 | 17, 23 | ifbieq2d 4061 | . 2 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ 𝑡 = 𝑆) → if((𝑡 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑡)) / ((2 · π) · (sin‘(𝑡 / 2))))) = if((𝑆 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑆)) / ((2 · π) · (sin‘(𝑆 / 2)))))) |
25 | simpr 476 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) → 𝑆 ∈ ℝ) | |
26 | 2re 10967 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
27 | 26 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 2 ∈ ℝ) |
28 | nnre 10904 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
29 | 27, 28 | remulcld 9949 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (2 · 𝑁) ∈ ℝ) |
30 | 1red 9934 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℝ) | |
31 | 29, 30 | readdcld 9948 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((2 · 𝑁) + 1) ∈ ℝ) |
32 | pire 24014 | . . . . . . 7 ⊢ π ∈ ℝ | |
33 | 32 | a1i 11 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → π ∈ ℝ) |
34 | 27, 33 | remulcld 9949 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (2 · π) ∈ ℝ) |
35 | 2cnd 10970 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 2 ∈ ℂ) | |
36 | 33 | recnd 9947 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → π ∈ ℂ) |
37 | 2pos 10989 | . . . . . . . 8 ⊢ 0 < 2 | |
38 | 37 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 0 < 2) |
39 | 38 | gt0ne0d 10471 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 2 ≠ 0) |
40 | pipos 24016 | . . . . . . . 8 ⊢ 0 < π | |
41 | 40 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 0 < π) |
42 | 41 | gt0ne0d 10471 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → π ≠ 0) |
43 | 35, 36, 39, 42 | mulne0d 10558 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (2 · π) ≠ 0) |
44 | 31, 34, 43 | redivcld 10732 | . . . 4 ⊢ (𝑁 ∈ ℕ → (((2 · 𝑁) + 1) / (2 · π)) ∈ ℝ) |
45 | 44 | ad2antrr 758 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ (𝑆 mod (2 · π)) = 0) → (((2 · 𝑁) + 1) / (2 · π)) ∈ ℝ) |
46 | dirker2re 38985 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) ∧ ¬ (𝑆 mod (2 · π)) = 0) → ((sin‘((𝑁 + (1 / 2)) · 𝑆)) / ((2 · π) · (sin‘(𝑆 / 2)))) ∈ ℝ) | |
47 | 45, 46 | ifclda 4070 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) → if((𝑆 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑆)) / ((2 · π) · (sin‘(𝑆 / 2))))) ∈ ℝ) |
48 | 14, 24, 25, 47 | fvmptd 6197 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝑆 ∈ ℝ) → ((𝐷‘𝑁)‘𝑆) = if((𝑆 mod (2 · π)) = 0, (((2 · 𝑁) + 1) / (2 · π)), ((sin‘((𝑁 + (1 / 2)) · 𝑆)) / ((2 · π) · (sin‘(𝑆 / 2)))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ifcif 4036 class class class wbr 4583 ↦ cmpt 4643 ‘cfv 5804 (class class class)co 6549 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 · cmul 9820 < clt 9953 / cdiv 10563 ℕcn 10897 2c2 10947 mod cmo 12530 sincsin 14633 πcpi 14636 |
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 ax-addf 9894 ax-mulf 9895 |
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-iin 4458 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-of 6795 df-om 6958 df-1st 7059 df-2nd 7060 df-supp 7183 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-er 7629 df-map 7746 df-pm 7747 df-ixp 7795 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-fsupp 8159 df-fi 8200 df-sup 8231 df-inf 8232 df-oi 8298 df-card 8648 df-cda 8873 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-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-uz 11564 df-q 11665 df-rp 11709 df-xneg 11822 df-xadd 11823 df-xmul 11824 df-ioo 12050 df-ioc 12051 df-ico 12052 df-icc 12053 df-fz 12198 df-fzo 12335 df-fl 12455 df-mod 12531 df-seq 12664 df-exp 12723 df-fac 12923 df-bc 12952 df-hash 12980 df-shft 13655 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-limsup 14050 df-clim 14067 df-rlim 14068 df-sum 14265 df-ef 14637 df-sin 14639 df-cos 14640 df-pi 14642 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-ress 15702 df-plusg 15781 df-mulr 15782 df-starv 15783 df-sca 15784 df-vsca 15785 df-ip 15786 df-tset 15787 df-ple 15788 df-ds 15791 df-unif 15792 df-hom 15793 df-cco 15794 df-rest 15906 df-topn 15907 df-0g 15925 df-gsum 15926 df-topgen 15927 df-pt 15928 df-prds 15931 df-xrs 15985 df-qtop 15990 df-imas 15991 df-xps 15993 df-mre 16069 df-mrc 16070 df-acs 16072 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-submnd 17159 df-mulg 17364 df-cntz 17573 df-cmn 18018 df-psmet 19559 df-xmet 19560 df-met 19561 df-bl 19562 df-mopn 19563 df-fbas 19564 df-fg 19565 df-cnfld 19568 df-top 20521 df-bases 20522 df-topon 20523 df-topsp 20524 df-cld 20633 df-ntr 20634 df-cls 20635 df-nei 20712 df-lp 20750 df-perf 20751 df-cn 20841 df-cnp 20842 df-haus 20929 df-tx 21175 df-hmeo 21368 df-fil 21460 df-fm 21552 df-flim 21553 df-flf 21554 df-xms 21935 df-ms 21936 df-tms 21937 df-cncf 22489 df-limc 23436 df-dv 23437 |
This theorem is referenced by: dirkerre 38988 dirkerper 38989 dirkerf 38990 dirkercncflem2 38997 fourierdlem66 39065 |
Copyright terms: Public domain | W3C validator |