Theorem hoadddi 32387

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 7073	. . . . . . 7 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝑇‘𝑥) ∈ ℋ)
3	2	3ad2antl2 1205	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝑇‘𝑥) ∈ ℋ)
4		ffvelcdm 7073	. . . . . . 7 ⊢ ((𝑈: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝑈‘𝑥) ∈ ℋ)
5	4	3ad2antl3 1206	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝑈‘𝑥) ∈ ℋ)
6		ax-hvdistr1 31592	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝑇‘𝑥) ∈ ℋ ∧ (𝑈‘𝑥) ∈ ℋ) → (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))) = ((𝐴 ·ℎ (𝑇‘𝑥)) +ℎ (𝐴 ·ℎ (𝑈‘𝑥))))
7	1, 3, 5, 6	syl3anc 1398	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))) = ((𝐴 ·ℎ (𝑇‘𝑥)) +ℎ (𝐴 ·ℎ (𝑈‘𝑥))))
8		hosval 32324	. . . . . . . 8 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝑇 +op 𝑈)‘𝑥) = ((𝑇‘𝑥) +ℎ (𝑈‘𝑥)))
9	8	oveq2d 7428	. . . . . . 7 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)) = (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))))
10	9	3expa 1136	. . . . . 6 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)) = (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))))
11	10	3adantl1 1185	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)) = (𝐴 ·ℎ ((𝑇‘𝑥) +ℎ (𝑈‘𝑥))))
12		homval 32325	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑥) = (𝐴 ·ℎ (𝑇‘𝑥)))
13	12	3expa 1136	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑥) = (𝐴 ·ℎ (𝑇‘𝑥)))
14	13	3adantl3 1187	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑇)‘𝑥) = (𝐴 ·ℎ (𝑇‘𝑥)))
15		homval 32325	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑈: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑈)‘𝑥) = (𝐴 ·ℎ (𝑈‘𝑥)))
16	15	3expa 1136	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑈)‘𝑥) = (𝐴 ·ℎ (𝑈‘𝑥)))
17	16	3adantl2 1186	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op 𝑈)‘𝑥) = (𝐴 ·ℎ (𝑈‘𝑥)))
18	14, 17	oveq12d 7430	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝐴 ·op 𝑇)‘𝑥) +ℎ ((𝐴 ·op 𝑈)‘𝑥)) = ((𝐴 ·ℎ (𝑇‘𝑥)) +ℎ (𝐴 ·ℎ (𝑈‘𝑥))))
19	7, 11, 18	3eqtr4d 2806	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (𝐴 ·ℎ ((𝑇 +op 𝑈)‘𝑥)) = (((𝐴 ·op 𝑇)‘𝑥) +ℎ ((𝐴 ·op 𝑈)‘𝑥)))
20		hoaddcl 32342	. . . . . . 7 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → (𝑇 +op 𝑈): ℋ⟶ ℋ)
21	20	anim2i 629	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ)) → (𝐴 ∈ ℂ ∧ (𝑇 +op 𝑈): ℋ⟶ ℋ))
22	21	3impb 1132	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → (𝐴 ∈ ℂ ∧ (𝑇 +op 𝑈): ℋ⟶ ℋ))
23		homval 32325	. . . . . 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 32343	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) → (𝐴 ·op 𝑇): ℋ⟶ ℋ)
27		homulcl 32343	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑈: ℋ⟶ ℋ) → (𝐴 ·op 𝑈): ℋ⟶ ℋ)
28	26, 27	anim12i 625	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ) ∧ (𝐴 ∈ ℂ ∧ 𝑈: ℋ⟶ ℋ)) → ((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ (𝐴 ·op 𝑈): ℋ⟶ ℋ))
29	28	3impdi 1369	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → ((𝐴 ·op 𝑇): ℋ⟶ ℋ ∧ (𝐴 ·op 𝑈): ℋ⟶ ℋ))
30		hosval 32324	. . . . . 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 2806	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝐴 ·op (𝑇 +op 𝑈))‘𝑥) = (((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))‘𝑥))
34	33	ralrimiva 3155	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → ∀𝑥 ∈ ℋ ((𝐴 ·op (𝑇 +op 𝑈))‘𝑥) = (((𝐴 ·op 𝑇) +op (𝐴 ·op 𝑈))‘𝑥))
35		homulcl 32343	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑇 +op 𝑈): ℋ⟶ ℋ) → (𝐴 ·op (𝑇 +op 𝑈)): ℋ⟶ ℋ)
36	20, 35	sylan2 605	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ)) → (𝐴 ·op (𝑇 +op 𝑈)): ℋ⟶ ℋ)
37	36	3impb 1132	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑈: ℋ⟶ ℋ) → (𝐴 ·op (𝑇 +op 𝑈)): ℋ⟶ ℋ)
38		hoaddcl 32342	. . . . 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 32344	. . 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 2145  ∀wral 3077  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412  ℂcc 11179   ℋchba 31503   +_ℎ cva 31504   ·_ℎ csm 31505   +_op chos 31522   ·_op chot 31523

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-hilex 31583  ax-hfvadd 31584  ax-hfvmul 31589  ax-hvdistr1 31592

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8833  df-hosum 32314  df-homul 32315

This theorem is used by:  hosubdi  32392  honegdi  32393  ho2times  32403  opsqrlem6  32729