| 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 26009 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 25868 | . . . . 5 ⊢ (ℝ D 𝐺):dom (ℝ D 𝐺)⟶ℂ | |
| 2 | 1 | a1i 11 | . . . 4 ⊢ (𝜑 → (ℝ D 𝐺):dom (ℝ D 𝐺)⟶ℂ) |
| 3 | 2 | ffund 6667 | . . 3 ⊢ (𝜑 → Fun (ℝ D 𝐺)) |
| 4 | ax-resscn 11087 | . . . . . . 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 3958 | . . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐵)) | |
| 11 | ioossre 13327 | . . . . . . . 8 ⊢ (𝐴(,)𝐵) ⊆ ℝ | |
| 12 | 11 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ) |
| 13 | ftc1cn.i | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝐿1) | |
| 14 | ftc1cn.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ)) | |
| 15 | cncff 24846 | . . . . . . . 8 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ) → 𝐹:(𝐴(,)𝐵)⟶ℂ) | |
| 16 | 14, 15 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ) |
| 17 | 6, 7, 8, 9, 10, 12, 13, 16 | ftc1lem2 26003 | . . . . . 6 ⊢ (𝜑 → 𝐺:(𝐴[,]𝐵)⟶ℂ) |
| 18 | iccssre 13349 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ) | |
| 19 | 7, 8, 18 | syl2anc 585 | . . . . . 6 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ) |
| 20 | tgioo4 24753 | . . . . . 6 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂfld) ↾t ℝ) | |
| 21 | eqid 2737 | . . . . . 6 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 22 | 5, 17, 19, 20, 21 | dvbssntr 25861 | . . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐺) ⊆ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))) |
| 23 | iccntr 24770 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵)) | |
| 24 | 7, 8, 23 | syl2anc 585 | . . . . 5 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵)) |
| 25 | 22, 24 | sseqtrd 3971 | . . . 4 ⊢ (𝜑 → dom (ℝ D 𝐺) ⊆ (𝐴(,)𝐵)) |
| 26 | 7 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ) |
| 27 | 8 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ) |
| 28 | 9 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐴 ≤ 𝐵) |
| 29 | ssidd 3958 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐵)) | |
| 30 | 11 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ ℝ) |
| 31 | 13 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ 𝐿1) |
| 32 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ (𝐴(,)𝐵)) | |
| 33 | 11, 4 | sstri 3944 | . . . . . . . . . 10 ⊢ (𝐴(,)𝐵) ⊆ ℂ |
| 34 | ssid 3957 | . . . . . . . . . 10 ⊢ ℂ ⊆ ℂ | |
| 35 | eqid 2737 | . . . . . . . . . . 11 ⊢ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) = ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) | |
| 36 | 21 | cnfldtopon 24730 | . . . . . . . . . . . 12 ⊢ (TopOpen‘ℂfld) ∈ (TopOn‘ℂ) |
| 37 | 36 | toponrestid 22869 | . . . . . . . . . . 11 ⊢ (TopOpen‘ℂfld) = ((TopOpen‘ℂfld) ↾t ℂ) |
| 38 | 21, 35, 37 | cncfcn 24863 | . . . . . . . . . 10 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld))) |
| 39 | 33, 34, 38 | mp2an 693 | . . . . . . . . 9 ⊢ ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld)) |
| 40 | 14, 39 | eleqtrdi 2847 | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld))) |
| 41 | 40 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld))) |
| 42 | 33 | a1i 11 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ) |
| 43 | resttopon 23109 | . . . . . . . . . . 11 ⊢ (((TopOpen‘ℂfld) ∈ (TopOn‘ℂ) ∧ (𝐴(,)𝐵) ⊆ ℂ) → ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))) | |
| 44 | 36, 42, 43 | sylancr 588 | . . . . . . . . . 10 ⊢ (𝜑 → ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))) |
| 45 | toponuni 22862 | . . . . . . . . . 10 ⊢ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)) → (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) | |
| 46 | 44, 45 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) |
| 47 | 46 | eleq2d 2823 | . . . . . . . 8 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↔ 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)))) |
| 48 | 47 | biimpa 476 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) |
| 49 | eqid 2737 | . . . . . . . 8 ⊢ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) = ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) | |
| 50 | 49 | cncnpi 23226 | . . . . . . 7 ⊢ ((𝐹 ∈ (((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) Cn (TopOpen‘ℂfld)) ∧ 𝑦 ∈ ∪ ((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵))) → 𝐹 ∈ ((((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) CnP (TopOpen‘ℂfld))‘𝑦)) |
| 51 | 41, 48, 50 | syl2anc 585 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ ((((TopOpen‘ℂfld) ↾t (𝐴(,)𝐵)) CnP (TopOpen‘ℂfld))‘𝑦)) |
| 52 | 6, 26, 27, 28, 29, 30, 31, 32, 51, 20, 35, 21 | ftc1 26009 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦(ℝ D 𝐺)(𝐹‘𝑦)) |
| 53 | vex 3445 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 54 | fvex 6848 | . . . . . 6 ⊢ (𝐹‘𝑦) ∈ V | |
| 55 | 53, 54 | breldm 5858 | . . . . 5 ⊢ (𝑦(ℝ D 𝐺)(𝐹‘𝑦) → 𝑦 ∈ dom (ℝ D 𝐺)) |
| 56 | 52, 55 | syl 17 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ dom (ℝ D 𝐺)) |
| 57 | 25, 56 | eqelssd 3956 | . . 3 ⊢ (𝜑 → dom (ℝ D 𝐺) = (𝐴(,)𝐵)) |
| 58 | df-fn 6496 | . . 3 ⊢ ((ℝ D 𝐺) Fn (𝐴(,)𝐵) ↔ (Fun (ℝ D 𝐺) ∧ dom (ℝ D 𝐺) = (𝐴(,)𝐵))) | |
| 59 | 3, 57, 58 | sylanbrc 584 | . 2 ⊢ (𝜑 → (ℝ D 𝐺) Fn (𝐴(,)𝐵)) |
| 60 | 16 | ffnd 6664 | . 2 ⊢ (𝜑 → 𝐹 Fn (𝐴(,)𝐵)) |
| 61 | 3 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → Fun (ℝ D 𝐺)) |
| 62 | funbrfv 6883 | . . 3 ⊢ (Fun (ℝ D 𝐺) → (𝑦(ℝ D 𝐺)(𝐹‘𝑦) → ((ℝ D 𝐺)‘𝑦) = (𝐹‘𝑦))) | |
| 63 | 61, 52, 62 | sylc 65 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((ℝ D 𝐺)‘𝑦) = (𝐹‘𝑦)) |
| 64 | 59, 60, 63 | eqfnfvd 6981 | 1 ⊢ (𝜑 → (ℝ D 𝐺) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ⊆ wss 3902 ∪ cuni 4864 class class class wbr 5099 ↦ cmpt 5180 dom cdm 5625 ran crn 5626 Fun wfun 6487 Fn wfn 6488 ⟶wf 6489 ‘cfv 6493 (class class class)co 7360 ℂcc 11028 ℝcr 11029 ≤ cle 11171 (,)cioo 13265 [,]cicc 13268 ↾t crest 17344 TopOpenctopn 17345 topGenctg 17361 ℂfldccnfld 21313 TopOnctopon 22858 intcnt 22965 Cn ccn 23172 CnP ccnp 23173 –cn→ccncf 24829 𝐿1cibl 25578 ∫citg 25579 D cdv 25824 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-inf2 9554 ax-cc 10349 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 ax-pre-sup 11108 ax-addf 11109 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-symdif 4206 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-iin 4950 df-disj 5067 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 df-ofr 7625 df-om 7811 df-1st 7935 df-2nd 7936 df-supp 8105 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-omul 8404 df-er 8637 df-map 8769 df-pm 8770 df-ixp 8840 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fsupp 9269 df-fi 9318 df-sup 9349 df-inf 9350 df-oi 9419 df-dju 9817 df-card 9855 df-acn 9858 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 12150 df-2 12212 df-3 12213 df-4 12214 df-5 12215 df-6 12216 df-7 12217 df-8 12218 df-9 12219 df-n0 12406 df-z 12493 df-dec 12612 df-uz 12756 df-q 12866 df-rp 12910 df-xneg 13030 df-xadd 13031 df-xmul 13032 df-ioo 13269 df-ioc 13270 df-ico 13271 df-icc 13272 df-fz 13428 df-fzo 13575 df-fl 13716 df-mod 13794 df-seq 13929 df-exp 13989 df-hash 14258 df-cj 15026 df-re 15027 df-im 15028 df-sqrt 15162 df-abs 15163 df-clim 15415 df-rlim 15416 df-sum 15614 df-struct 17078 df-sets 17095 df-slot 17113 df-ndx 17125 df-base 17141 df-ress 17162 df-plusg 17194 df-mulr 17195 df-starv 17196 df-sca 17197 df-vsca 17198 df-ip 17199 df-tset 17200 df-ple 17201 df-ds 17203 df-unif 17204 df-hom 17205 df-cco 17206 df-rest 17346 df-topn 17347 df-0g 17365 df-gsum 17366 df-topgen 17367 df-pt 17368 df-prds 17371 df-xrs 17427 df-qtop 17432 df-imas 17433 df-xps 17435 df-mre 17509 df-mrc 17510 df-acs 17512 df-mgm 18569 df-sgrp 18648 df-mnd 18664 df-submnd 18713 df-mulg 19002 df-cntz 19250 df-cmn 19715 df-psmet 21305 df-xmet 21306 df-met 21307 df-bl 21308 df-mopn 21309 df-fbas 21310 df-fg 21311 df-cnfld 21314 df-top 22842 df-topon 22859 df-topsp 22881 df-bases 22894 df-cld 22967 df-ntr 22968 df-cls 22969 df-nei 23046 df-lp 23084 df-perf 23085 df-cn 23175 df-cnp 23176 df-haus 23263 df-cmp 23335 df-tx 23510 df-hmeo 23703 df-fil 23794 df-fm 23886 df-flim 23887 df-flf 23888 df-xms 24268 df-ms 24269 df-tms 24270 df-cncf 24831 df-ovol 25425 df-vol 25426 df-mbf 25580 df-itg1 25581 df-itg2 25582 df-ibl 25583 df-itg 25584 df-0p 25631 df-limc 25827 df-dv 25828 |
| This theorem is referenced by: ftc2 26011 itgsubstlem 26015 |
| Copyright terms: Public domain | W3C validator |