dvaddxx - Intuitionistic Logic Explorer

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

Theorem dvaddxx 15895

Description: The sum rule for derivatives at a point. For the (more general) relation version, see dvaddxxbr 15893. (Contributed by Mario Carneiro, 9-Aug-2014.) (Revised by Jim Kingdon, 25-Nov-2023.)

**Hypotheses**
Ref	Expression
dvadd.f	⊢ (𝜑 → 𝐹:𝑋⟶ℂ)
dvadd.x	⊢ (𝜑 → 𝑋 ⊆ 𝑆)
dvaddxx.g	⊢ (𝜑 → 𝐺:𝑋⟶ℂ)
dvadd.s	⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
dvadd.df	⊢ (𝜑 → 𝐶 ∈ dom (𝑆 D 𝐹))
dvadd.dg	⊢ (𝜑 → 𝐶 ∈ dom (𝑆 D 𝐺))

**Assertion**
Ref	Expression
dvaddxx	⊢ (𝜑 → ((𝑆 D (𝐹 ∘_𝑓 + 𝐺))‘𝐶) = (((𝑆 D 𝐹)‘𝐶) + ((𝑆 D 𝐺)‘𝐶)))

Proof of Theorem dvaddxx Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dvadd.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
2		cnex 8304	. . . . . 6 ⊢ ℂ ∈ V
3	2	a1i 9	. . . . 5 ⊢ (𝜑 → ℂ ∈ V)
4		addcl 8305	. . . . . . 7 ⊢ ((𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ) → (𝑢 + 𝑣) ∈ ℂ)
5	4	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → (𝑢 + 𝑣) ∈ ℂ)
6		dvadd.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑋⟶ℂ)
7		dvaddxx.g	. . . . . 6 ⊢ (𝜑 → 𝐺:𝑋⟶ℂ)
8		dvadd.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ⊆ 𝑆)
9	1, 8	ssexd 4273	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ V)
10		inidm 3440	. . . . . 6 ⊢ (𝑋 ∩ 𝑋) = 𝑋
11	5, 6, 7, 9, 9, 10	off 6315	. . . . 5 ⊢ (𝜑 → (𝐹 ∘_𝑓 + 𝐺):𝑋⟶ℂ)
12		elpm2r 6940	. . . . 5 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ ((𝐹 ∘_𝑓 + 𝐺):𝑋⟶ℂ ∧ 𝑋 ⊆ 𝑆)) → (𝐹 ∘_𝑓 + 𝐺) ∈ (ℂ ↑_pm 𝑆))
13	3, 1, 11, 8, 12	syl22anc 1279	. . . 4 ⊢ (𝜑 → (𝐹 ∘_𝑓 + 𝐺) ∈ (ℂ ↑_pm 𝑆))
14		dvfgg 15880	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ (𝐹 ∘_𝑓 + 𝐺) ∈ (ℂ ↑_pm 𝑆)) → (𝑆 D (𝐹 ∘_𝑓 + 𝐺)):dom (𝑆 D (𝐹 ∘_𝑓 + 𝐺))⟶ℂ)
15	1, 13, 14	syl2anc 415	. . 3 ⊢ (𝜑 → (𝑆 D (𝐹 ∘_𝑓 + 𝐺)):dom (𝑆 D (𝐹 ∘_𝑓 + 𝐺))⟶ℂ)
16	15	ffund 5537	. 2 ⊢ (𝜑 → Fun (𝑆 D (𝐹 ∘_𝑓 + 𝐺)))
17		recnprss 15879	. . . 4 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
18	1, 17	syl 14	. . 3 ⊢ (𝜑 → 𝑆 ⊆ ℂ)
19		dvadd.df	. . . 4 ⊢ (𝜑 → 𝐶 ∈ dom (𝑆 D 𝐹))
20		elpm2r 6940	. . . . . . 7 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (𝐹:𝑋⟶ℂ ∧ 𝑋 ⊆ 𝑆)) → 𝐹 ∈ (ℂ ↑_pm 𝑆))
21	3, 1, 6, 8, 20	syl22anc 1279	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑_pm 𝑆))
22		dvfgg 15880	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆)) → (𝑆 D 𝐹):dom (𝑆 D 𝐹)⟶ℂ)
23	1, 21, 22	syl2anc 415	. . . . 5 ⊢ (𝜑 → (𝑆 D 𝐹):dom (𝑆 D 𝐹)⟶ℂ)
24		ffun 5536	. . . . 5 ⊢ ((𝑆 D 𝐹):dom (𝑆 D 𝐹)⟶ℂ → Fun (𝑆 D 𝐹))
25		funfvbrb 5822	. . . . 5 ⊢ (Fun (𝑆 D 𝐹) → (𝐶 ∈ dom (𝑆 D 𝐹) ↔ 𝐶(𝑆 D 𝐹)((𝑆 D 𝐹)‘𝐶)))
26	23, 24, 25	3syl 17	. . . 4 ⊢ (𝜑 → (𝐶 ∈ dom (𝑆 D 𝐹) ↔ 𝐶(𝑆 D 𝐹)((𝑆 D 𝐹)‘𝐶)))
27	19, 26	mpbid 147	. . 3 ⊢ (𝜑 → 𝐶(𝑆 D 𝐹)((𝑆 D 𝐹)‘𝐶))
28		dvadd.dg	. . . 4 ⊢ (𝜑 → 𝐶 ∈ dom (𝑆 D 𝐺))
29		elpm2r 6940	. . . . . . 7 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (𝐺:𝑋⟶ℂ ∧ 𝑋 ⊆ 𝑆)) → 𝐺 ∈ (ℂ ↑_pm 𝑆))
30	3, 1, 7, 8, 29	syl22anc 1279	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ (ℂ ↑_pm 𝑆))
31		dvfgg 15880	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐺 ∈ (ℂ ↑_pm 𝑆)) → (𝑆 D 𝐺):dom (𝑆 D 𝐺)⟶ℂ)
32	1, 30, 31	syl2anc 415	. . . . 5 ⊢ (𝜑 → (𝑆 D 𝐺):dom (𝑆 D 𝐺)⟶ℂ)
33		ffun 5536	. . . . 5 ⊢ ((𝑆 D 𝐺):dom (𝑆 D 𝐺)⟶ℂ → Fun (𝑆 D 𝐺))
34		funfvbrb 5822	. . . . 5 ⊢ (Fun (𝑆 D 𝐺) → (𝐶 ∈ dom (𝑆 D 𝐺) ↔ 𝐶(𝑆 D 𝐺)((𝑆 D 𝐺)‘𝐶)))
35	32, 33, 34	3syl 17	. . . 4 ⊢ (𝜑 → (𝐶 ∈ dom (𝑆 D 𝐺) ↔ 𝐶(𝑆 D 𝐺)((𝑆 D 𝐺)‘𝐶)))
36	28, 35	mpbid 147	. . 3 ⊢ (𝜑 → 𝐶(𝑆 D 𝐺)((𝑆 D 𝐺)‘𝐶))
37		eqid 2238	. . 3 ⊢ (MetOpen‘(abs ∘ − )) = (MetOpen‘(abs ∘ − ))
38	6, 8, 7, 18, 27, 36, 37	dvaddxxbr 15893	. 2 ⊢ (𝜑 → 𝐶(𝑆 D (𝐹 ∘_𝑓 + 𝐺))(((𝑆 D 𝐹)‘𝐶) + ((𝑆 D 𝐺)‘𝐶)))
39		funbrfv 5739	. 2 ⊢ (Fun (𝑆 D (𝐹 ∘_𝑓 + 𝐺)) → (𝐶(𝑆 D (𝐹 ∘_𝑓 + 𝐺))(((𝑆 D 𝐹)‘𝐶) + ((𝑆 D 𝐺)‘𝐶)) → ((𝑆 D (𝐹 ∘_𝑓 + 𝐺))‘𝐶) = (((𝑆 D 𝐹)‘𝐶) + ((𝑆 D 𝐺)‘𝐶))))
40	16, 38, 39	sylc 62	1 ⊢ (𝜑 → ((𝑆 D (𝐹 ∘_𝑓 + 𝐺))‘𝐶) = (((𝑆 D 𝐹)‘𝐶) + ((𝑆 D 𝐺)‘𝐶)))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ⊆ wss 3220 {cpr 3710 class class class wbr 4130 dom cdm 4774 ∘ ccom 4778 Fun wfun 5371 ⟶wf 5373 ‘cfv 5377 (class class class)co 6085 ∘_𝑓 cof 6300 ↑_pm cpm 6923 ℂcc 8178 ℝcr 8179 + caddc 8183 − cmin 8499 abscabs 11779 MetOpencmopn 14962 D cdv 15847

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 ax-arch 8299 ax-caucvg 8300 ax-addf 8302

This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-isom 5386 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-of 6302 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-map 6924 df-pm 6925 df-sup 7325 df-inf 7326 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-n0 9569 df-z 9650 df-uz 9932 df-q 10030 df-rp 10066 df-xneg 10185 df-xadd 10186 df-seqfrec 10900 df-exp 10991 df-cj 11623 df-re 11624 df-im 11625 df-rsqrt 11780 df-abs 11781 df-rest 13648 df-topgen 13667 df-psmet 14964 df-xmet 14965 df-met 14966 df-bl 14967 df-mopn 14968 df-top 15190 df-topon 15203 df-bases 15235 df-ntr 15288 df-cn 15380 df-cnp 15381 df-tx 15445 df-limced 15848 df-dvap 15849

This theorem is used by: dviaddf 15897

W3C validator