Theorem hoadddi 32438

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

Assertion

Ref	Expression
hoadddi	⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → (𝐴 ·op (𝑇 +op 𝑈)) = ((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈)))

Proof of Theorem hoadddi

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl1 1210	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → 𝐴 ∈ ℂ)
2		ffvelcdm 7108	. . . . . . 7 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝑇‘𝑥) ∈ ℋ)
3	2	3ad2antl2 1205	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝑇‘𝑥) ∈ ℋ)
4		ffvelcdm 7108	. . . . . . 7 ⊢ ((𝑈: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝑈‘𝑥) ∈ ℋ)
5	4	3ad2antl3 1206	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝑈‘𝑥) ∈ ℋ)
6		ax-hvdistr1 31643	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝑇‘𝑥) ∈ ℋ ∧ (𝑈‘𝑥) ∈ ℋ) → (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))) = ((𝐴 ·ℎ (𝑇‘𝑥)) +ℎ (𝐴 ·ℎ (𝑈‘𝑥))))
7	1, 3, 5, 6	syl3anc 1399	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))) = ((𝐴 ·ℎ (𝑇‘𝑥)) +ℎ (𝐴 ·ℎ (𝑈‘𝑥))))
8		hosval 32375	. . . . . . . 8 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝑇 +op 𝑈)‘𝑥) = ((𝑇‘𝑥) +ℎ (𝑈‘𝑥)))
9	8	oveq2d 7462	. . . . . . 7 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)) = (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))))
10	9	3expa 1136	. . . . . 6 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)) = (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))))
11	10	3adantl1 1185	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)) = (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))))
12		homval 32376	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑥) = (𝐴 ·ℎ (𝑇‘𝑥)))
13	12	3expa 1136	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑥) = (𝐴 ·ℎ (𝑇‘𝑥)))
14	13	3adantl3 1187	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑥) = (𝐴 ·ℎ (𝑇‘𝑥)))
15		homval 32376	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑈: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑈)‘𝑥) = (𝐴 ·ℎ (𝑈‘𝑥)))
16	15	3expa 1136	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑈)‘𝑥) = (𝐴 ·ℎ (𝑈‘𝑥)))
17	16	3adantl2 1186	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑈)‘𝑥) = (𝐴 ·ℎ (𝑈‘𝑥)))
18	14, 17	oveq12d 7464	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝐴 ·op 𝑇)‘𝑥) +ℎ ((𝐴 ·op 𝑈)‘𝑥)) = ((𝐴 ·ℎ (𝑇‘𝑥)) +ℎ (𝐴 ·ℎ (𝑈‘𝑥))))
19	7, 11, 18	3eqtr4d 2808	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)) = (((𝐴 ·op 𝑇)‘𝑥) +ℎ ((𝐴 ·op 𝑈)‘𝑥)))
20		hoaddcl 32393	. . . . . . 7 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → (𝑇 +op 𝑈): ℋ⟶ ℋ)
21	20	anim2i 629	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ)) → (𝐴 ∈ ℂ ∧ (𝑇 +op 𝑈): ℋ⟶ ℋ))
22	21	3impb 1132	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → (𝐴 ∈ ℂ ∧ (𝑇 +op 𝑈): ℋ⟶ ℋ))
23		homval 32376	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝑇 +op 𝑈): ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op (𝑇 +op 𝑈))‘𝑥) = (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)))
24	23	3expa 1136	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ (𝑇 +op 𝑈): ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op (𝑇 +op 𝑈))‘𝑥) = (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)))
25	22, 24	sylan 592	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op (𝑇 +op 𝑈))‘𝑥) = (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)))
26		homulcl 32394	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (𝐴 ·op 𝑇): ℋ⟶ ℋ)
27		homulcl 32394	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑈: ℋ⟶ ℋ) → (𝐴 ·op 𝑈): ℋ⟶ ℋ)
28	26, 27	anim12i 625	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ (𝐴 ∈ ℂ ∧ 𝑈: ℋ⟶ ℋ)) → ((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ (𝐴 ·op 𝑈): ℋ⟶ ℋ))
29	28	3impdi 1369	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → ((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ (𝐴 ·op 𝑈): ℋ⟶ ℋ))
30		hosval 32375	. . . . . 6 ⊢ (((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ (𝐴 ·op 𝑈): ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))‘𝑥) = (((𝐴 ·op 𝑇)‘𝑥) +ℎ ((𝐴 ·op 𝑈)‘𝑥)))
31	30	3expa 1136	. . . . 5 ⊢ ((((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ (𝐴 ·op 𝑈): ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))‘𝑥) = (((𝐴 ·op 𝑇)‘𝑥) +ℎ ((𝐴 ·op 𝑈)‘𝑥)))
32	29, 31	sylan 592	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))‘𝑥) = (((𝐴 ·op 𝑇)‘𝑥) +ℎ ((𝐴 ·op 𝑈)‘𝑥)))
33	19, 25, 32	3eqtr4d 2808	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op (𝑇 +op 𝑈))‘𝑥) = (((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))‘𝑥))
34	33	ralrimiva 3158	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → ∀𝑥 ∈ ℋ ((𝐴 ·op (𝑇 +op 𝑈))‘𝑥) = (((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))‘𝑥))
35		homulcl 32394	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑇 +op 𝑈): ℋ⟶ ℋ) → (𝐴 ·op (𝑇 +op 𝑈)): ℋ⟶ ℋ)
36	20, 35	sylan2 605	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ)) → (𝐴 ·op (𝑇 +op 𝑈)): ℋ⟶ ℋ)
37	36	3impb 1132	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → (𝐴 ·op (𝑇 +op 𝑈)): ℋ⟶ ℋ)
38		hoaddcl 32393	. . . . 5 ⊢ (((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ (𝐴 ·op 𝑈): ℋ⟶ ℋ) → ((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈)): ℋ⟶ ℋ)
39	26, 27, 38	syl2an 608	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ (𝐴 ∈ ℂ ∧ 𝑈: ℋ⟶ ℋ)) → ((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈)): ℋ⟶ ℋ)
40	39	3impdi 1369	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → ((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈)): ℋ⟶ ℋ)
41		hoeq 32395	. . 3 ⊢ (((𝐴 ·op (𝑇 +op 𝑈)): ℋ⟶ ℋ ∧ ((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈)): ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ((𝐴 ·op (𝑇 +op 𝑈))‘𝑥) = (((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))‘𝑥) ↔ (𝐴 ·op (𝑇 +op 𝑈)) = ((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))))
42	37, 40, 41	syl2anc 596	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ((𝐴 ·op (𝑇 +op 𝑈))‘𝑥) = (((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))‘𝑥) ↔ (𝐴 ·op (𝑇 +op 𝑈)) = ((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))))
43	34, 42	mpbid 235	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → (𝐴 ·op (𝑇 +op 𝑈)) = ((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ⟶wf 6557  ‘cfv 6561  (class class class)co 7446  ℂcc 11228   ℋchba 31554   +_ℎ cva 31555   ·_ℎ csm 31556   +_op chos 31573   ·_op chot 31574

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-hilex 31634  ax-hfvadd 31635  ax-hfvmul 31640  ax-hvdistr1 31643

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-map 8880  df-hosum 32365  df-homul 32366

This theorem is used by:  hosubdi  32443  honegdi  32444  ho2times  32454  opsqrlem6  32780