Theorem lnopcoi 32662

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 32628	. . 3 ⊢ 𝑆: ℋ⟶ ℋ
3		lnopco.2	. . . 4 ⊢ 𝑇 ∈ LinOp
4	3	lnopfi 32628	. . 3 ⊢ 𝑇: ℋ⟶ ℋ
5	2, 4	hocofi 32425	. 2 ⊢ (𝑆 ∘ 𝑇): ℋ⟶ ℋ
6	3	lnopli 32627	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)))
7	6	fveq2d 6920	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = (𝑆‘((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
8		id 23	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → 𝑥 ∈ ℂ)
9	4	ffvelcdmi 7115	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑇‘𝑦) ∈ ℋ)
10	4	ffvelcdmi 7115	. . . . . . . 8 ⊢ (𝑧 ∈ ℋ → (𝑇‘𝑧) ∈ ℋ)
11	1	lnopli 32627	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ (𝑇‘𝑦) ∈ ℋ ∧ (𝑇‘𝑧) ∈ ℋ) → (𝑆‘((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
12	8, 9, 10, 11	syl3an 1178	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑆‘((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
13	7, 12	eqtrd 2798	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
14	13	3expa 1136	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
15		hvmulcl 31672	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ 𝑦) ∈ ℋ)
16		hvaddcl 31671	. . . . . . 7 ⊢ (((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
17	15, 16	sylan 592	. . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ)
18	2, 4	hocoi 32423	. . . . . 6 ⊢ (((𝑥 ·ℎ 𝑦) +ℎ 𝑧) ∈ ℋ → ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
19	17, 18	syl 18	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑆‘(𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧))))
20	2, 4	hocoi 32423	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → ((𝑆 ∘ 𝑇)‘𝑦) = (𝑆‘(𝑇‘𝑦)))
21	20	oveq2d 7467	. . . . . . 7 ⊢ (𝑦 ∈ ℋ → (𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) = (𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))))
22	21	adantl 487	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) = (𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))))
23	2, 4	hocoi 32423	. . . . . 6 ⊢ (𝑧 ∈ ℋ → ((𝑆 ∘ 𝑇)‘𝑧) = (𝑆‘(𝑇‘𝑧)))
24	22, 23	oveqan12d 7470	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧)) = ((𝑥 ·ℎ (𝑆‘(𝑇‘𝑦))) +ℎ (𝑆‘(𝑇‘𝑧))))
25	14, 19, 24	3eqtr4d 2808	. . . 4 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧)))
26	25	3impa 1127	. . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧)))
27	26	rgen3 3211	. 2 ⊢ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧))
28		ellnop 32517	. 2 ⊢ ((𝑆 ∘ 𝑇) ∈ LinOp ↔ ((𝑆 ∘ 𝑇): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ ((𝑆 ∘ 𝑇)‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ ((𝑆 ∘ 𝑇)‘𝑦)) +ℎ ((𝑆 ∘ 𝑇)‘𝑧))))
29	5, 27, 28	mpbir2an 724	1 ⊢ (𝑆 ∘ 𝑇) ∈ LinOp

This proof depends on syntax axioms:   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ∘ ccom 5662  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  ℂcc 11237   ℋchba 31578   +_ℎ cva 31579   ·_ℎ csm 31580  LinOpclo 31606

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-hilex 31658  ax-hfvadd 31659  ax-hfvmul 31664

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-lnop 32500

This theorem is used by:  lnopco0i  32663  nmopcoi  32754  bdopcoi  32757  nmopcoadj0i  32762