his5 - Hilbert Space Explorer

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

Theorem his5 31015

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

**Assertion**
Ref	Expression
his5	⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ·_ih (𝐴 ·_ℎ 𝐶)) = ((∗‘𝐴) · (𝐵 ·_ih 𝐶)))

**Proof of Theorem his5**
Step	Hyp	Ref	Expression
1		hvmulcl 30942	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (𝐴 ·_ℎ 𝐶) ∈ ℋ)
2		ax-his1 31011	. . . . 5 ⊢ ((𝐵 ∈ ℋ ∧ (𝐴 ·_ℎ 𝐶) ∈ ℋ) → (𝐵 ·_ih (𝐴 ·_ℎ 𝐶)) = (∗‘((𝐴 ·_ℎ 𝐶) ·_ih 𝐵)))
3	1, 2	sylan2 593	. . . 4 ⊢ ((𝐵 ∈ ℋ ∧ (𝐴 ∈ ℂ ∧ 𝐶 ∈ ℋ)) → (𝐵 ·_ih (𝐴 ·_ℎ 𝐶)) = (∗‘((𝐴 ·_ℎ 𝐶) ·_ih 𝐵)))
4	3	3impb 1114	. . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (𝐵 ·_ih (𝐴 ·_ℎ 𝐶)) = (∗‘((𝐴 ·_ℎ 𝐶) ·_ih 𝐵)))
5	4	3com12 1123	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ·_ih (𝐴 ·_ℎ 𝐶)) = (∗‘((𝐴 ·_ℎ 𝐶) ·_ih 𝐵)))
6		ax-his3 31013	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·_ℎ 𝐶) ·_ih 𝐵) = (𝐴 · (𝐶 ·_ih 𝐵)))
7	6	3com23 1126	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·_ℎ 𝐶) ·_ih 𝐵) = (𝐴 · (𝐶 ·_ih 𝐵)))
8	7	fveq2d 6862	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∗‘((𝐴 ·_ℎ 𝐶) ·_ih 𝐵)) = (∗‘(𝐴 · (𝐶 ·_ih 𝐵))))
9		hicl 31009	. . . . . 6 ⊢ ((𝐶 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐶 ·_ih 𝐵) ∈ ℂ)
10		cjmul 15108	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝐶 ·_ih 𝐵) ∈ ℂ) → (∗‘(𝐴 · (𝐶 ·_ih 𝐵))) = ((∗‘𝐴) · (∗‘(𝐶 ·_ih 𝐵))))
11	9, 10	sylan2 593	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝐶 ∈ ℋ ∧ 𝐵 ∈ ℋ)) → (∗‘(𝐴 · (𝐶 ·_ih 𝐵))) = ((∗‘𝐴) · (∗‘(𝐶 ·_ih 𝐵))))
12	11	3impb 1114	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (∗‘(𝐴 · (𝐶 ·_ih 𝐵))) = ((∗‘𝐴) · (∗‘(𝐶 ·_ih 𝐵))))
13	12	3com23 1126	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∗‘(𝐴 · (𝐶 ·_ih 𝐵))) = ((∗‘𝐴) · (∗‘(𝐶 ·_ih 𝐵))))
14		ax-his1 31011	. . . . 5 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ·_ih 𝐶) = (∗‘(𝐶 ·_ih 𝐵)))
15	14	3adant1 1130	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ·_ih 𝐶) = (∗‘(𝐶 ·_ih 𝐵)))
16	15	oveq2d 7403	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((∗‘𝐴) · (𝐵 ·_ih 𝐶)) = ((∗‘𝐴) · (∗‘(𝐶 ·_ih 𝐵))))
17	13, 16	eqtr4d 2767	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∗‘(𝐴 · (𝐶 ·_ih 𝐵))) = ((∗‘𝐴) · (𝐵 ·_ih 𝐶)))
18	5, 8, 17	3eqtrd 2768	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ·_ih (𝐴 ·_ℎ 𝐶)) = ((∗‘𝐴) · (𝐵 ·_ih 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ‘cfv 6511 (class class class)co 7387 ℂcc 11066 · cmul 11073 ∗ccj 15062 ℋchba 30848 ·_ℎ csm 30850 ·_ih csp 30851

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-hfvmul 30934 ax-hfi 31008 ax-his1 31011 ax-his3 31013

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-cj 15065 df-re 15066 df-im 15067

This theorem is referenced by: his52 31016 his35 31017 normlem0 31038 normlem9 31047 bcseqi 31049 polid2i 31086 pjhthlem1 31320 eigrei 31763 eigposi 31765 eigorthi 31766 brafnmul 31880 lnopunilem1 31939 hmopm 31950 cnlnadjlem6 32001 adjlnop 32015

W3C validator