| 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 781 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) | |
| 2 | simplll 787 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝜑) | |
| 3 | ioossicc 13571 | . . . . . . . . 9 ⊢ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1))) | |
| 4 | pire 26792 | . . . . . . . . . . . . 13 ⊢ π ∈ ℝ | |
| 5 | 4 | renegcli 11626 | . . . . . . . . . . . 12 ⊢ -π ∈ ℝ |
| 6 | 5 | rexri 11374 | . . . . . . . . . . 11 ⊢ -π ∈ ℝ* |
| 7 | 6 | a1i 11 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → -π ∈ ℝ*) |
| 8 | 4 | rexri 11374 | . . . . . . . . . . 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 47240 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑄:(0...𝑀)⟶( -π[,]π)) |
| 14 | 13 | adantr 486 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑄:(0...𝑀)⟶( -π[,]π)) |
| 15 | simpr 490 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0..^𝑀)) | |
| 16 | 7, 9, 14, 15 | fourierdlem8 47233 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1))) ⊆ ( -π[,]π)) |
| 17 | 3, 16 | sstrid 3920 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ ( -π[,]π)) |
| 18 | 17 | sselda 3909 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝑥 ∈ ( -π[,]π)) |
| 19 | 18 | adantr 486 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ ( -π[,]π)) |
| 20 | simpr 490 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → ¬ 𝑥 ∈ dom 𝐹) | |
| 21 | simpllr 788 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑖 ∈ (0..^𝑀)) | |
| 22 | 11 | 3ad2ant1 1151 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ( -π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑀 ∈ ℕ) |
| 23 | 12 | 3ad2ant1 1151 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ( -π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑄 ∈ (𝑃‘𝑀)) |
| 24 | simp2 1155 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ( -π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ ( -π[,]π)) | |
| 25 | simp3 1156 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ( -π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → ¬ 𝑥 ∈ dom 𝐹) | |
| 26 | 24, 25 | eldifd 4049 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ( -π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ (( -π[,]π) ∖ dom 𝐹)) |
| 27 | elun2 4180 | . . . . . . . . 9 ⊢ (𝑥 ∈ (( -π[,]π) ∖ dom 𝐹) → 𝑥 ∈ (𝐴 ∪ (( -π[,]π) ∖ dom 𝐹))) | |
| 28 | 26, 27 | syl 18 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ( -π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ (𝐴 ∪ (( -π[,]π) ∖ dom 𝐹))) |
| 29 | fourierdlem38.ranq | . . . . . . . . . 10 ⊢ (𝜑 → ran 𝑄 = 𝐻) | |
| 30 | fourierdlem38.h | . . . . . . . . . 10 ⊢ 𝐻 = (𝐴 ∪ (( -π[,]π) ∖ dom 𝐹)) | |
| 31 | 29, 30 | eqtr2di 2812 | . . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∪ (( -π[,]π) ∖ dom 𝐹)) = ran 𝑄) |
| 32 | 31 | 3ad2ant1 1151 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ( -π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → (𝐴 ∪ (( -π[,]π) ∖ dom 𝐹)) = ran 𝑄) |
| 33 | 28, 32 | eleqtrd 2862 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ( -π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ ran 𝑄) |
| 34 | 10, 22, 23, 33 | fourierdlem12 47237 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ( -π[,]π) ∧ ¬ 𝑥 ∈ dom 𝐹) ∧ 𝑖 ∈ (0..^𝑀)) → ¬ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) |
| 35 | 2, 19, 20, 21, 34 | syl31anc 1400 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ ¬ 𝑥 ∈ dom 𝐹) → ¬ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) |
| 36 | 1, 35 | condan 830 | . . . 4 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝑥 ∈ dom 𝐹) |
| 37 | 36 | ralrimiva 3154 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ∀𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))𝑥 ∈ dom 𝐹) |
| 38 | dfss3 3898 | . . 3 ⊢ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ dom 𝐹 ↔ ∀𝑥 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))𝑥 ∈ dom 𝐹) | |
| 39 | 37, 38 | sylibr 237 | . 2 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ dom 𝐹) |
| 40 | fourierdlem38.cn | . . 3 ⊢ (𝜑 → 𝐹 ∈ (dom 𝐹–cn→ℂ)) | |
| 41 | 40 | adantr 486 | . 2 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐹 ∈ (dom 𝐹–cn→ℂ)) |
| 42 | rescncf 25227 | . 2 ⊢ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ dom 𝐹 → (𝐹 ∈ (dom 𝐹–cn→ℂ) → (𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∈ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))–cn→ℂ))) | |
| 43 | 39, 41, 42 | sylc 66 | 1 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∈ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))–cn→ℂ)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∀wral 3076 {crab 3412 ⊆ wss 3896 ∖ cdif 4044 ∪ cun 4148 class class class wbr 5102 ↦ cmpt 5185 dom cdm 5651 ran crn 5652 ↾ cres 5653 ⟶wf 6539 ‘cfv 6543 (class class class)co 7424 ↑m cmap 8854 ℂcc 11205 ℝcr 11206 0cc0 11207 1c1 11208 + caddc 11210 ℝ*cxr 11349 < clt 11350 -cneg 11549 ℕcn 12342 (,)cioo 13483 [,]cicc 13486 ...cfz 13646 ..^cfzo 13795 πcpi 16241 –cn→ccncf 25206 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-inf2 9649 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 ax-addf 11286 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-of 7697 df-om 7882 df-1st 8005 df-2nd 8006 df-supp 8184 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-1o 8483 df-2o 8484 df-er 8724 df-map 8856 df-pm 8857 df-ixp 8933 df-en 8981 df-dom 8982 df-sdom 8983 df-fin 8984 df-fsupp 9361 df-fi 9410 df-sup 9441 df-inf 9442 df-oi 9511 df-card 10027 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-3 12413 df-4 12414 df-5 12415 df-6 12416 df-7 12417 df-8 12418 df-9 12419 df-n0 12614 df-z 12701 df-dec 12822 df-uz 12973 df-q 13083 df-rp 13128 df-xneg 13248 df-xadd 13249 df-xmul 13250 df-ioo 13487 df-ioc 13488 df-ico 13489 df-icc 13490 df-fz 13647 df-fzo 13796 df-fl 13939 df-seq 14152 df-exp 14212 df-fac 14425 df-bc 14454 df-hash 14482 df-shft 15229 df-cj 15275 df-re 15276 df-im 15277 df-sqrt 15411 df-abs 15412 df-limsup 15647 df-clim 15664 df-rlim 15665 df-sum 15863 df-ef 16242 df-sin 16244 df-cos 16245 df-pi 16247 df-struct 17334 df-sets 17351 df-slot 17369 df-ndx 17381 df-base 17397 df-ress 17418 df-plusg 17450 df-mulr 17451 df-starv 17452 df-sca 17453 df-vsca 17454 df-ip 17455 df-tset 17456 df-ple 17457 df-ds 17459 df-unif 17460 df-hom 17461 df-cco 17462 df-rest 17602 df-topn 17603 df-0g 17621 df-gsum 17622 df-topgen 17623 df-pt 17624 df-prds 17627 df-xrs 17683 df-qtop 17688 df-imas 17689 df-xps 17691 df-mre 17765 df-mrc 17766 df-acs 17768 df-mgm 18825 df-sgrp 18917 df-mnd 18933 df-submnd 18988 df-mulg 19287 df-cntz 19540 df-cmn 20005 df-psmet 21679 df-xmet 21680 df-met 21681 df-bl 21682 df-mopn 21683 df-fbas 21684 df-fg 21685 df-cnfld 21688 df-top 23221 df-topon 23238 df-topsp 23260 df-bases 23273 df-cld 23346 df-ntr 23347 df-cls 23348 df-nei 23425 df-lp 23463 df-perf 23464 df-cn 23554 df-cnp 23555 df-haus 23642 df-tx 23890 df-hmeo 24083 df-fil 24174 df-fm 24266 df-flim 24267 df-flf 24268 df-xms 24648 df-ms 24649 df-tms 24650 df-cncf 25208 df-limc 26195 df-dv 26196 |
| This theorem is used by: fourierdlem102 47326 fourierdlem114 47338 |
| Copyright terms: Public domain | W3C validator |