hvsubdistr2 - Hilbert Space Explorer

	Hilbert Space Explorer		< Previous Next > Nearby theorems
Mirrors > Home > HSE Home > Th. List > hvsubdistr2		Structured version Visualization version GIF version

Theorem hvsubdistr2 28827

Description: Scalar multiplication distributive law for subtraction. (Contributed by NM, 19-May-2005.) (New usage is discouraged.)

**Assertion**
Ref	Expression
hvsubdistr2	⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((𝐴 − 𝐵) ·_ℎ 𝐶) = ((𝐴 ·_ℎ 𝐶) −_ℎ (𝐵 ·_ℎ 𝐶)))

**Proof of Theorem hvsubdistr2**
Step	Hyp	Ref	Expression
1		hvmulcl 28790	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ℎ 𝐶) ∈ ℋ)
2	1	3adant2 1127	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ℎ 𝐶) ∈ ℋ)
3		hvmulcl 28790	. . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (𝐵 ·_ℎ 𝐶) ∈ ℋ)
4	3	3adant1 1126	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (𝐵 ·_ℎ 𝐶) ∈ ℋ)
5		hvsubval 28793	. . 3 ⊢ (((𝐴 ·_ℎ 𝐶) ∈ ℋ ∧ (𝐵 ·_ℎ 𝐶) ∈ ℋ) → ((𝐴 ·_ℎ 𝐶) −_ℎ (𝐵 ·_ℎ 𝐶)) = ((𝐴 ·_ℎ 𝐶) +_ℎ (-1 ·_ℎ (𝐵 ·_ℎ 𝐶))))
6	2, 4, 5	syl2anc 586	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·_ℎ 𝐶) −_ℎ (𝐵 ·_ℎ 𝐶)) = ((𝐴 ·_ℎ 𝐶) +_ℎ (-1 ·_ℎ (𝐵 ·_ℎ 𝐶))))
7		mulm1 11081	. . . . . . 7 ⊢ (𝐵 ∈ ℂ → (-1 · 𝐵) = -𝐵)
8	7	oveq1d 7171	. . . . . 6 ⊢ (𝐵 ∈ ℂ → ((-1 · 𝐵) ·_ℎ 𝐶) = (-𝐵 ·_ℎ 𝐶))
9	8	adantr 483	. . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((-1 · 𝐵) ·_ℎ 𝐶) = (-𝐵 ·_ℎ 𝐶))
10		neg1cn 11752	. . . . . 6 ⊢ -1 ∈ ℂ
11		ax-hvmulass 28784	. . . . . 6 ⊢ ((-1 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((-1 · 𝐵) ·_ℎ 𝐶) = (-1 ·_ℎ (𝐵 ·_ℎ 𝐶)))
12	10, 11	mp3an1 1444	. . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((-1 · 𝐵) ·_ℎ 𝐶) = (-1 ·_ℎ (𝐵 ·_ℎ 𝐶)))
13	9, 12	eqtr3d 2858	. . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (-𝐵 ·_ℎ 𝐶) = (-1 ·_ℎ (𝐵 ·_ℎ 𝐶)))
14	13	3adant1 1126	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (-𝐵 ·_ℎ 𝐶) = (-1 ·_ℎ (𝐵 ·_ℎ 𝐶)))
15	14	oveq2d 7172	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·_ℎ 𝐶) +_ℎ (-𝐵 ·_ℎ 𝐶)) = ((𝐴 ·_ℎ 𝐶) +_ℎ (-1 ·_ℎ (𝐵 ·_ℎ 𝐶))))
16		negcl 10886	. . . 4 ⊢ (𝐵 ∈ ℂ → -𝐵 ∈ ℂ)
17		ax-hvdistr2 28786	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ -𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((𝐴 + -𝐵) ·_ℎ 𝐶) = ((𝐴 ·_ℎ 𝐶) +_ℎ (-𝐵 ·_ℎ 𝐶)))
18	16, 17	syl3an2 1160	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((𝐴 + -𝐵) ·_ℎ 𝐶) = ((𝐴 ·_ℎ 𝐶) +_ℎ (-𝐵 ·_ℎ 𝐶)))
19		negsub 10934	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴 − 𝐵))
20	19	3adant3 1128	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (𝐴 + -𝐵) = (𝐴 − 𝐵))
21	20	oveq1d 7171	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((𝐴 + -𝐵) ·_ℎ 𝐶) = ((𝐴 − 𝐵) ·_ℎ 𝐶))
22	18, 21	eqtr3d 2858	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·_ℎ 𝐶) +_ℎ (-𝐵 ·_ℎ 𝐶)) = ((𝐴 − 𝐵) ·_ℎ 𝐶))
23	6, 15, 22	3eqtr2rd 2863	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((𝐴 − 𝐵) ·_ℎ 𝐶) = ((𝐴 ·_ℎ 𝐶) −_ℎ (𝐵 ·_ℎ 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 (class class class)co 7156 ℂcc 10535 1c1 10538 + caddc 10540 · cmul 10542 − cmin 10870 -cneg 10871 ℋchba 28696 +_ℎ cva 28697 ·_ℎ csm 28698 −_ℎ cmv 28702

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-hfvmul 28782 ax-hvmulass 28784 ax-hvdistr2 28786

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-po 5474 df-so 5475 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-ltxr 10680 df-sub 10872 df-neg 10873 df-hvsub 28748

This theorem is referenced by: hvmulcan2 28850

W3C validator