| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ftc1cn | Structured version Visualization version GIF version | ||
| Description: Strengthen the assumptions of ftc1 26232 to when the function 𝐹 is continuous on the entire interval (𝐴, 𝐵); in this case we can calculate D 𝐺 exactly. (Contributed by Mario Carneiro, 1-Sep-2014.) |
| Ref | Expression |
|---|---|
| ftc1cn.g | ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹‘𝑡) d𝑡) |
| ftc1cn.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| ftc1cn.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| ftc1cn.le | ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
| ftc1cn.f | ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ)) |
| ftc1cn.i | ⊢ (𝜑 → 𝐹 ∈ 𝐿1) |
| Ref | Expression |
|---|---|
| ftc1cn | ⊢ (𝜑 → (ℝ D 𝐺) = 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dvf 26097 | . . . . 5 ⊢ (ℝ D 𝐺):dom (ℝ D 𝐺)⟶ℂ | |
| 2 | 1 | a1i 11 | . . . 4 ⊢ (𝜑 → (ℝ D 𝐺):dom (ℝ D 𝐺)⟶ℂ) |
| 3 | 2 | ffund 6714 | . . 3 ⊢ (𝜑 → Fun (ℝ D 𝐺)) |
| 4 | ax-resscn 11168 | . . . . . . 7 ⊢ ℝ ⊆ ℂ | |
| 5 | 4 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℝ ⊆ ℂ) |
| 6 | ftc1cn.g | . . . . . . 7 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹‘𝑡) d𝑡) | |
| 7 | ftc1cn.a | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 8 | ftc1cn.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 9 | ftc1cn.le | . . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐵) | |
| 10 | ssidd 3961 | . . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐵)) | |
| 11 | ioossre 13446 | . . . . . . . 8 ⊢ (𝐴(,)𝐵) ⊆ ℝ | |
| 12 | 11 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ) |
| 13 | ftc1cn.i | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝐿1) | |
| 14 | ftc1cn.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ)) | |
| 15 | cncff 25083 | . . . . . . . 8 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ) → 𝐹:(𝐴(,)𝐵)⟶ℂ) | |
| 16 | 14, 15 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ) |
| 17 | 6, 7, 8, 9, 10, 12, 13, 16 | ftc1lem2 26226 | . . . . . 6 ⊢ (𝜑 → 𝐺:(𝐴[,]𝐵)⟶ℂ) |
| 18 | iccssre 13468 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ) | |
| 19 | 7, 8, 18 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ) |
| 20 | tgioo4 24993 | . . . . . 6 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂfld) ↾t ℝ) | |
| 21 | eqid 2765 | . . . . . 6 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 22 | 5, 17, 19, 20, 21 | dvbssntr 26090 | . . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐺) ⊆ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))) |
| 23 | iccntr 25010 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵)) | |
| 24 | 7, 8, 23 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵)) |
| 25 | 22, 24 | sseqtrd 3974 | . . . 4 ⊢ (𝜑 → dom (ℝ D 𝐺) ⊆ (𝐴(,)𝐵)) |
| 26 | 7 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ) |
| 27 | 8 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ) |
| 28 | 9 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐴 ≤ 𝐵) |
| 29 | ssidd 3961 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐵)) | |
| 30 | 11 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ ℝ) |
| 31 | 13 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ 𝐿1) |
| 32 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ (𝐴(,)𝐵)) | |
| 33 | 11, 4 | sstri 3947 | . . . . . . . . . 10 ⊢ (𝐴(,)𝐵) ⊆ ℂ |
| 34 | ssid 3960 | . . . . . . . . . 10 ⊢ ℂ ⊆ ℂ | |
| 35 | eqid 2765 | . . . . . . . . . . 11 ⊢ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) = ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) | |
| 36 | 21 | cnfldtopon 24970 | . . . . . . . . . . . 12 ⊢ (TopOpen‘ℂfld) ∈ (TopOn‘ℂ) |
| 37 | 36 | toponrestid 23108 | . . . . . . . . . . 11 ⊢ (TopOpen‘ℂfld) = ((TopOpen‘ℂfld) ↾t ℂ) |
| 38 | 21, 35, 37 | cncfcn 25100 | . . . . . . . . . 10 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld))) |
| 39 | 33, 34, 38 | mp2an 705 | . . . . . . . . 9 ⊢ ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld)) |
| 40 | 14, 39 | eleqtrdi 2875 | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld))) |
| 41 | 40 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld))) |
| 42 | 33 | a1i 11 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ) |
| 43 | resttopon 23348 | . . . . . . . . . . 11 ⊢ (((TopOpen‘ℂfld) ∈ (TopOn‘ℂ) ∧ (𝐴(,)𝐵) ⊆ ℂ) → ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))) | |
| 44 | 36, 42, 43 | sylancr 599 | . . . . . . . . . 10 ⊢ (𝜑 → ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))) |
| 45 | toponuni 23101 | . . . . . . . . . 10 ⊢ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)) → (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) | |
| 46 | 44, 45 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) |
| 47 | 46 | eleq2d 2851 | . . . . . . . 8 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↔ 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)))) |
| 48 | 47 | biimpa 482 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) |
| 49 | eqid 2765 | . . . . . . . 8 ⊢ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) | |
| 50 | 49 | cncnpi 23465 | . . . . . . 7 ⊢ ((𝐹 ∈ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld)) ∧ 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) → 𝐹 ∈ ((((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) CnP (TopOpen‘ℂfld))‘𝑦)) |
| 51 | 41, 48, 50 | syl2anc 596 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ ((((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) CnP (TopOpen‘ℂfld))‘𝑦)) |
| 52 | 6, 26, 27, 28, 29, 30, 31, 32, 51, 20, 35, 21 | ftc1 26232 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦(ℝ D 𝐺)(𝐹‘𝑦)) |
| 53 | vex 3461 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 54 | fvex 6898 | . . . . . 6 ⊢ (𝐹‘𝑦) ∈ V | |
| 55 | 53, 54 | breldm 5900 | . . . . 5 ⊢ (𝑦(ℝ D 𝐺)(𝐹‘𝑦) → 𝑦 ∈ dom (ℝ D 𝐺)) |
| 56 | 52, 55 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ dom (ℝ D 𝐺)) |
| 57 | 25, 56 | eqelssd 3959 | . . 3 ⊢ (𝜑 → dom (ℝ D 𝐺) = (𝐴(,)𝐵)) |
| 58 | df-fn 6543 | . . 3 ⊢ ((ℝ D 𝐺) Fn (𝐴(,)𝐵) ↔ (Fun (ℝ D 𝐺) ∧ dom (ℝ D 𝐺) = (𝐴(,)𝐵))) | |
| 59 | 3, 57, 58 | sylanbrc 595 | . 2 ⊢ (𝜑 → (ℝ D 𝐺) Fn (𝐴(,)𝐵)) |
| 60 | 16 | ffnd 6710 | . 2 ⊢ (𝜑 → 𝐹 Fn (𝐴(,)𝐵)) |
| 61 | 3 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → Fun (ℝ D 𝐺)) |
| 62 | funbrfv 6933 | . . 3 ⊢ (Fun (ℝ D 𝐺) → (𝑦(ℝ D 𝐺)(𝐹‘𝑦) → ((ℝ D 𝐺)‘𝑦) = (𝐹‘𝑦))) | |
| 63 | 61, 52, 62 | sylc 66 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((ℝ D 𝐺)‘𝑦) = (𝐹‘𝑦)) |
| 64 | 59, 60, 63 | eqfnfvd 7032 | 1 ⊢ (𝜑 → (ℝ D 𝐺) = 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ⊆ wss 3906 ∪ cuni 4874 class class class wbr 5111 ↦ cmpt 5194 dom cdm 5663 ran crn 5664 Fun wfun 6534 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 (class class class)co 7416 ℂcc 11109 ℝcr 11110 ≤ cle 11255 (,)cioo 13384 [,]cicc 13387 ↾t crest 17491 TopOpenctopn 17492 topGenctg 17508 ℂfldccnfld 21552 TopOnctopon 23097 intcnt 23204 Cn ccn 23411 CnP ccnp 23412 –cn→ccncf 25066 𝐿1cibl 25807 ∫citg 25808 D cdv 26053 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-inf2 9613 ax-cc 10430 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 ax-pre-sup 11189 ax-addf 11190 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-symdif 4206 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-iin 4961 df-disj 5079 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-of 7680 df-ofr 7681 df-om 7865 df-1st 7988 df-2nd 7989 df-supp 8159 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-oadd 8459 df-omul 8460 df-er 8696 df-map 8828 df-pm 8829 df-ixp 8898 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-fsupp 9325 df-fi 9374 df-sup 9405 df-inf 9406 df-oi 9475 df-dju 9899 df-card 9937 df-acn 9940 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-div 11883 df-nn 12245 df-2 12314 df-3 12315 df-4 12316 df-5 12317 df-6 12318 df-7 12319 df-8 12320 df-9 12321 df-n0 12516 df-z 12603 df-dec 12724 df-uz 12875 df-q 12985 df-rp 13029 df-xneg 13149 df-xadd 13150 df-xmul 13151 df-ioo 13388 df-ioc 13389 df-ico 13390 df-icc 13391 df-fz 13548 df-fzo 13696 df-fl 13839 df-mod 13917 df-seq 14052 df-exp 14112 df-hash 14381 df-cj 15170 df-re 15171 df-im 15172 df-sqrt 15306 df-abs 15307 df-clim 15559 df-rlim 15560 df-sum 15758 df-struct 17225 df-sets 17242 df-slot 17260 df-ndx 17272 df-base 17288 df-ress 17309 df-plusg 17341 df-mulr 17342 df-starv 17343 df-sca 17344 df-vsca 17345 df-ip 17346 df-tset 17347 df-ple 17348 df-ds 17350 df-unif 17351 df-hom 17352 df-cco 17353 df-rest 17493 df-topn 17494 df-0g 17512 df-gsum 17513 df-topgen 17514 df-pt 17515 df-prds 17518 df-xrs 17574 df-qtop 17579 df-imas 17580 df-xps 17582 df-mre 17656 df-mrc 17657 df-acs 17659 df-mgm 18716 df-sgrp 18799 df-mnd 18815 df-submnd 18866 df-mulg 19158 df-cntz 19411 df-cmn 19876 df-psmet 21544 df-xmet 21545 df-met 21546 df-bl 21547 df-mopn 21548 df-fbas 21549 df-fg 21550 df-cnfld 21553 df-top 23081 df-topon 23098 df-topsp 23120 df-bases 23133 df-cld 23206 df-ntr 23207 df-cls 23208 df-nei 23285 df-lp 23323 df-perf 23324 df-cn 23414 df-cnp 23415 df-haus 23502 df-cmp 23574 df-tx 23750 df-hmeo 23943 df-fil 24034 df-fm 24126 df-flim 24127 df-flf 24128 df-xms 24508 df-ms 24509 df-tms 24510 df-cncf 25068 df-ovol 25654 df-vol 25655 df-mbf 25809 df-itg1 25810 df-itg2 25811 df-ibl 25812 df-itg 25813 df-0p 25860 df-limc 26056 df-dv 26057 |
| This theorem is used by: ftc2 26234 itgsubstlem 26238 |
| Copyright terms: Public domain | W3C validator |