Theorem lnopcoi 32614

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

This proof depends on syntax axioms:   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ∘ ccom 5655  ⟶wf 6539  ‘cfv 6543  (class class class)co 7424  ℂcc 11205   ℋchba 31530   +_ℎ cva 31531   ·_ℎ csm 31532  LinOpclo 31558

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-hilex 31610  ax-hfvadd 31611  ax-hfvmul 31616

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-map 8857  df-lnop 32452

This theorem is used by:  lnopco0i  32615  nmopcoi  32706  bdopcoi  32709  nmopcoadj0i  32714