dvmptmulx - Intuitionistic Logic Explorer

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

Theorem dvmptmulx 15946

Description: Function-builder for derivative, product rule. (Contributed by Mario Carneiro, 1-Sep-2014.) (Revised by Mario Carneiro, 11-Feb-2015.)

**Hypotheses**
Ref	Expression
dvmptadd.s	⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
dvmptadd.a	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ ℂ)
dvmptadd.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑉)
dvmptadd.da	⊢ (𝜑 → (𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐴)) = (𝑥 ∈ 𝑋 ↦ 𝐵))
dvmptclx.ss	⊢ (𝜑 → 𝑋 ⊆ 𝑆)
dvmptadd.c	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐶 ∈ ℂ)
dvmptadd.d	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐷 ∈ 𝑊)
dvmptadd.dc	⊢ (𝜑 → (𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐶)) = (𝑥 ∈ 𝑋 ↦ 𝐷))

**Assertion**
Ref	Expression
dvmptmulx	⊢ (𝜑 → (𝑆 D (𝑥 ∈ 𝑋 ↦ (𝐴 · 𝐶))) = (𝑥 ∈ 𝑋 ↦ ((𝐵 · 𝐶) + (𝐷 · 𝐴))))

Distinct variable groups: 𝜑,𝑥 𝑥,𝑆 𝑥,𝑉 𝑥,𝑊 𝑥,𝑋 Allowed substitution hints: 𝐴(𝑥) 𝐵(𝑥) 𝐶(𝑥) 𝐷(𝑥)

**Proof of Theorem dvmptmulx**
Step	Hyp	Ref	Expression
1		dvmptadd.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
2		dvmptclx.ss	. . 3 ⊢ (𝜑 → 𝑋 ⊆ 𝑆)
3		dvmptadd.a	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ ℂ)
4	3	fmpttd 5866	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶ℂ)
5		dvmptadd.c	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐶 ∈ ℂ)
6	5	fmpttd 5866	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐶):𝑋⟶ℂ)
7		dvmptadd.da	. . . . 5 ⊢ (𝜑 → (𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐴)) = (𝑥 ∈ 𝑋 ↦ 𝐵))
8	7	dmeqd 4985	. . . 4 ⊢ (𝜑 → dom (𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐴)) = dom (𝑥 ∈ 𝑋 ↦ 𝐵))
9		dvmptadd.b	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑉)
10	9	ralrimiva 2623	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑉)
11		dmmptg 5288	. . . . 5 ⊢ (∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑉 → dom (𝑥 ∈ 𝑋 ↦ 𝐵) = 𝑋)
12	10, 11	syl 14	. . . 4 ⊢ (𝜑 → dom (𝑥 ∈ 𝑋 ↦ 𝐵) = 𝑋)
13	8, 12	eqtrd 2271	. . 3 ⊢ (𝜑 → dom (𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐴)) = 𝑋)
14		dvmptadd.dc	. . . . 5 ⊢ (𝜑 → (𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐶)) = (𝑥 ∈ 𝑋 ↦ 𝐷))
15	14	dmeqd 4985	. . . 4 ⊢ (𝜑 → dom (𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐶)) = dom (𝑥 ∈ 𝑋 ↦ 𝐷))
16		dvmptadd.d	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐷 ∈ 𝑊)
17	16	ralrimiva 2623	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐷 ∈ 𝑊)
18		dmmptg 5288	. . . . 5 ⊢ (∀𝑥 ∈ 𝑋 𝐷 ∈ 𝑊 → dom (𝑥 ∈ 𝑋 ↦ 𝐷) = 𝑋)
19	17, 18	syl 14	. . . 4 ⊢ (𝜑 → dom (𝑥 ∈ 𝑋 ↦ 𝐷) = 𝑋)
20	15, 19	eqtrd 2271	. . 3 ⊢ (𝜑 → dom (𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐶)) = 𝑋)
21	1, 2, 4, 6, 13, 20	dvimulf 15932	. 2 ⊢ (𝜑 → (𝑆 D ((𝑥 ∈ 𝑋 ↦ 𝐴) ∘_𝑓 · (𝑥 ∈ 𝑋 ↦ 𝐶))) = (((𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐴)) ∘_𝑓 · (𝑥 ∈ 𝑋 ↦ 𝐶)) ∘_𝑓 + ((𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐶)) ∘_𝑓 · (𝑥 ∈ 𝑋 ↦ 𝐴))))
22	1, 2	ssexd 4275	. . . 4 ⊢ (𝜑 → 𝑋 ∈ V)
23		eqidd 2239	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐴) = (𝑥 ∈ 𝑋 ↦ 𝐴))
24		eqidd 2239	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐶) = (𝑥 ∈ 𝑋 ↦ 𝐶))
25	22, 3, 5, 23, 24	offval2 6322	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝑋 ↦ 𝐴) ∘_𝑓 · (𝑥 ∈ 𝑋 ↦ 𝐶)) = (𝑥 ∈ 𝑋 ↦ (𝐴 · 𝐶)))
26	25	oveq2d 6104	. 2 ⊢ (𝜑 → (𝑆 D ((𝑥 ∈ 𝑋 ↦ 𝐴) ∘_𝑓 · (𝑥 ∈ 𝑋 ↦ 𝐶))) = (𝑆 D (𝑥 ∈ 𝑋 ↦ (𝐴 · 𝐶))))
27	1, 3, 9, 7, 2	dvmptclx 15944	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ ℂ)
28	27, 5	mulcld 8352	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐵 · 𝐶) ∈ ℂ)
29	1, 5, 16, 14, 2	dvmptclx 15944	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐷 ∈ ℂ)
30	29, 3	mulcld 8352	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐷 · 𝐴) ∈ ℂ)
31	22, 9, 5, 7, 24	offval2 6322	. . 3 ⊢ (𝜑 → ((𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐴)) ∘_𝑓 · (𝑥 ∈ 𝑋 ↦ 𝐶)) = (𝑥 ∈ 𝑋 ↦ (𝐵 · 𝐶)))
32	22, 16, 3, 14, 23	offval2 6322	. . 3 ⊢ (𝜑 → ((𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐶)) ∘_𝑓 · (𝑥 ∈ 𝑋 ↦ 𝐴)) = (𝑥 ∈ 𝑋 ↦ (𝐷 · 𝐴)))
33	22, 28, 30, 31, 32	offval2 6322	. 2 ⊢ (𝜑 → (((𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐴)) ∘_𝑓 · (𝑥 ∈ 𝑋 ↦ 𝐶)) ∘_𝑓 + ((𝑆 D (𝑥 ∈ 𝑋 ↦ 𝐶)) ∘_𝑓 · (𝑥 ∈ 𝑋 ↦ 𝐴))) = (𝑥 ∈ 𝑋 ↦ ((𝐵 · 𝐶) + (𝐷 · 𝐴))))
34	21, 26, 33	3eqtr3d 2279	1 ⊢ (𝜑 → (𝑆 D (𝑥 ∈ 𝑋 ↦ (𝐴 · 𝐶))) = (𝑥 ∈ 𝑋 ↦ ((𝐵 · 𝐶) + (𝐷 · 𝐴))))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∀wral 2528 Vcvv 2821 ⊆ wss 3220 {cpr 3710 ↦ cmpt 4193 dom cdm 4776 (class class class)co 6088 ∘_𝑓 cof 6303 ℂcc 8183 ℝcr 8184 + caddc 8188 · cmul 8190 D cdv 15881

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 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 ax-pre-mulext 8303 ax-arch 8304 ax-caucvg 8305 ax-addf 8307 ax-mulf 8308

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 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-isom 5389 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-of 6305 df-1st 6378 df-2nd 6379 df-recs 6580 df-frec 6666 df-map 6928 df-pm 6929 df-sup 7330 df-inf 7331 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-reap 8911 df-ap 8918 df-div 9011 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-n0 9575 df-z 9656 df-uz 9938 df-q 10036 df-rp 10072 df-xneg 10191 df-xadd 10192 df-seqfrec 10906 df-exp 10997 df-cj 11629 df-re 11630 df-im 11631 df-rsqrt 11786 df-abs 11787 df-rest 13654 df-topgen 13673 df-psmet 14989 df-xmet 14990 df-met 14991 df-bl 14992 df-mopn 14993 df-top 15224 df-topon 15237 df-bases 15269 df-ntr 15322 df-cn 15414 df-cnp 15415 df-tx 15479 df-cncf 15797 df-limced 15882 df-dvap 15883

This theorem is used by: dvmptcmulcn 15947

W3C validator