Theorem lnopcoi 32484

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

Hypotheses

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

Assertion

Ref	Expression
lnopcoi	⊢ (𝑆 ∘ 𝑇) ∈ LinOp

Proof of Theorem lnopcoi

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	hocofi 32247	. 2 ⊢ (𝑆 ∘ 𝑇): ℋ⟶ ℋ
6	3	lnopli 32449	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)))
7	6	fveq2d 6882	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (𝑆‘((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
8		id 23	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → 𝑥 ∈ ℂ)
9	4	ffvelcdmi 7076	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑇‘𝑦) ∈ ℋ)
10	4	ffvelcdmi 7076	. . . . . . . 8 ⊢ (𝑧 ∈ ℋ → (𝑇‘𝑧) ∈ ℋ)
11	1	lnopli 32449	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ (𝑇‘𝑦) ∈ ℋ ∧ (𝑇‘𝑧) ∈ ℋ) → (𝑆‘((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
12	8, 9, 10, 11	syl3an 1178	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑆‘((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
13	7, 12	eqtrd 2795	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
14	13	3expa 1136	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
15		hvmulcl 31494	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ 𝑦) ∈ ℋ)
16		hvaddcl 31493	. . . . . . 7 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
17	15, 16	sylan 592	. . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
18	2, 4	hocoi 32245	. . . . . 6 ⊢ (((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ → ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
19	17, 18	syl 18	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
20	2, 4	hocoi 32245	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → ((𝑆 ∘ 𝑇)‘𝑦) = (𝑆‘(𝑇‘𝑦)))
21	20	oveq2d 7429	. . . . . . 7 ⊢ (𝑦 ∈ ℋ → (𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) = (𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))))
22	21	adantl 487	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) = (𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))))
23	2, 4	hocoi 32245	. . . . . 6 ⊢ (𝑧 ∈ ℋ → ((𝑆 ∘ 𝑇)‘𝑧) = (𝑆‘(𝑇‘𝑧)))
24	22, 23	oveqan12d 7432	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧)) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
25	14, 19, 24	3eqtr4d 2805	. . . 4 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧)))
26	25	3impa 1127	. . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧)))
27	26	rgen3 3207	. 2 ⊢ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧))
28		ellnop 32339	. 2 ⊢ ((𝑆 ∘ 𝑇) ∈ LinOp ↔ ((𝑆 ∘ 𝑇): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧))))
29	5, 27, 28	mpbir2an 724	1 ⊢ (𝑆 ∘ 𝑇) ∈ LinOp

This proof depends on syntax axioms:   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ∘ ccom 5659  ⟶wf 6529  ‘cfv 6533  (class class class)co 7413  ℂcc 11122   ℋchba 31400   +_ℎ cva 31401   ·_ℎ csm 31402  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-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-hilex 31480  ax-hfvadd 31481  ax-hfvmul 31486

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  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-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-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-map 8828  df-lnop 32322

This theorem is used by:  lnopco0i  32485  nmopcoi  32576  bdopcoi  32579  nmopcoadj0i  32584