| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fourierdlem38 | Structured version Visualization version GIF version | ||
| Description: The function 𝐹 is continuous on every interval induced by the partition 𝑄. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| fourierdlem38.cn | ⊢ (𝜑 → 𝐹 ∈ (dom 𝐹–cn→ℂ)) |
| fourierdlem38.p | ⊢ 𝑃 = (𝑛 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑m (0...𝑛)) ∣ (((𝑝‘0) = -π ∧ (𝑝‘𝑛) = π) ∧ ∀𝑖 ∈ (0..^𝑛)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))}) |
| fourierdlem38.m | ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| fourierdlem38.q | ⊢ (𝜑 → 𝑄 ∈ (𝑃‘𝑀)) |
| fourierdlem38.h | ⊢ 𝐻 = (𝐴 ∪ ((-π[,]π) ∖ dom 𝐹)) |
| fourierdlem38.ranq | ⊢ (𝜑 → ran 𝑄 = 𝐻) |
| Ref | Expression |
|---|---|
| fourierdlem38 | ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∈ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))–cn→ℂ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simplr 774 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) | |
| 2 | simplll 780 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝜑) | |
| 3 | ioossicc 13377 | . . . . . . . . 9 ⊢ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1))) | |
| 4 | pire 26439 | . . . . . . . . . . . . 13 ⊢ π ∈ ℝ | |
| 5 | 4 | renegcli 11446 | . . . . . . . . . . . 12 ⊢ -π ∈ ℝ |
| 6 | 5 | rexri 11194 | . . . . . . . . . . 11 ⊢ -π ∈ ℝ* |
| 7 | 6 | a1i 11 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → -π ∈ ℝ*) |
| 8 | 4 | rexri 11194 | . . . . . . . . . . 11 ⊢ π ∈ ℝ* |
| 9 | 8 | a1i 11 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → π ∈ ℝ*) |
| 10 | fourierdlem38.p | . . . . . . . . . . . 12 ⊢ 𝑃 = (𝑛 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑m (0...𝑛)) ∣ (((𝑝‘0) = -π ∧ (𝑝‘𝑛) = π) ∧ ∀𝑖 ∈ (0..^𝑛)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))}) | |
| 11 | fourierdlem38.m | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
| 12 | fourierdlem38.q | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝑄 ∈ (𝑃‘𝑀)) | |
| 13 | 10, 11, 12 | fourierdlem15 46565 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑄:(0...𝑀)⟶(-π[,]π)) |
| 14 | 13 | adantr 481 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑄:(0...𝑀)⟶(-π[,]π)) |
| 15 | simpr 485 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0..^𝑀)) | |
| 16 | 7, 9, 14, 15 | fourierdlem8 46558 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1))) ⊆ (-π[,]π)) |
| 17 | 3, 16 | sstrid 3926 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ (-π[,]π)) |
| 18 | 17 | sselda 3915 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝑥 ∈ (-π[,]π)) |
| 19 | 18 | adantr 481 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ (-π[,]π)) |
| 20 | simpr 485 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → ¬ 𝑥 ∈ dom 𝐹) | |
| 21 | simpllr 781 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑖 ∈ (0..^𝑀)) | |
| 22 | 11 | 3ad2ant1 1139 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (-π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑀 ∈ ℕ) |
| 23 | 12 | 3ad2ant1 1139 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (-π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑄 ∈ (𝑃‘𝑀)) |
| 24 | simp2 1143 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (-π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ (-π[,]π)) | |
| 25 | simp3 1144 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (-π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → ¬ 𝑥 ∈ dom 𝐹) | |
| 26 | 24, 25 | eldifd 3894 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (-π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ ((-π[,]π) ∖ dom 𝐹)) |
| 27 | elun2 4112 | . . . . . . . . 9 ⊢ (𝑥 ∈ ((-π[,]π) ∖ dom 𝐹) → 𝑥 ∈ (𝐴 ∪ ((-π[,]π) ∖ dom 𝐹))) | |
| 28 | 26, 27 | syl 17 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (-π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ (𝐴 ∪ ((-π[,]π) ∖ dom 𝐹))) |
| 29 | fourierdlem38.ranq | . . . . . . . . . 10 ⊢ (𝜑 → ran 𝑄 = 𝐻) | |
| 30 | fourierdlem38.h | . . . . . . . . . 10 ⊢ 𝐻 = (𝐴 ∪ ((-π[,]π) ∖ dom 𝐹)) | |
| 31 | 29, 30 | eqtr2di 2791 | . . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∪ ((-π[,]π) ∖ dom 𝐹)) = ran 𝑄) |
| 32 | 31 | 3ad2ant1 1139 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (-π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → (𝐴 ∪ ((-π[,]π) ∖ dom 𝐹)) = ran 𝑄) |
| 33 | 28, 32 | eleqtrd 2841 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (-π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ ran 𝑄) |
| 34 | 10, 22, 23, 33 | fourierdlem12 46562 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (-π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) ∧ 𝑖 ∈ (0..^𝑀)) → ¬ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) |
| 35 | 2, 19, 20, 21, 34 | syl31anc 1381 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → ¬ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) |
| 36 | 1, 35 | condan 823 | . . . 4 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝑥 ∈ dom 𝐹) |
| 37 | 36 | ralrimiva 3131 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ∀𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))𝑥 ∈ dom 𝐹) |
| 38 | dfss3 3904 | . . 3 ⊢ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ dom 𝐹 ↔ ∀𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))𝑥 ∈ dom 𝐹) | |
| 39 | 37, 38 | sylibr 235 | . 2 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ dom 𝐹) |
| 40 | fourierdlem38.cn | . . 3 ⊢ (𝜑 → 𝐹 ∈ (dom 𝐹–cn→ℂ)) | |
| 41 | 40 | adantr 481 | . 2 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐹 ∈ (dom 𝐹–cn→ℂ)) |
| 42 | rescncf 24882 | . 2 ⊢ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ dom 𝐹 → (𝐹 ∈ (dom 𝐹–cn→ℂ) → (𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∈ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))–cn→ℂ))) | |
| 43 | 39, 41, 42 | sylc 65 | 1 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∈ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))–cn→ℂ)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ∀wral 3053 {crab 3391 ∖ cdif 3880 ∪ cun 3881 ⊆ wss 3883 class class class wbr 5072 ↦ cmpt 5153 dom cdm 5618 ran crn 5619 ↾ cres 5620 ⟶wf 6481 ‘cfv 6485 (class class class)co 7356 ↑m cmap 8763 ℂcc 11027 ℝcr 11028 0cc0 11029 1c1 11030 + caddc 11032 ℝ*cxr 11169 < clt 11170 -cneg 11369 ℕcn 12165 (,)cioo 13289 [,]cicc 13292 ...cfz 13452 ..^cfzo 13599 πcpi 16022 –cn→ccncf 24861 |
| 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 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-inf2 9553 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 ax-addf 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 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-iin 4924 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-isom 6494 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8101 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8633 df-map 8765 df-pm 8766 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9265 df-fi 9314 df-sup 9345 df-inf 9346 df-oi 9415 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-dec 12636 df-uz 12780 df-q 12890 df-rp 12934 df-xneg 13054 df-xadd 13055 df-xmul 13056 df-ioo 13293 df-ioc 13294 df-ico 13295 df-icc 13296 df-fz 13453 df-fzo 13600 df-fl 13742 df-seq 13955 df-exp 14015 df-fac 14227 df-bc 14256 df-hash 14284 df-shft 15020 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-limsup 15424 df-clim 15441 df-rlim 15442 df-sum 15640 df-ef 16023 df-sin 16025 df-cos 16026 df-pi 16028 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-mulr 17225 df-starv 17226 df-sca 17227 df-vsca 17228 df-ip 17229 df-tset 17230 df-ple 17231 df-ds 17233 df-unif 17234 df-hom 17235 df-cco 17236 df-rest 17376 df-topn 17377 df-0g 17395 df-gsum 17396 df-topgen 17397 df-pt 17398 df-prds 17401 df-xrs 17457 df-qtop 17462 df-imas 17463 df-xps 17465 df-mre 17539 df-mrc 17540 df-acs 17542 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18743 df-mulg 19035 df-cntz 19283 df-cmn 19748 df-psmet 21339 df-xmet 21340 df-met 21341 df-bl 21342 df-mopn 21343 df-fbas 21344 df-fg 21345 df-cnfld 21348 df-top 22877 df-topon 22894 df-topsp 22916 df-bases 22929 df-cld 23002 df-ntr 23003 df-cls 23004 df-nei 23081 df-lp 23119 df-perf 23120 df-cn 23210 df-cnp 23211 df-haus 23298 df-tx 23545 df-hmeo 23738 df-fil 23829 df-fm 23921 df-flim 23922 df-flf 23923 df-xms 24303 df-ms 24304 df-tms 24305 df-cncf 24863 df-limc 25851 df-dv 25852 |
| This theorem is referenced by: fourierdlem102 46651 fourierdlem114 46663 |
| Copyright terms: Public domain | W3C validator |