eldvap - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > eldvap		GIF version

Theorem eldvap 15396

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.)

**Hypotheses**
Ref	Expression
dvval.t	⊢ 𝑇 = (𝐾 ↾_t 𝑆)
dvval.k	⊢ 𝐾 = (MetOpen‘(abs ∘ − ))
eldvap.g	⊢ 𝐺 = (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝐵} ↦ (((𝐹‘𝑧) − (𝐹‘𝐵)) / (𝑧 − 𝐵)))
eldv.s	⊢ (𝜑 → 𝑆 ⊆ ℂ)
eldv.f	⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
eldv.a	⊢ (𝜑 → 𝐴 ⊆ 𝑆)

**Assertion**
Ref	Expression
eldvap	⊢ (𝜑 → (𝐵(𝑆 D 𝐹)𝐶 ↔ (𝐵 ∈ ((int‘𝑇)‘𝐴) ∧ 𝐶 ∈ (𝐺 lim_ℂ 𝐵))))

Distinct variable groups: 𝑤,𝐴,𝑧 𝑤,𝐹,𝑧 𝑤,𝑆,𝑧 𝑧,𝐵,𝑤 Allowed substitution hints: 𝜑(𝑧,𝑤) 𝐶(𝑧,𝑤) 𝑇(𝑧,𝑤) 𝐺(𝑧,𝑤) 𝐾(𝑧,𝑤)

Proof of Theorem eldvap Dummy variable 𝑥 is distinct from all other variables.

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 15395	. . . . 5 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) → ((𝑆 D 𝐹) = ∪ 𝑥 ∈ ((int‘𝑇)‘𝐴)({𝑥} × ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) lim_ℂ 𝑥)) ∧ (𝑆 D 𝐹) ⊆ (((int‘𝑇)‘𝐴) × ℂ)))
7	1, 2, 3, 6	syl3anc 1271	. . . 4 ⊢ (𝜑 → ((𝑆 D 𝐹) = ∪ 𝑥 ∈ ((int‘𝑇)‘𝐴)({𝑥} × ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) lim_ℂ 𝑥)) ∧ (𝑆 D 𝐹) ⊆ (((int‘𝑇)‘𝐴) × ℂ)))
8	7	simpld 112	. . 3 ⊢ (𝜑 → (𝑆 D 𝐹) = ∪ 𝑥 ∈ ((int‘𝑇)‘𝐴)({𝑥} × ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) lim_ℂ 𝑥)))
9	8	eleq2d 2299	. 2 ⊢ (𝜑 → (⟨𝐵, 𝐶⟩ ∈ (𝑆 D 𝐹) ↔ ⟨𝐵, 𝐶⟩ ∈ ∪ 𝑥 ∈ ((int‘𝑇)‘𝐴)({𝑥} × ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) lim_ℂ 𝑥))))
10		df-br 4087	. . 3 ⊢ (𝐵(𝑆 D 𝐹)𝐶 ↔ ⟨𝐵, 𝐶⟩ ∈ (𝑆 D 𝐹))
11	10	bicomi 132	. 2 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝑆 D 𝐹) ↔ 𝐵(𝑆 D 𝐹)𝐶)
12		breq2 4090	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑤 # 𝑥 ↔ 𝑤 # 𝐵))
13	12	rabbidv 2789	. . . . . 6 ⊢ (𝑥 = 𝐵 → {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} = {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝐵})
14		fveq2 5635	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵))
15	14	oveq2d 6029	. . . . . . 7 ⊢ (𝑥 = 𝐵 → ((𝐹‘𝑧) − (𝐹‘𝑥)) = ((𝐹‘𝑧) − (𝐹‘𝐵)))
16		oveq2 6021	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑧 − 𝑥) = (𝑧 − 𝐵))
17	15, 16	oveq12d 6031	. . . . . 6 ⊢ (𝑥 = 𝐵 → (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥)) = (((𝐹‘𝑧) − (𝐹‘𝐵)) / (𝑧 − 𝐵)))
18	13, 17	mpteq12dv 4169	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) = (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝐵} ↦ (((𝐹‘𝑧) − (𝐹‘𝐵)) / (𝑧 − 𝐵))))
19		eldvap.g	. . . . 5 ⊢ 𝐺 = (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝐵} ↦ (((𝐹‘𝑧) − (𝐹‘𝐵)) / (𝑧 − 𝐵)))
20	18, 19	eqtr4di 2280	. . . 4 ⊢ (𝑥 = 𝐵 → (𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) = 𝐺)
21		id 19	. . . 4 ⊢ (𝑥 = 𝐵 → 𝑥 = 𝐵)
22	20, 21	oveq12d 6031	. . 3 ⊢ (𝑥 = 𝐵 → ((𝑧 ∈ {𝑤 ∈ 𝐴 ∣ 𝑤 # 𝑥} ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) lim_ℂ 𝑥) = (𝐺 lim_ℂ 𝐵))
23	22	opeliunxp2 4868	. 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 1395 ∈ wcel 2200 {crab 2512 ⊆ wss 3198 {csn 3667 ⟨cop 3670 ∪ ciun 3968 class class class wbr 4086 ↦ cmpt 4148 × cxp 4721 ∘ ccom 4727 ⟶wf 5320 ‘cfv 5324 (class class class)co 6013 ℂcc 8020 − cmin 8340 # cap 8751 / cdiv 8842 abscabs 11548 ↾_t crest 13312 MetOpencmopn 14545 intcnt 14807 lim_ℂ climc 15368 D cdv 15369

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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-mulrcl 8121 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-precex 8132 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 ax-pre-mulgt0 8139 ax-pre-mulext 8140 ax-arch 8141 ax-caucvg 8142

This theorem depends on definitions: df-bi 117 df-stab 836 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-isom 5333 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-map 6814 df-pm 6815 df-sup 7174 df-inf 7175 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-reap 8745 df-ap 8752 df-div 8843 df-inn 9134 df-2 9192 df-3 9193 df-4 9194 df-n0 9393 df-z 9470 df-uz 9746 df-q 9844 df-rp 9879 df-xneg 9997 df-xadd 9998 df-seqfrec 10700 df-exp 10791 df-cj 11393 df-re 11394 df-im 11395 df-rsqrt 11549 df-abs 11550 df-rest 13314 df-topgen 13333 df-psmet 14547 df-xmet 14548 df-met 14549 df-bl 14550 df-mopn 14551 df-top 14712 df-topon 14725 df-bases 14757 df-ntr 14810 df-limced 15370 df-dvap 15371

This theorem is referenced by: dvcl 15397 dvfgg 15402 dvidlemap 15405 dvidrelem 15406 dvidsslem 15407 dvcnp2cntop 15413 dvaddxxbr 15415 dvmulxxbr 15416 dvcoapbr 15421 dvcjbr 15422 dvrecap 15427 dveflem 15440

W3C validator