dvaddxx - Intuitionistic Logic Explorer

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

Theorem dvaddxx 14307

Description: The sum rule for derivatives at a point. For the (more general) relation version, see dvaddxxbr 14305. (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 7938	. . . . . 6 ⊢ ℂ ∈ V
3	2	a1i 9	. . . . 5 ⊢ (𝜑 → ℂ ∈ V)
4		addcl 7939	. . . . . . 7 ⊢ ((𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ) → (𝑢 + 𝑣) ∈ ℂ)
5	4	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → (𝑢 + 𝑣) ∈ ℂ)
6		dvadd.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑋⟶ℂ)
7		dvaddxx.g	. . . . . 6 ⊢ (𝜑 → 𝐺:𝑋⟶ℂ)
8		dvadd.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ⊆ 𝑆)
9	1, 8	ssexd 4145	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ V)
10		inidm 3346	. . . . . 6 ⊢ (𝑋 ∩ 𝑋) = 𝑋
11	5, 6, 7, 9, 9, 10	off 6098	. . . . 5 ⊢ (𝜑 → (𝐹 ∘_𝑓 + 𝐺):𝑋⟶ℂ)
12		elpm2r 6669	. . . . 5 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ ((𝐹 ∘_𝑓 + 𝐺):𝑋⟶ℂ ∧ 𝑋 ⊆ 𝑆)) → (𝐹 ∘_𝑓 + 𝐺) ∈ (ℂ ↑_pm 𝑆))
13	3, 1, 11, 8, 12	syl22anc 1239	. . . 4 ⊢ (𝜑 → (𝐹 ∘_𝑓 + 𝐺) ∈ (ℂ ↑_pm 𝑆))
14		dvfgg 14297	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ (𝐹 ∘_𝑓 + 𝐺) ∈ (ℂ ↑_pm 𝑆)) → (𝑆 D (𝐹 ∘_𝑓 + 𝐺)):dom (𝑆 D (𝐹 ∘_𝑓 + 𝐺))⟶ℂ)
15	1, 13, 14	syl2anc 411	. . 3 ⊢ (𝜑 → (𝑆 D (𝐹 ∘_𝑓 + 𝐺)):dom (𝑆 D (𝐹 ∘_𝑓 + 𝐺))⟶ℂ)
16	15	ffund 5371	. 2 ⊢ (𝜑 → Fun (𝑆 D (𝐹 ∘_𝑓 + 𝐺)))
17		recnprss 14296	. . . 4 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
18	1, 17	syl 14	. . 3 ⊢ (𝜑 → 𝑆 ⊆ ℂ)
19		dvadd.df	. . . 4 ⊢ (𝜑 → 𝐶 ∈ dom (𝑆 D 𝐹))
20		elpm2r 6669	. . . . . . 7 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (𝐹:𝑋⟶ℂ ∧ 𝑋 ⊆ 𝑆)) → 𝐹 ∈ (ℂ ↑_pm 𝑆))
21	3, 1, 6, 8, 20	syl22anc 1239	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑_pm 𝑆))
22		dvfgg 14297	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm 𝑆)) → (𝑆 D 𝐹):dom (𝑆 D 𝐹)⟶ℂ)
23	1, 21, 22	syl2anc 411	. . . . 5 ⊢ (𝜑 → (𝑆 D 𝐹):dom (𝑆 D 𝐹)⟶ℂ)
24		ffun 5370	. . . . 5 ⊢ ((𝑆 D 𝐹):dom (𝑆 D 𝐹)⟶ℂ → Fun (𝑆 D 𝐹))
25		funfvbrb 5632	. . . . 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 6669	. . . . . . 7 ⊢ (((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) ∧ (𝐺:𝑋⟶ℂ ∧ 𝑋 ⊆ 𝑆)) → 𝐺 ∈ (ℂ ↑_pm 𝑆))
30	3, 1, 7, 8, 29	syl22anc 1239	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ (ℂ ↑_pm 𝑆))
31		dvfgg 14297	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐺 ∈ (ℂ ↑_pm 𝑆)) → (𝑆 D 𝐺):dom (𝑆 D 𝐺)⟶ℂ)
32	1, 30, 31	syl2anc 411	. . . . 5 ⊢ (𝜑 → (𝑆 D 𝐺):dom (𝑆 D 𝐺)⟶ℂ)
33		ffun 5370	. . . . 5 ⊢ ((𝑆 D 𝐺):dom (𝑆 D 𝐺)⟶ℂ → Fun (𝑆 D 𝐺))
34		funfvbrb 5632	. . . . 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 2177	. . 3 ⊢ (MetOpen‘(abs ∘ − )) = (MetOpen‘(abs ∘ − ))
38	6, 8, 7, 18, 27, 36, 37	dvaddxxbr 14305	. 2 ⊢ (𝜑 → 𝐶(𝑆 D (𝐹 ∘_𝑓 + 𝐺))(((𝑆 D 𝐹)‘𝐶) + ((𝑆 D 𝐺)‘𝐶)))
39		funbrfv 5557	. 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

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 Vcvv 2739 ⊆ wss 3131 {cpr 3595 class class class wbr 4005 dom cdm 4628 ∘ ccom 4632 Fun wfun 5212 ⟶wf 5214 ‘cfv 5218 (class class class)co 5878 ∘_𝑓 cof 6084 ↑_pm cpm 6652 ℂcc 7812 ℝcr 7813 + caddc 7817 − cmin 8131 abscabs 11009 MetOpencmopn 13585 D cdv 14264

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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-iinf 4589 ax-cnex 7905 ax-resscn 7906 ax-1cn 7907 ax-1re 7908 ax-icn 7909 ax-addcl 7910 ax-addrcl 7911 ax-mulcl 7912 ax-mulrcl 7913 ax-addcom 7914 ax-mulcom 7915 ax-addass 7916 ax-mulass 7917 ax-distr 7918 ax-i2m1 7919 ax-0lt1 7920 ax-1rid 7921 ax-0id 7922 ax-rnegex 7923 ax-precex 7924 ax-cnre 7925 ax-pre-ltirr 7926 ax-pre-ltwlin 7927 ax-pre-lttrn 7928 ax-pre-apti 7929 ax-pre-ltadd 7930 ax-pre-mulgt0 7931 ax-pre-mulext 7932 ax-arch 7933 ax-caucvg 7934 ax-addf 7936

This theorem depends on definitions: df-bi 117 df-stab 831 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-if 3537 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-id 4295 df-po 4298 df-iso 4299 df-iord 4368 df-on 4370 df-ilim 4371 df-suc 4373 df-iom 4592 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-isom 5227 df-riota 5834 df-ov 5881 df-oprab 5882 df-mpo 5883 df-of 6086 df-1st 6144 df-2nd 6145 df-recs 6309 df-frec 6395 df-map 6653 df-pm 6654 df-sup 6986 df-inf 6987 df-pnf 7997 df-mnf 7998 df-xr 7999 df-ltxr 8000 df-le 8001 df-sub 8133 df-neg 8134 df-reap 8535 df-ap 8542 df-div 8633 df-inn 8923 df-2 8981 df-3 8982 df-4 8983 df-n0 9180 df-z 9257 df-uz 9532 df-q 9623 df-rp 9657 df-xneg 9775 df-xadd 9776 df-seqfrec 10449 df-exp 10523 df-cj 10854 df-re 10855 df-im 10856 df-rsqrt 11010 df-abs 11011 df-rest 12696 df-topgen 12715 df-psmet 13587 df-xmet 13588 df-met 13589 df-bl 13590 df-mopn 13591 df-top 13638 df-topon 13651 df-bases 13683 df-ntr 13736 df-cn 13828 df-cnp 13829 df-tx 13893 df-limced 14265 df-dvap 14266

This theorem is referenced by: dviaddf 14309

W3C validator