Theorem homulass 31746

Description: Scalar product associative law for Hilbert space operators. (Contributed by NM, 12-Aug-2006.) (New usage is discouraged.)

Assertion

Ref	Expression
homulass	⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → ((𝐴 · 𝐵) ·op 𝑇) = (𝐴 ·op (𝐵 ·op 𝑇)))

Proof of Theorem homulass

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mulcl 11093	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ)
2		homval 31685	. . . . . . . . 9 ⊢ (((𝐴 · 𝐵) ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥)))
3	1, 2	syl3an1 1163	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥)))
4	3	3expia 1121	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝑇: ℋ⟶ ℋ) → (𝑥 ∈ ℋ → (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥))))
5	4	3impa 1109	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (𝑥 ∈ ℋ → (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥))))
6	5	imp 406	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥)))
7		homval 31685	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝐵 ·op 𝑇)‘𝑥) = (𝐵 ·ℎ (𝑇‘𝑥)))
8	7	oveq2d 7365	. . . . . . . 8 ⊢ ((𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥)) = (𝐴 ·ℎ (𝐵 ·ℎ (𝑇‘𝑥))))
9	8	3expa 1118	. . . . . . 7 ⊢ (((𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥)) = (𝐴 ·ℎ (𝐵 ·ℎ (𝑇‘𝑥))))
10	9	3adantl1 1167	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥)) = (𝐴 ·ℎ (𝐵 ·ℎ (𝑇‘𝑥))))
11		ffvelcdm 7015	. . . . . . . . . 10 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝑇‘𝑥) ∈ ℋ)
12		ax-hvmulass 30951	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝑇‘𝑥) ∈ ℋ) → ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥)) = (𝐴 ·ℎ (𝐵 ·ℎ (𝑇‘𝑥))))
13	11, 12	syl3an3 1165	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥)) = (𝐴 ·ℎ (𝐵 ·ℎ (𝑇‘𝑥))))
14	13	3expa 1118	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥)) = (𝐴 ·ℎ (𝐵 ·ℎ (𝑇‘𝑥))))
15	14	exp43 436	. . . . . . 7 ⊢ (𝐴 ∈ ℂ → (𝐵 ∈ ℂ → (𝑇: ℋ⟶ ℋ → (𝑥 ∈ ℋ → ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥)) = (𝐴 ·ℎ (𝐵 ·ℎ (𝑇‘𝑥)))))))
16	15	3imp1 1348	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥)) = (𝐴 ·ℎ (𝐵 ·ℎ (𝑇‘𝑥))))
17	10, 16	eqtr4d 2767	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥)) = ((𝐴 · 𝐵) ·ℎ (𝑇‘𝑥)))
18	6, 17	eqtr4d 2767	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥)))
19		homulcl 31703	. . . . . . . 8 ⊢ ((𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (𝐵 ·op 𝑇): ℋ⟶ ℋ)
20		homval 31685	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ·op 𝑇): ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op (𝐵 ·op 𝑇))‘𝑥) = (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥)))
21	19, 20	syl3an2 1164	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op (𝐵 ·op 𝑇))‘𝑥) = (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥)))
22	21	3expia 1121	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ)) → (𝑥 ∈ ℋ → ((𝐴 ·op (𝐵 ·op 𝑇))‘𝑥) = (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥))))
23	22	3impb 1114	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (𝑥 ∈ ℋ → ((𝐴 ·op (𝐵 ·op 𝑇))‘𝑥) = (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥))))
24	23	imp 406	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op (𝐵 ·op 𝑇))‘𝑥) = (𝐴 ·ℎ ((𝐵 ·op 𝑇)‘𝑥)))
25	18, 24	eqtr4d 2767	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = ((𝐴 ·op (𝐵 ·op 𝑇))‘𝑥))
26	25	ralrimiva 3121	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → ∀𝑥 ∈ ℋ (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = ((𝐴 ·op (𝐵 ·op 𝑇))‘𝑥))
27		homulcl 31703	. . . 4 ⊢ (((𝐴 · 𝐵) ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → ((𝐴 · 𝐵) ·op 𝑇): ℋ⟶ ℋ)
28	1, 27	stoic3 1776	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → ((𝐴 · 𝐵) ·op 𝑇): ℋ⟶ ℋ)
29		homulcl 31703	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ·op 𝑇): ℋ⟶ ℋ) → (𝐴 ·op (𝐵 ·op 𝑇)): ℋ⟶ ℋ)
30	19, 29	sylan2 593	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ)) → (𝐴 ·op (𝐵 ·op 𝑇)): ℋ⟶ ℋ)
31	30	3impb 1114	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (𝐴 ·op (𝐵 ·op 𝑇)): ℋ⟶ ℋ)
32		hoeq 31704	. . 3 ⊢ ((((𝐴 · 𝐵) ·op 𝑇): ℋ⟶ ℋ ∧ (𝐴 ·op (𝐵 ·op 𝑇)): ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = ((𝐴 ·op (𝐵 ·op 𝑇))‘𝑥) ↔ ((𝐴 · 𝐵) ·op 𝑇) = (𝐴 ·op (𝐵 ·op 𝑇))))
33	28, 31, 32	syl2anc 584	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ (((𝐴 · 𝐵) ·op 𝑇)‘𝑥) = ((𝐴 ·op (𝐵 ·op 𝑇))‘𝑥) ↔ ((𝐴 · 𝐵) ·op 𝑇) = (𝐴 ·op (𝐵 ·op 𝑇))))
34	26, 33	mpbid 232	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → ((𝐴 · 𝐵) ·op 𝑇) = (𝐴 ·op (𝐵 ·op 𝑇)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ⟶wf 6478  ‘cfv 6482  (class class class)co 7349  ℂcc 11007   · cmul 11014   ℋchba 30863   ·_ℎ csm 30865   ·_op chot 30883

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-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-mulcl 11071  ax-hilex 30943  ax-hfvmul 30949  ax-hvmulass 30951

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  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-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-ov 7352  df-oprab 7353  df-mpo 7354  df-map 8755  df-homul 31675

This theorem is referenced by:  homul12  31749  honegneg  31750  leopmul  32078  nmopleid  32083  opsqrlem1  32084  opsqrlem6  32089