Theorem lnophsi 32482

Description: The sum of two linear operators is linear. (Contributed by NM, 10-Mar-2006.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lnopco.1	⊢ 𝑆 ∈ LinOp
lnopco.2	⊢ 𝑇 ∈ LinOp

Assertion

Ref	Expression
lnophsi	⊢ (𝑆 +op 𝑇) ∈ LinOp

Proof of Theorem lnophsi

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lnopco.1	. . . 4 ⊢ 𝑆 ∈ LinOp
2	1	lnopfi 32450	. . 3 ⊢ 𝑆: ℋ⟶ ℋ
3		lnopco.2	. . . 4 ⊢ 𝑇 ∈ LinOp
4	3	lnopfi 32450	. . 3 ⊢ 𝑇: ℋ⟶ ℋ
5	2, 4	hoaddcli 32249	. 2 ⊢ (𝑆 +op 𝑇): ℋ⟶ ℋ
6		hvmulcl 31494	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ 𝑦) ∈ ℋ)
7	1	lnopaddi 32452	. . . . . . . 8 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)))
8	3	lnopaddi 32452	. . . . . . . 8 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧)))
9	7, 8	oveq12d 7431	. . . . . . 7 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))))
10	6, 9	sylan 592	. . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))))
11	2	ffvelcdmi 7076	. . . . . . . . 9 ⊢ ((𝑥 ·ℎ 𝑦) ∈ ℋ → (𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
12	6, 11	syl 18	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
13	2	ffvelcdmi 7076	. . . . . . . 8 ⊢ (𝑧 ∈ ℋ → (𝑆‘𝑧) ∈ ℋ)
14	12, 13	anim12i 625	. . . . . . 7 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑆‘𝑧) ∈ ℋ))
15	4	ffvelcdmi 7076	. . . . . . . . 9 ⊢ ((𝑥 ·ℎ 𝑦) ∈ ℋ → (𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
16	6, 15	syl 18	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
17	4	ffvelcdmi 7076	. . . . . . . 8 ⊢ (𝑧 ∈ ℋ → (𝑇‘𝑧) ∈ ℋ)
18	16, 17	anim12i 625	. . . . . . 7 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑇‘𝑧) ∈ ℋ))
19		hvadd4 31517	. . . . . . 7 ⊢ ((((𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑆‘𝑧) ∈ ℋ) ∧ ((𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑇‘𝑧) ∈ ℋ)) → (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
20	14, 18, 19	syl2anc 596	. . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
21	10, 20	eqtrd 2795	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
22		hvaddcl 31493	. . . . . . 7 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
23	6, 22	sylan 592	. . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
24		hosval 32221	. . . . . . 7 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ) → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
25	2, 4, 24	mp3an12 1480	. . . . . 6 ⊢ (((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
26	23, 25	syl 18	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
27	2	ffvelcdmi 7076	. . . . . . . . 9 ⊢ (𝑦 ∈ ℋ → (𝑆‘𝑦) ∈ ℋ)
28	4	ffvelcdmi 7076	. . . . . . . . 9 ⊢ (𝑦 ∈ ℋ → (𝑇‘𝑦) ∈ ℋ)
29	27, 28	jca 521	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → ((𝑆‘𝑦) ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ))
30		ax-hvdistr1 31489	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ (𝑆‘𝑦) ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ) → (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
31	30	3expb 1138	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ ((𝑆‘𝑦) ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ)) → (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
32	29, 31	sylan2 605	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
33		hosval 32221	. . . . . . . . . 10 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → ((𝑆 +op 𝑇)‘𝑦) = ((𝑆‘𝑦) +ℎ (𝑇‘𝑦)))
34	2, 4, 33	mp3an12 1480	. . . . . . . . 9 ⊢ (𝑦 ∈ ℋ → ((𝑆 +op 𝑇)‘𝑦) = ((𝑆‘𝑦) +ℎ (𝑇‘𝑦)))
35	34	oveq2d 7429	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) = (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))))
36	35	adantl 487	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) = (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))))
37	1	lnopmuli 32453	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑆‘(𝑥 ·ℎ 𝑦)) = (𝑥 ·ℎ (𝑆‘𝑦)))
38	3	lnopmuli 32453	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 ·ℎ 𝑦)) = (𝑥 ·ℎ (𝑇‘𝑦)))
39	37, 38	oveq12d 7431	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
40	32, 36, 39	3eqtr4d 2805	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) = ((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))))
41		hosval 32221	. . . . . . 7 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑆 +op 𝑇)‘𝑧) = ((𝑆‘𝑧) +ℎ (𝑇‘𝑧)))
42	2, 4, 41	mp3an12 1480	. . . . . 6 ⊢ (𝑧 ∈ ℋ → ((𝑆 +op 𝑇)‘𝑧) = ((𝑆‘𝑧) +ℎ (𝑇‘𝑧)))
43	40, 42	oveqan12d 7432	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧)) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
44	21, 26, 43	3eqtr4d 2805	. . . 4 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧)))
45	44	ralrimiva 3154	. . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ∀𝑧 ∈ ℋ ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧)))
46	45	rgen2 3202	. 2 ⊢ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧))
47		ellnop 32339	. 2 ⊢ ((𝑆 +op 𝑇) ∈ LinOp ↔ ((𝑆 +op 𝑇): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧))))
48	5, 46, 47	mpbir2an 724	1 ⊢ (𝑆 +op 𝑇) ∈ LinOp

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ⟶wf 6529  ‘cfv 6533  (class class class)co 7413  ℂcc 11122   ℋchba 31400   +_ℎ cva 31401   ·_ℎ csm 31402   +_op chos 31419  LinOpclo 31428

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-resscn 11181  ax-1cn 11182  ax-icn 11183  ax-addcl 11184  ax-addrcl 11185  ax-mulcl 11186  ax-mulrcl 11187  ax-mulcom 11188  ax-addass 11189  ax-mulass 11190  ax-distr 11191  ax-i2m1 11192  ax-1ne0 11193  ax-1rid 11194  ax-rnegex 11195  ax-rrecex 11196  ax-cnre 11197  ax-pre-lttri 11198  ax-pre-lttrn 11199  ax-pre-ltadd 11200  ax-hilex 31480  ax-hfvadd 31481  ax-hvcom 31482  ax-hvass 31483  ax-hv0cl 31484  ax-hvaddid 31485  ax-hfvmul 31486  ax-hvmulid 31487  ax-hvdistr1 31489  ax-hvdistr2 31490  ax-hvmul0 31491

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  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 5550  df-po 5563  df-so 5564  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-er 8696  df-map 8828  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11269  df-mnf 11270  df-ltxr 11272  df-sub 11467  df-neg 11468  df-hvsub 31452  df-hosum 32211  df-lnop 32322

This theorem is used by:  lnophdi  32483  bdophsi  32577