| 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 26166 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 26031 | . . . . 5 ⊢ (ℝ D 𝐺):dom (ℝ D 𝐺)⟶ℂ | |
| 2 | 1 | a1i 11 | . . . 4 ⊢ (𝜑 → (ℝ D 𝐺):dom (ℝ D 𝐺)⟶ℂ) |
| 3 | 2 | ffund 6708 | . . 3 ⊢ (𝜑 → Fun (ℝ D 𝐺)) |
| 4 | ax-resscn 11153 | . . . . . . 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 3968 | . . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐵)) | |
| 11 | ioossre 13430 | . . . . . . . 8 ⊢ (𝐴(,)𝐵) ⊆ ℝ | |
| 12 | 11 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ) |
| 13 | ftc1cn.i | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝐿1) | |
| 14 | ftc1cn.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ)) | |
| 15 | cncff 25017 | . . . . . . . 8 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ) → 𝐹:(𝐴(,)𝐵)⟶ℂ) | |
| 16 | 14, 15 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ) |
| 17 | 6, 7, 8, 9, 10, 12, 13, 16 | ftc1lem2 26160 | . . . . . 6 ⊢ (𝜑 → 𝐺:(𝐴[,]𝐵)⟶ℂ) |
| 18 | iccssre 13452 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ) | |
| 19 | 7, 8, 18 | syl2anc 595 | . . . . . 6 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ) |
| 20 | tgioo4 24927 | . . . . . 6 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂfld) ↾t ℝ) | |
| 21 | eqid 2769 | . . . . . 6 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 22 | 5, 17, 19, 20, 21 | dvbssntr 26024 | . . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐺) ⊆ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))) |
| 23 | iccntr 24944 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵)) | |
| 24 | 7, 8, 23 | syl2anc 595 | . . . . 5 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵)) |
| 25 | 22, 24 | sseqtrd 3981 | . . . 4 ⊢ (𝜑 → dom (ℝ D 𝐺) ⊆ (𝐴(,)𝐵)) |
| 26 | 7 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ) |
| 27 | 8 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ) |
| 28 | 9 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐴 ≤ 𝐵) |
| 29 | ssidd 3968 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐵)) | |
| 30 | 11 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ ℝ) |
| 31 | 13 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ 𝐿1) |
| 32 | simpr 489 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ (𝐴(,)𝐵)) | |
| 33 | 11, 4 | sstri 3954 | . . . . . . . . . 10 ⊢ (𝐴(,)𝐵) ⊆ ℂ |
| 34 | ssid 3967 | . . . . . . . . . 10 ⊢ ℂ ⊆ ℂ | |
| 35 | eqid 2769 | . . . . . . . . . . 11 ⊢ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) = ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) | |
| 36 | 21 | cnfldtopon 24904 | . . . . . . . . . . . 12 ⊢ (TopOpen‘ℂfld) ∈ (TopOn‘ℂ) |
| 37 | 36 | toponrestid 23043 | . . . . . . . . . . 11 ⊢ (TopOpen‘ℂfld) = ((TopOpen‘ℂfld) ↾t ℂ) |
| 38 | 21, 35, 37 | cncfcn 25034 | . . . . . . . . . 10 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld))) |
| 39 | 33, 34, 38 | mp2an 704 | . . . . . . . . 9 ⊢ ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld)) |
| 40 | 14, 39 | eleqtrdi 2879 | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld))) |
| 41 | 40 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld))) |
| 42 | 33 | a1i 11 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ) |
| 43 | resttopon 23283 | . . . . . . . . . . 11 ⊢ (((TopOpen‘ℂfld) ∈ (TopOn‘ℂ) ∧ (𝐴(,)𝐵) ⊆ ℂ) → ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))) | |
| 44 | 36, 42, 43 | sylancr 598 | . . . . . . . . . 10 ⊢ (𝜑 → ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))) |
| 45 | toponuni 23036 | . . . . . . . . . 10 ⊢ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)) → (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) | |
| 46 | 44, 45 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) |
| 47 | 46 | eleq2d 2855 | . . . . . . . 8 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↔ 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)))) |
| 48 | 47 | biimpa 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) |
| 49 | eqid 2769 | . . . . . . . 8 ⊢ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) | |
| 50 | 49 | cncnpi 23400 | . . . . . . 7 ⊢ ((𝐹 ∈ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld)) ∧ 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) → 𝐹 ∈ ((((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) CnP (TopOpen‘ℂfld))‘𝑦)) |
| 51 | 41, 48, 50 | syl2anc 595 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ ((((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) CnP (TopOpen‘ℂfld))‘𝑦)) |
| 52 | 6, 26, 27, 28, 29, 30, 31, 32, 51, 20, 35, 21 | ftc1 26166 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦(ℝ D 𝐺)(𝐹‘𝑦)) |
| 53 | vex 3467 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 54 | fvex 6892 | . . . . . 6 ⊢ (𝐹‘𝑦) ∈ V | |
| 55 | 53, 54 | breldm 5896 | . . . . 5 ⊢ (𝑦(ℝ D 𝐺)(𝐹‘𝑦) → 𝑦 ∈ dom (ℝ D 𝐺)) |
| 56 | 52, 55 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ dom (ℝ D 𝐺)) |
| 57 | 25, 56 | eqelssd 3966 | . . 3 ⊢ (𝜑 → dom (ℝ D 𝐺) = (𝐴(,)𝐵)) |
| 58 | df-fn 6537 | . . 3 ⊢ ((ℝ D 𝐺) Fn (𝐴(,)𝐵) ↔ (Fun (ℝ D 𝐺) ∧ dom (ℝ D 𝐺) = (𝐴(,)𝐵))) | |
| 59 | 3, 57, 58 | sylanbrc 594 | . 2 ⊢ (𝜑 → (ℝ D 𝐺) Fn (𝐴(,)𝐵)) |
| 60 | 16 | ffnd 6704 | . 2 ⊢ (𝜑 → 𝐹 Fn (𝐴(,)𝐵)) |
| 61 | 3 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → Fun (ℝ D 𝐺)) |
| 62 | funbrfv 6927 | . . 3 ⊢ (Fun (ℝ D 𝐺) → (𝑦(ℝ D 𝐺)(𝐹‘𝑦) → ((ℝ D 𝐺)‘𝑦) = (𝐹‘𝑦))) | |
| 63 | 61, 52, 62 | sylc 66 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((ℝ D 𝐺)‘𝑦) = (𝐹‘𝑦)) |
| 64 | 59, 60, 63 | eqfnfvd 7026 | 1 ⊢ (𝜑 → (ℝ D 𝐺) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ⊆ wss 3913 ∪ cuni 4873 class class class wbr 5110 ↦ cmpt 5193 dom cdm 5659 ran crn 5660 Fun wfun 6528 Fn wfn 6529 ⟶wf 6530 ‘cfv 6534 (class class class)co 7408 ℂcc 11094 ℝcr 11095 ≤ cle 11240 (,)cioo 13368 [,]cicc 13371 ↾t crest 17469 TopOpenctopn 17470 topGenctg 17486 ℂfldccnfld 21487 TopOnctopon 23032 intcnt 23139 Cn ccn 23346 CnP ccnp 23347 –cn→ccncf 25000 𝐿1cibl 25741 ∫citg 25742 D cdv 25987 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-inf2 9606 ax-cc 10415 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 ax-pre-sup 11174 ax-addf 11175 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-symdif 4214 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-iin 4960 df-disj 5078 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6300 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-isom 6543 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-of 7672 df-ofr 7673 df-om 7859 df-1st 7982 df-2nd 7983 df-supp 8153 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-oadd 8453 df-omul 8454 df-er 8690 df-map 8822 df-pm 8823 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9318 df-fi 9367 df-sup 9398 df-inf 9399 df-oi 9468 df-dju 9883 df-card 9921 df-acn 9924 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-div 11868 df-nn 12230 df-2 12299 df-3 12300 df-4 12301 df-5 12302 df-6 12303 df-7 12304 df-8 12305 df-9 12306 df-n0 12501 df-z 12588 df-dec 12708 df-uz 12859 df-q 12969 df-rp 13013 df-xneg 13133 df-xadd 13134 df-xmul 13135 df-ioo 13372 df-ioc 13373 df-ico 13374 df-icc 13375 df-fz 13532 df-fzo 13679 df-fl 13821 df-mod 13899 df-seq 14034 df-exp 14094 df-hash 14363 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-clim 15535 df-rlim 15536 df-sum 15734 df-struct 17203 df-sets 17220 df-slot 17238 df-ndx 17250 df-base 17266 df-ress 17287 df-plusg 17319 df-mulr 17320 df-starv 17321 df-sca 17322 df-vsca 17323 df-ip 17324 df-tset 17325 df-ple 17326 df-ds 17328 df-unif 17329 df-hom 17330 df-cco 17331 df-rest 17471 df-topn 17472 df-0g 17490 df-gsum 17491 df-topgen 17492 df-pt 17493 df-prds 17496 df-xrs 17552 df-qtop 17557 df-imas 17558 df-xps 17560 df-mre 17634 df-mrc 17635 df-acs 17637 df-mgm 18694 df-sgrp 18773 df-mnd 18789 df-submnd 18838 df-mulg 19130 df-cntz 19383 df-cmn 19848 df-psmet 21479 df-xmet 21480 df-met 21481 df-bl 21482 df-mopn 21483 df-fbas 21484 df-fg 21485 df-cnfld 21488 df-top 23016 df-topon 23033 df-topsp 23055 df-bases 23068 df-cld 23141 df-ntr 23142 df-cls 23143 df-nei 23220 df-lp 23258 df-perf 23259 df-cn 23349 df-cnp 23350 df-haus 23437 df-cmp 23509 df-tx 23684 df-hmeo 23877 df-fil 23968 df-fm 24060 df-flim 24061 df-flf 24062 df-xms 24442 df-ms 24443 df-tms 24444 df-cncf 25002 df-ovol 25588 df-vol 25589 df-mbf 25743 df-itg1 25744 df-itg2 25745 df-ibl 25746 df-itg 25747 df-0p 25794 df-limc 25990 df-dv 25991 |
| This theorem is referenced by: ftc2 26168 itgsubstlem 26172 |
| Copyright terms: Public domain | W3C validator |