his7 - Hilbert Space Explorer

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

Theorem his7 30129

Description: Distributive law for inner product. Lemma 3.1(S7) of [Beran] p. 95. (Contributed by NM, 31-Jul-1999.) (New usage is discouraged.)

**Assertion**
Ref	Expression
his7	⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih (𝐵 +_ℎ 𝐶)) = ((𝐴 ·_ih 𝐵) + (𝐴 ·_ih 𝐶)))

**Proof of Theorem his7**
Step	Hyp	Ref	Expression
1		ax-his2 30122	. . . . 5 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → ((𝐵 +_ℎ 𝐶) ·_ih 𝐴) = ((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴)))
2	1	fveq2d 6866	. . . 4 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)) = (∗‘((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴))))
3		hicl 30119	. . . . . 6 ⊢ ((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (𝐵 ·_ih 𝐴) ∈ ℂ)
4		hicl 30119	. . . . . 6 ⊢ ((𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (𝐶 ·_ih 𝐴) ∈ ℂ)
5		cjadd 15053	. . . . . 6 ⊢ (((𝐵 ·_ih 𝐴) ∈ ℂ ∧ (𝐶 ·_ih 𝐴) ∈ ℂ) → (∗‘((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴))) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
6	3, 4, 5	syl2an 596	. . . . 5 ⊢ (((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ)) → (∗‘((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴))) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
7	6	3impdir 1351	. . . 4 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (∗‘((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴))) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
8	2, 7	eqtrd 2771	. . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
9	8	3comr 1125	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
10		hvaddcl 30051	. . . 4 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 +_ℎ 𝐶) ∈ ℋ)
11		ax-his1 30121	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ (𝐵 +_ℎ 𝐶) ∈ ℋ) → (𝐴 ·_ih (𝐵 +_ℎ 𝐶)) = (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)))
12	10, 11	sylan2 593	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝐴 ·_ih (𝐵 +_ℎ 𝐶)) = (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)))
13	12	3impb 1115	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih (𝐵 +_ℎ 𝐶)) = (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)))
14		ax-his1 30121	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 ·_ih 𝐵) = (∗‘(𝐵 ·_ih 𝐴)))
15	14	3adant3 1132	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih 𝐵) = (∗‘(𝐵 ·_ih 𝐴)))
16		ax-his1 30121	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih 𝐶) = (∗‘(𝐶 ·_ih 𝐴)))
17	16	3adant2 1131	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih 𝐶) = (∗‘(𝐶 ·_ih 𝐴)))
18	15, 17	oveq12d 7395	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·_ih 𝐵) + (𝐴 ·_ih 𝐶)) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
19	9, 13, 18	3eqtr4d 2781	1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih (𝐵 +_ℎ 𝐶)) = ((𝐴 ·_ih 𝐵) + (𝐴 ·_ih 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ‘cfv 6516 (class class class)co 7377 ℂcc 11073 + caddc 11078 ∗ccj 15008 ℋchba 29958 +_ℎ cva 29959 ·_ih csp 29961

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5276 ax-nul 5283 ax-pow 5340 ax-pr 5404 ax-un 7692 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-hfvadd 30039 ax-hfi 30118 ax-his1 30121 ax-his2 30122

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3364 df-reu 3365 df-rab 3419 df-v 3461 df-sbc 3758 df-csb 3874 df-dif 3931 df-un 3933 df-in 3935 df-ss 3945 df-nul 4303 df-if 4507 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4886 df-iun 4976 df-br 5126 df-opab 5188 df-mpt 5209 df-id 5551 df-po 5565 df-so 5566 df-xp 5659 df-rel 5660 df-cnv 5661 df-co 5662 df-dm 5663 df-rn 5664 df-res 5665 df-ima 5666 df-iota 6468 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7333 df-ov 7380 df-oprab 7381 df-mpo 7382 df-er 8670 df-en 8906 df-dom 8907 df-sdom 8908 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11411 df-neg 11412 df-div 11837 df-2 12240 df-cj 15011 df-re 15012 df-im 15013

This theorem is referenced by: normlem0 30148 normlem8 30156 pjadjii 30713 lnopunilem1 31049 hmops 31059 cnlnadjlem6 31111 adjlnop 31125 adjadd 31132 hstoh 31271

W3C validator