![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eldvap | GIF version |
Description: The differentiable predicate. A function 𝐹 is differentiable at 𝐵 with derivative 𝐶 iff 𝐹 is defined in a neighborhood of 𝐵 and the difference quotient has limit 𝐶 at 𝐵. (Contributed by Mario Carneiro, 7-Aug-2014.) (Revised by Jim Kingdon, 27-Jun-2023.) |
Ref | Expression |
---|---|
dvval.t | ⊢ 𝑇 = (𝐾 ↾t 𝑆) |
dvval.k | ⊢ 𝐾 = (MetOpen‘(abs ∘ − )) |
eldvap.g | ⊢ 𝐺 = (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝐵} ↦ (((𝐹‘𝑧) − (𝐹‘𝐵)) / (𝑧 − 𝐵))) |
eldv.s | ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
eldv.f | ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
eldv.a | ⊢ (𝜑 → 𝐴 ⊆ 𝑆) |
Ref | Expression |
---|---|
eldvap | ⊢ (𝜑 → (𝐵(𝑆 D 𝐹)𝐶 ↔ (𝐵 ∈ ((int‘𝑇)‘𝐴) ∧ 𝐶 ∈ (𝐺 limℂ 𝐵)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eldv.s | . . . . 5 ⊢ (𝜑 → 𝑆 ⊆ ℂ) | |
2 | eldv.f | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) | |
3 | eldv.a | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ 𝑆) | |
4 | dvval.t | . . . . . 6 ⊢ 𝑇 = (𝐾 ↾t 𝑆) | |
5 | dvval.k | . . . . . 6 ⊢ 𝐾 = (MetOpen‘(abs ∘ − )) | |
6 | 4, 5 | dvfvalap 14835 | . . . . 5 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) → ((𝑆 D 𝐹) = ∪ 𝑥 ∈ ((int‘𝑇)‘𝐴)({𝑥} × ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ∧ (𝑆 D 𝐹) ⊆ (((int‘𝑇)‘𝐴) × ℂ))) |
7 | 1, 2, 3, 6 | syl3anc 1249 | . . . 4 ⊢ (𝜑 → ((𝑆 D 𝐹) = ∪ 𝑥 ∈ ((int‘𝑇)‘𝐴)({𝑥} × ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ∧ (𝑆 D 𝐹) ⊆ (((int‘𝑇)‘𝐴) × ℂ))) |
8 | 7 | simpld 112 | . . 3 ⊢ (𝜑 → (𝑆 D 𝐹) = ∪ 𝑥 ∈ ((int‘𝑇)‘𝐴)({𝑥} × ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥))) |
9 | 8 | eleq2d 2263 | . 2 ⊢ (𝜑 → (〈𝐵, 𝐶〉 ∈ (𝑆 D 𝐹) ↔ 〈𝐵, 𝐶〉 ∈ ∪ 𝑥 ∈ ((int‘𝑇)‘𝐴)({𝑥} × ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)))) |
10 | df-br 4030 | . . 3 ⊢ (𝐵(𝑆 D 𝐹)𝐶 ↔ 〈𝐵, 𝐶〉 ∈ (𝑆 D 𝐹)) | |
11 | 10 | bicomi 132 | . 2 ⊢ (〈𝐵, 𝐶〉 ∈ (𝑆 D 𝐹) ↔ 𝐵(𝑆 D 𝐹)𝐶) |
12 | breq2 4033 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑤 # 𝑥 ↔ 𝑤 # 𝐵)) | |
13 | 12 | rabbidv 2749 | . . . . . 6 ⊢ (𝑥 = 𝐵 → {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} = {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝐵}) |
14 | fveq2 5554 | . . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵)) | |
15 | 14 | oveq2d 5934 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → ((𝐹‘𝑧) − (𝐹‘𝑥)) = ((𝐹‘𝑧) − (𝐹‘𝐵))) |
16 | oveq2 5926 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑧 − 𝑥) = (𝑧 − 𝐵)) | |
17 | 15, 16 | oveq12d 5936 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥)) = (((𝐹‘𝑧) − (𝐹‘𝐵)) / (𝑧 − 𝐵))) |
18 | 13, 17 | mpteq12dv 4111 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) = (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝐵} ↦ (((𝐹‘𝑧) − (𝐹‘𝐵)) / (𝑧 − 𝐵)))) |
19 | eldvap.g | . . . . 5 ⊢ 𝐺 = (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝐵} ↦ (((𝐹‘𝑧) − (𝐹‘𝐵)) / (𝑧 − 𝐵))) | |
20 | 18, 19 | eqtr4di 2244 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) = 𝐺) |
21 | id 19 | . . . 4 ⊢ (𝑥 = 𝐵 → 𝑥 = 𝐵) | |
22 | 20, 21 | oveq12d 5936 | . . 3 ⊢ (𝑥 = 𝐵 → ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥) = (𝐺 limℂ 𝐵)) |
23 | 22 | opeliunxp2 4802 | . 2 ⊢ (〈𝐵, 𝐶〉 ∈ ∪ 𝑥 ∈ ((int‘𝑇)‘𝐴)({𝑥} × ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ↔ (𝐵 ∈ ((int‘𝑇)‘𝐴) ∧ 𝐶 ∈ (𝐺 limℂ 𝐵))) |
24 | 9, 11, 23 | 3bitr3g 222 | 1 ⊢ (𝜑 → (𝐵(𝑆 D 𝐹)𝐶 ↔ (𝐵 ∈ ((int‘𝑇)‘𝐴) ∧ 𝐶 ∈ (𝐺 limℂ 𝐵)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 {crab 2476 ⊆ wss 3153 {csn 3618 〈cop 3621 ∪ ciun 3912 class class class wbr 4029 ↦ cmpt 4090 × cxp 4657 ∘ ccom 4663 ⟶wf 5250 ‘cfv 5254 (class class class)co 5918 ℂcc 7870 − cmin 8190 # cap 8600 / cdiv 8691 abscabs 11141 ↾t crest 12850 MetOpencmopn 14037 intcnt 14261 limℂ climc 14808 D cdv 14809 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-iinf 4620 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-mulrcl 7971 ax-addcom 7972 ax-mulcom 7973 ax-addass 7974 ax-mulass 7975 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-1rid 7979 ax-0id 7980 ax-rnegex 7981 ax-precex 7982 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 ax-pre-mulgt0 7989 ax-pre-mulext 7990 ax-arch 7991 ax-caucvg 7992 |
This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4324 df-po 4327 df-iso 4328 df-iord 4397 df-on 4399 df-ilim 4400 df-suc 4402 df-iom 4623 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-isom 5263 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-recs 6358 df-frec 6444 df-map 6704 df-pm 6705 df-sup 7043 df-inf 7044 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-reap 8594 df-ap 8601 df-div 8692 df-inn 8983 df-2 9041 df-3 9042 df-4 9043 df-n0 9241 df-z 9318 df-uz 9593 df-q 9685 df-rp 9720 df-xneg 9838 df-xadd 9839 df-seqfrec 10519 df-exp 10610 df-cj 10986 df-re 10987 df-im 10988 df-rsqrt 11142 df-abs 11143 df-rest 12852 df-topgen 12871 df-psmet 14039 df-xmet 14040 df-met 14041 df-bl 14042 df-mopn 14043 df-top 14166 df-topon 14179 df-bases 14211 df-ntr 14264 df-limced 14810 df-dvap 14811 |
This theorem is referenced by: dvcl 14837 dvfgg 14842 dvidlemap 14845 dvcnp2cntop 14848 dvaddxxbr 14850 dvmulxxbr 14851 dvcoapbr 14856 dvcjbr 14857 dvrecap 14862 dveflem 14872 |
Copyright terms: Public domain | W3C validator |