Theorem lnophsi 32424

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 32392	. . 3 ⊢ 𝑆: ℋ⟶ ℋ
3		lnopco.2	. . . 4 ⊢ 𝑇 ∈ LinOp
4	3	lnopfi 32392	. . 3 ⊢ 𝑇: ℋ⟶ ℋ
5	2, 4	hoaddcli 32191	. 2 ⊢ (𝑆 +op 𝑇): ℋ⟶ ℋ
6		hvmulcl 31436	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ 𝑦) ∈ ℋ)
7	1	lnopaddi 32394	. . . . . . . 8 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)))
8	3	lnopaddi 32394	. . . . . . . 8 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧)))
9	7, 8	oveq12d 7437	. . . . . . 7 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))))
10	6, 9	sylan 592	. . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))))
11	2	ffvelcdmi 7082	. . . . . . . . 9 ⊢ ((𝑥 ·ℎ 𝑦) ∈ ℋ → (𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
12	6, 11	syl 18	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
13	2	ffvelcdmi 7082	. . . . . . . 8 ⊢ (𝑧 ∈ ℋ → (𝑆‘𝑧) ∈ ℋ)
14	12, 13	anim12i 625	. . . . . . 7 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑆‘𝑧) ∈ ℋ))
15	4	ffvelcdmi 7082	. . . . . . . . 9 ⊢ ((𝑥 ·ℎ 𝑦) ∈ ℋ → (𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
16	6, 15	syl 18	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ)
17	4	ffvelcdmi 7082	. . . . . . . 8 ⊢ (𝑧 ∈ ℋ → (𝑇‘𝑧) ∈ ℋ)
18	16, 17	anim12i 625	. . . . . . 7 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑇‘𝑧) ∈ ℋ))
19		hvadd4 31459	. . . . . . 7 ⊢ ((((𝑆‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑆‘𝑧) ∈ ℋ) ∧ ((𝑇‘(𝑥 ·ℎ 𝑦)) ∈ ℋ ∧ (𝑇‘𝑧) ∈ ℋ)) → (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
20	14, 18, 19	syl2anc 596	. . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑆‘𝑧)) +ℎ ((𝑇‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
21	10, 20	eqtrd 2800	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
22		hvaddcl 31435	. . . . . . 7 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
23	6, 22	sylan 592	. . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
24		hosval 32163	. . . . . . 7 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ) → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
25	2, 4, 24	mp3an12 1480	. . . . . 6 ⊢ (((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
26	23, 25	syl 18	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑆‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) +ℎ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
27	2	ffvelcdmi 7082	. . . . . . . . 9 ⊢ (𝑦 ∈ ℋ → (𝑆‘𝑦) ∈ ℋ)
28	4	ffvelcdmi 7082	. . . . . . . . 9 ⊢ (𝑦 ∈ ℋ → (𝑇‘𝑦) ∈ ℋ)
29	27, 28	jca 521	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → ((𝑆‘𝑦) ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ))
30		ax-hvdistr1 31431	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ (𝑆‘𝑦) ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ) → (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
31	30	3expb 1138	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ ((𝑆‘𝑦) ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ)) → (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
32	29, 31	sylan2 605	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
33		hosval 32163	. . . . . . . . . 10 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → ((𝑆 +op 𝑇)‘𝑦) = ((𝑆‘𝑦) +ℎ (𝑇‘𝑦)))
34	2, 4, 33	mp3an12 1480	. . . . . . . . 9 ⊢ (𝑦 ∈ ℋ → ((𝑆 +op 𝑇)‘𝑦) = ((𝑆‘𝑦) +ℎ (𝑇‘𝑦)))
35	34	oveq2d 7435	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) = (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))))
36	35	adantl 487	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) = (𝑥 ·ℎ ((𝑆‘𝑦) +ℎ (𝑇‘𝑦))))
37	1	lnopmuli 32395	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑆‘(𝑥 ·ℎ 𝑦)) = (𝑥 ·ℎ (𝑆‘𝑦)))
38	3	lnopmuli 32395	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 ·ℎ 𝑦)) = (𝑥 ·ℎ (𝑇‘𝑦)))
39	37, 38	oveq12d 7437	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) = ((𝑥 ·ℎ (𝑆‘𝑦)) +ℎ (𝑥 ·ℎ (𝑇‘𝑦))))
40	32, 36, 39	3eqtr4d 2810	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) = ((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))))
41		hosval 32163	. . . . . . 7 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑆 +op 𝑇)‘𝑧) = ((𝑆‘𝑧) +ℎ (𝑇‘𝑧)))
42	2, 4, 41	mp3an12 1480	. . . . . 6 ⊢ (𝑧 ∈ ℋ → ((𝑆 +op 𝑇)‘𝑧) = ((𝑆‘𝑧) +ℎ (𝑇‘𝑧)))
43	40, 42	oveqan12d 7438	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧)) = (((𝑆‘(𝑥 ·ℎ 𝑦)) +ℎ (𝑇‘(𝑥 ·ℎ 𝑦))) +ℎ ((𝑆‘𝑧) +ℎ (𝑇‘𝑧))))
44	21, 26, 43	3eqtr4d 2810	. . . 4 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧)))
45	44	ralrimiva 3159	. . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → ∀𝑧 ∈ ℋ ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧)))
46	45	rgen2 3207	. 2 ⊢ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝑆 +op 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 +op 𝑇)‘𝑦)) +ℎ ((𝑆 +op 𝑇)‘𝑧))
47		ellnop 32281	. 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 2146  ∀wral 3081  ⟶wf 6536  ‘cfv 6540  (class class class)co 7419  ℂcc 11113   ℋchba 31342   +_ℎ cva 31343   ·_ℎ csm 31344   +_op chos 31361  LinOpclo 31370

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-resscn 11172  ax-1cn 11173  ax-icn 11174  ax-addcl 11175  ax-addrcl 11176  ax-mulcl 11177  ax-mulrcl 11178  ax-mulcom 11179  ax-addass 11180  ax-mulass 11181  ax-distr 11182  ax-i2m1 11183  ax-1ne0 11184  ax-1rid 11185  ax-rnegex 11186  ax-rrecex 11187  ax-cnre 11188  ax-pre-lttri 11189  ax-pre-lttrn 11190  ax-pre-ltadd 11191  ax-hilex 31422  ax-hfvadd 31423  ax-hvcom 31424  ax-hvass 31425  ax-hv0cl 31426  ax-hvaddid 31427  ax-hfvmul 31428  ax-hvmulid 31429  ax-hvdistr1 31431  ax-hvdistr2 31432  ax-hvmul0 31433

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-po 5571  df-so 5572  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-er 8700  df-map 8832  df-en 8950  df-dom 8951  df-sdom 8952  df-pnf 11260  df-mnf 11261  df-ltxr 11263  df-sub 11458  df-neg 11459  df-hvsub 31394  df-hosum 32153  df-lnop 32264

This theorem is used by:  lnophdi  32425  bdophsi  32519