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 31070

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 31063	. . . . 5 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → ((𝐵 +_ℎ 𝐶) ·_ih 𝐴) = ((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴)))
2	1	fveq2d 6826	. . . 4 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)) = (∗‘((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴))))
3		hicl 31060	. . . . . 6 ⊢ ((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (𝐵 ·_ih 𝐴) ∈ ℂ)
4		hicl 31060	. . . . . 6 ⊢ ((𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (𝐶 ·_ih 𝐴) ∈ ℂ)
5		cjadd 15048	. . . . . 6 ⊢ (((𝐵 ·_ih 𝐴) ∈ ℂ ∧ (𝐶 ·_ih 𝐴) ∈ ℂ) → (∗‘((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴))) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
6	3, 4, 5	syl2an 596	. . . . 5 ⊢ (((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ)) → (∗‘((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴))) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
7	6	3impdir 1352	. . . 4 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (∗‘((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴))) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
8	2, 7	eqtrd 2766	. . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
9	8	3comr 1125	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
10		hvaddcl 30992	. . . 4 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 +_ℎ 𝐶) ∈ ℋ)
11		ax-his1 31062	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ (𝐵 +_ℎ 𝐶) ∈ ℋ) → (𝐴 ·_ih (𝐵 +_ℎ 𝐶)) = (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)))
12	10, 11	sylan2 593	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝐴 ·_ih (𝐵 +_ℎ 𝐶)) = (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)))
13	12	3impb 1114	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih (𝐵 +_ℎ 𝐶)) = (∗‘((𝐵 +_ℎ 𝐶) ·_ih 𝐴)))
14		ax-his1 31062	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 ·_ih 𝐵) = (∗‘(𝐵 ·_ih 𝐴)))
15	14	3adant3 1132	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih 𝐵) = (∗‘(𝐵 ·_ih 𝐴)))
16		ax-his1 31062	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih 𝐶) = (∗‘(𝐶 ·_ih 𝐴)))
17	16	3adant2 1131	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih 𝐶) = (∗‘(𝐶 ·_ih 𝐴)))
18	15, 17	oveq12d 7364	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·_ih 𝐵) + (𝐴 ·_ih 𝐶)) = ((∗‘(𝐵 ·_ih 𝐴)) + (∗‘(𝐶 ·_ih 𝐴))))
19	9, 13, 18	3eqtr4d 2776	1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ih (𝐵 +_ℎ 𝐶)) = ((𝐴 ·_ih 𝐵) + (𝐴 ·_ih 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ‘cfv 6481 (class class class)co 7346 ℂcc 11004 + caddc 11009 ∗ccj 15003 ℋchba 30899 +_ℎ cva 30900 ·_ih csp 30902

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 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 ax-hfvadd 30980 ax-hfi 31059 ax-his1 31062 ax-his2 31063

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-div 11775 df-nn 12126 df-2 12188 df-cj 15006 df-re 15007 df-im 15008

This theorem is referenced by: normlem0 31089 normlem8 31097 pjadjii 31654 lnopunilem1 31990 hmops 32000 cnlnadjlem6 32052 adjlnop 32066 adjadd 32073 hstoh 32212

W3C validator