| 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 26369 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 26234 | . . . . 5 ⊢ (ℝ D 𝐺):dom (ℝ D 𝐺)⟶ℂ | |
| 2 | 1 | a1i 11 | . . . 4 ⊢ (𝜑 → (ℝ D 𝐺):dom (ℝ D 𝐺)⟶ℂ) |
| 3 | 2 | ffund 6717 | . . 3 ⊢ (𝜑 → Fun (ℝ D 𝐺)) |
| 4 | ax-resscn 11262 | . . . . . . 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 3932 | . . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐵)) | |
| 11 | ioossre 13543 | . . . . . . . 8 ⊢ (𝐴(,)𝐵) ⊆ ℝ | |
| 12 | 11 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ) |
| 13 | ftc1cn.i | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝐿1) | |
| 14 | ftc1cn.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ)) | |
| 15 | cncff 25221 | . . . . . . . 8 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ) → 𝐹:(𝐴(,)𝐵)⟶ℂ) | |
| 16 | 14, 15 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ) |
| 17 | 6, 7, 8, 9, 10, 12, 13, 16 | ftc1lem2 26363 | . . . . . 6 ⊢ (𝜑 → 𝐺:(𝐴[,]𝐵)⟶ℂ) |
| 18 | iccssre 13565 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ) | |
| 19 | 7, 8, 18 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ) |
| 20 | tgioo4 25131 | . . . . . 6 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂfld) ↾t ℝ) | |
| 21 | eqid 2760 | . . . . . 6 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 22 | 5, 17, 19, 20, 21 | dvbssntr 26227 | . . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐺) ⊆ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))) |
| 23 | iccntr 25148 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵)) | |
| 24 | 7, 8, 23 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵)) |
| 25 | 22, 24 | sseqtrd 3945 | . . . 4 ⊢ (𝜑 → dom (ℝ D 𝐺) ⊆ (𝐴(,)𝐵)) |
| 26 | 7 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ) |
| 27 | 8 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ) |
| 28 | 9 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐴 ≤ 𝐵) |
| 29 | ssidd 3932 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐵)) | |
| 30 | 11 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ ℝ) |
| 31 | 13 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ 𝐿1) |
| 32 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ (𝐴(,)𝐵)) | |
| 33 | 11, 4 | sstri 3918 | . . . . . . . . . 10 ⊢ (𝐴(,)𝐵) ⊆ ℂ |
| 34 | ssid 3931 | . . . . . . . . . 10 ⊢ ℂ ⊆ ℂ | |
| 35 | eqid 2760 | . . . . . . . . . . 11 ⊢ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) = ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) | |
| 36 | 21 | cnfldtopon 25108 | . . . . . . . . . . . 12 ⊢ (TopOpen‘ℂfld) ∈ (TopOn‘ℂ) |
| 37 | 36 | toponrestid 23246 | . . . . . . . . . . 11 ⊢ (TopOpen‘ℂfld) = ((TopOpen‘ℂfld) ↾t ℂ) |
| 38 | 21, 35, 37 | cncfcn 25238 | . . . . . . . . . 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 2870 | . . . . . . . 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 23486 | . . . . . . . . . . 11 ⊢ (((TopOpen‘ℂfld) ∈ (TopOn‘ℂ) ∧ (𝐴(,)𝐵) ⊆ ℂ) → ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))) | |
| 44 | 36, 42, 43 | sylancr 599 | . . . . . . . . . 10 ⊢ (𝜑 → ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))) |
| 45 | toponuni 23239 | . . . . . . . . . 10 ⊢ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)) → (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) | |
| 46 | 44, 45 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) |
| 47 | 46 | eleq2d 2846 | . . . . . . . 8 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↔ 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)))) |
| 48 | 47 | biimpa 482 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) |
| 49 | eqid 2760 | . . . . . . . 8 ⊢ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) | |
| 50 | 49 | cncnpi 23603 | . . . . . . 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 26369 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦(ℝ D 𝐺)(𝐹‘𝑦)) |
| 53 | vex 3454 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 54 | fvex 6901 | . . . . . 6 ⊢ (𝐹‘𝑦) ∈ V | |
| 55 | 53, 54 | breldm 5890 | . . . . 5 ⊢ (𝑦(ℝ D 𝐺)(𝐹‘𝑦) → 𝑦 ∈ dom (ℝ D 𝐺)) |
| 56 | 52, 55 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ dom (ℝ D 𝐺)) |
| 57 | 25, 56 | eqelssd 3930 | . . 3 ⊢ (𝜑 → dom (ℝ D 𝐺) = (𝐴(,)𝐵)) |
| 58 | df-fn 6544 | . . 3 ⊢ ((ℝ D 𝐺) Fn (𝐴(,)𝐵) ↔ (Fun (ℝ D 𝐺) ∧ dom (ℝ D 𝐺) = (𝐴(,)𝐵))) | |
| 59 | 3, 57, 58 | sylanbrc 595 | . 2 ⊢ (𝜑 → (ℝ D 𝐺) Fn (𝐴(,)𝐵)) |
| 60 | 16 | ffnd 6713 | . 2 ⊢ (𝜑 → 𝐹 Fn (𝐴(,)𝐵)) |
| 61 | 3 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → Fun (ℝ D 𝐺)) |
| 62 | funbrfv 6936 | . . 3 ⊢ (Fun (ℝ D 𝐺) → (𝑦(ℝ D 𝐺)(𝐹‘𝑦) → ((ℝ D 𝐺)‘𝑦) = (𝐹‘𝑦))) | |
| 63 | 61, 52, 62 | sylc 66 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((ℝ D 𝐺)‘𝑦) = (𝐹‘𝑦)) |
| 64 | 59, 60, 63 | eqfnfvd 7035 | 1 ⊢ (𝜑 → (ℝ D 𝐺) = 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⊆ wss 3896 ∪ cuni 4866 class class class wbr 5102 ↦ cmpt 5185 dom cdm 5650 ran crn 5651 Fun wfun 6535 Fn wfn 6536 ⟶wf 6537 ‘cfv 6541 (class class class)co 7422 ℂcc 11203 ℝcr 11204 ≤ cle 11349 (,)cioo 13481 [,]cicc 13484 ↾t crest 17598 TopOpenctopn 17599 topGenctg 17615 ℂfldccnfld 21685 TopOnctopon 23235 intcnt 23342 Cn ccn 23549 CnP ccnp 23550 –cn→ccncf 25204 𝐿1cibl 25945 ∫citg 25946 D cdv 26190 |
| 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 5326 ax-pr 5390 ax-un 7753 ax-inf2 9647 ax-cc 10518 ax-cnex 11261 ax-resscn 11262 ax-1cn 11263 ax-icn 11264 ax-addcl 11265 ax-addrcl 11266 ax-mulcl 11267 ax-mulrcl 11268 ax-mulcom 11269 ax-addass 11270 ax-mulass 11271 ax-distr 11272 ax-i2m1 11273 ax-1ne0 11274 ax-1rid 11275 ax-rnegex 11276 ax-rrecex 11277 ax-cnre 11278 ax-pre-lttri 11279 ax-pre-lttrn 11280 ax-pre-ltadd 11281 ax-pre-mulgt0 11282 ax-pre-sup 11283 ax-addf 11284 |
| 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-symdif 4197 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-disj 5070 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-isom 6550 df-riota 7379 df-ov 7425 df-oprab 7426 df-mpo 7427 df-of 7695 df-ofr 7696 df-om 7880 df-1st 8003 df-2nd 8004 df-supp 8182 df-frecs 8304 df-wrecs 8335 df-recs 8384 df-rdg 8423 df-1o 8481 df-2o 8482 df-oadd 8485 df-omul 8486 df-er 8722 df-map 8854 df-pm 8855 df-ixp 8931 df-en 8979 df-dom 8980 df-sdom 8981 df-fin 8982 df-fsupp 9359 df-fi 9408 df-sup 9439 df-inf 9440 df-oi 9509 df-dju 9987 df-card 10025 df-acn 10028 df-pnf 11350 df-mnf 11351 df-xr 11352 df-ltxr 11353 df-le 11354 df-sub 11548 df-neg 11549 df-div 11979 df-nn 12341 df-2 12410 df-3 12411 df-4 12412 df-5 12413 df-6 12414 df-7 12415 df-8 12416 df-9 12417 df-n0 12612 df-z 12699 df-dec 12820 df-uz 12971 df-q 13081 df-rp 13126 df-xneg 13246 df-xadd 13247 df-xmul 13248 df-ioo 13485 df-ioc 13486 df-ico 13487 df-icc 13488 df-fz 13645 df-fzo 13794 df-fl 13937 df-mod 14015 df-seq 14150 df-exp 14210 df-hash 14480 df-cj 15273 df-re 15274 df-im 15275 df-sqrt 15409 df-abs 15410 df-clim 15662 df-rlim 15663 df-sum 15861 df-struct 17332 df-sets 17349 df-slot 17367 df-ndx 17379 df-base 17395 df-ress 17416 df-plusg 17448 df-mulr 17449 df-starv 17450 df-sca 17451 df-vsca 17452 df-ip 17453 df-tset 17454 df-ple 17455 df-ds 17457 df-unif 17458 df-hom 17459 df-cco 17460 df-rest 17600 df-topn 17601 df-0g 17619 df-gsum 17620 df-topgen 17621 df-pt 17622 df-prds 17625 df-xrs 17681 df-qtop 17686 df-imas 17687 df-xps 17689 df-mre 17763 df-mrc 17764 df-acs 17766 df-mgm 18823 df-sgrp 18915 df-mnd 18931 df-submnd 18986 df-mulg 19285 df-cntz 19538 df-cmn 20003 df-psmet 21677 df-xmet 21678 df-met 21679 df-bl 21680 df-mopn 21681 df-fbas 21682 df-fg 21683 df-cnfld 21686 df-top 23219 df-topon 23236 df-topsp 23258 df-bases 23271 df-cld 23344 df-ntr 23345 df-cls 23346 df-nei 23423 df-lp 23461 df-perf 23462 df-cn 23552 df-cnp 23553 df-haus 23640 df-cmp 23712 df-tx 23888 df-hmeo 24081 df-fil 24172 df-fm 24264 df-flim 24265 df-flf 24266 df-xms 24646 df-ms 24647 df-tms 24648 df-cncf 25206 df-ovol 25792 df-vol 25793 df-mbf 25947 df-itg1 25948 df-itg2 25949 df-ibl 25950 df-itg 25951 df-0p 25998 df-limc 26193 df-dv 26194 |
| This theorem is used by: ftc2 26371 itgsubstlem 26375 |
| Copyright terms: Public domain | W3C validator |