Theorem hocadddiri 31761

Description: Distributive law for Hilbert space operator sum. (Contributed by NM, 26-Nov-2000.) (New usage is discouraged.)

Hypotheses

Ref	Expression
hods.1	⊢ 𝑅: ℋ⟶ ℋ
hods.2	⊢ 𝑆: ℋ⟶ ℋ
hods.3	⊢ 𝑇: ℋ⟶ ℋ

Assertion

Ref	Expression
hocadddiri	⊢ ((𝑅 +op 𝑆) ∘ 𝑇) = ((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇))

Proof of Theorem hocadddiri

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		hods.1	. . . . . 6 ⊢ 𝑅: ℋ⟶ ℋ
2		hods.2	. . . . . 6 ⊢ 𝑆: ℋ⟶ ℋ
3	1, 2	hoaddcli 31750	. . . . 5 ⊢ (𝑅 +op 𝑆): ℋ⟶ ℋ
4		hods.3	. . . . 5 ⊢ 𝑇: ℋ⟶ ℋ
5	3, 4	hocoi 31746	. . . 4 ⊢ (𝑥 ∈ ℋ → (((𝑅 +op 𝑆) ∘ 𝑇)‘𝑥) = ((𝑅 +op 𝑆)‘(𝑇‘𝑥)))
6	1, 4	hocofi 31748	. . . . . 6 ⊢ (𝑅 ∘ 𝑇): ℋ⟶ ℋ
7	2, 4	hocofi 31748	. . . . . 6 ⊢ (𝑆 ∘ 𝑇): ℋ⟶ ℋ
8		hosval 31722	. . . . . 6 ⊢ (((𝑅 ∘ 𝑇): ℋ⟶ ℋ ∧ (𝑆 ∘ 𝑇): ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇))‘𝑥) = (((𝑅 ∘ 𝑇)‘𝑥) +ℎ ((𝑆 ∘ 𝑇)‘𝑥)))
9	6, 7, 8	mp3an12 1453	. . . . 5 ⊢ (𝑥 ∈ ℋ → (((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇))‘𝑥) = (((𝑅 ∘ 𝑇)‘𝑥) +ℎ ((𝑆 ∘ 𝑇)‘𝑥)))
10	4	ffvelcdmi 7022	. . . . . . 7 ⊢ (𝑥 ∈ ℋ → (𝑇‘𝑥) ∈ ℋ)
11		hosval 31722	. . . . . . . 8 ⊢ ((𝑅: ℋ⟶ ℋ ∧ 𝑆: ℋ⟶ ℋ ∧ (𝑇‘𝑥) ∈ ℋ) → ((𝑅 +op 𝑆)‘(𝑇‘𝑥)) = ((𝑅‘(𝑇‘𝑥)) +ℎ (𝑆‘(𝑇‘𝑥))))
12	1, 2, 11	mp3an12 1453	. . . . . . 7 ⊢ ((𝑇‘𝑥) ∈ ℋ → ((𝑅 +op 𝑆)‘(𝑇‘𝑥)) = ((𝑅‘(𝑇‘𝑥)) +ℎ (𝑆‘(𝑇‘𝑥))))
13	10, 12	syl 17	. . . . . 6 ⊢ (𝑥 ∈ ℋ → ((𝑅 +op 𝑆)‘(𝑇‘𝑥)) = ((𝑅‘(𝑇‘𝑥)) +ℎ (𝑆‘(𝑇‘𝑥))))
14	1, 4	hocoi 31746	. . . . . . 7 ⊢ (𝑥 ∈ ℋ → ((𝑅 ∘ 𝑇)‘𝑥) = (𝑅‘(𝑇‘𝑥)))
15	2, 4	hocoi 31746	. . . . . . 7 ⊢ (𝑥 ∈ ℋ → ((𝑆 ∘ 𝑇)‘𝑥) = (𝑆‘(𝑇‘𝑥)))
16	14, 15	oveq12d 7370	. . . . . 6 ⊢ (𝑥 ∈ ℋ → (((𝑅 ∘ 𝑇)‘𝑥) +ℎ ((𝑆 ∘ 𝑇)‘𝑥)) = ((𝑅‘(𝑇‘𝑥)) +ℎ (𝑆‘(𝑇‘𝑥))))
17	13, 16	eqtr4d 2771	. . . . 5 ⊢ (𝑥 ∈ ℋ → ((𝑅 +op 𝑆)‘(𝑇‘𝑥)) = (((𝑅 ∘ 𝑇)‘𝑥) +ℎ ((𝑆 ∘ 𝑇)‘𝑥)))
18	9, 17	eqtr4d 2771	. . . 4 ⊢ (𝑥 ∈ ℋ → (((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇))‘𝑥) = ((𝑅 +op 𝑆)‘(𝑇‘𝑥)))
19	5, 18	eqtr4d 2771	. . 3 ⊢ (𝑥 ∈ ℋ → (((𝑅 +op 𝑆) ∘ 𝑇)‘𝑥) = (((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇))‘𝑥))
20	19	rgen 3050	. 2 ⊢ ∀𝑥 ∈ ℋ (((𝑅 +op 𝑆) ∘ 𝑇)‘𝑥) = (((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇))‘𝑥)
21	3, 4	hocofi 31748	. . 3 ⊢ ((𝑅 +op 𝑆) ∘ 𝑇): ℋ⟶ ℋ
22	6, 7	hoaddcli 31750	. . 3 ⊢ ((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇)): ℋ⟶ ℋ
23	21, 22	hoeqi 31743	. 2 ⊢ (∀𝑥 ∈ ℋ (((𝑅 +op 𝑆) ∘ 𝑇)‘𝑥) = (((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇))‘𝑥) ↔ ((𝑅 +op 𝑆) ∘ 𝑇) = ((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇)))
24	20, 23	mpbi 230	1 ⊢ ((𝑅 +op 𝑆) ∘ 𝑇) = ((𝑅 ∘ 𝑇) +op (𝑆 ∘ 𝑇))

Syntax hints:   = wceq 1541   ∈ wcel 2113  ∀wral 3048   ∘ ccom 5623  ⟶wf 6482  ‘cfv 6486  (class class class)co 7352   ℋchba 30901   +_ℎ cva 30902   +_op chos 30920

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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-hilex 30981  ax-hfvadd 30982

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  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 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7355  df-oprab 7356  df-mpo 7357  df-map 8758  df-hosum 31712

This theorem is referenced by: (None)