Theorem lnocoi 31359

Description: The composition of two linear operators is linear. (Contributed by NM, 12-Jan-2008.) (Revised by Mario Carneiro, 19-Nov-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lnocoi.l	⊢ 𝐿 = (𝑈 LnOp 𝑊)
lnocoi.m	⊢ 𝑀 = (𝑊 LnOp 𝑋)
lnocoi.n	⊢ 𝑁 = (𝑈 LnOp 𝑋)
lnocoi.u	⊢ 𝑈 ∈ NrmCVec
lnocoi.w	⊢ 𝑊 ∈ NrmCVec
lnocoi.x	⊢ 𝑋 ∈ NrmCVec
lnocoi.s	⊢ 𝑆 ∈ 𝐿
lnocoi.t	⊢ 𝑇 ∈ 𝑀

Assertion

Ref	Expression
lnocoi	⊢ (𝑇 ∘ 𝑆) ∈ 𝑁

Proof of Theorem lnocoi

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

Step	Hyp	Ref	Expression
1		lnocoi.w	. . . 4 ⊢ 𝑊 ∈ NrmCVec
2		lnocoi.x	. . . 4 ⊢ 𝑋 ∈ NrmCVec
3		lnocoi.t	. . . 4 ⊢ 𝑇 ∈ 𝑀
4		eqid 2761	. . . . 5 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊)
5		eqid 2761	. . . . 5 ⊢ (BaseSet‘𝑋) = (BaseSet‘𝑋)
6		lnocoi.m	. . . . 5 ⊢ 𝑀 = (𝑊 LnOp 𝑋)
7	4, 5, 6	lnof 31357	. . . 4 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑋 ∈ NrmCVec ∧ 𝑇 ∈ 𝑀) → 𝑇:(BaseSet‘𝑊)⟶(BaseSet‘𝑋))
8	1, 2, 3, 7	mp3an 1490	. . 3 ⊢ 𝑇:(BaseSet‘𝑊)⟶(BaseSet‘𝑋)
9		lnocoi.u	. . . 4 ⊢ 𝑈 ∈ NrmCVec
10		lnocoi.s	. . . 4 ⊢ 𝑆 ∈ 𝐿
11		eqid 2761	. . . . 5 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
12		lnocoi.l	. . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
13	11, 4, 12	lnof 31357	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑆 ∈ 𝐿) → 𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊))
14	9, 1, 10, 13	mp3an 1490	. . 3 ⊢ 𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)
15		fco 6734	. . 3 ⊢ ((𝑇:(BaseSet‘𝑊)⟶(BaseSet‘𝑋) ∧ 𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → (𝑇 ∘ 𝑆):(BaseSet‘𝑈)⟶(BaseSet‘𝑋))
16	8, 14, 15	mp2an 705	. 2 ⊢ (𝑇 ∘ 𝑆):(BaseSet‘𝑈)⟶(BaseSet‘𝑋)
17		eqid 2761	. . . . . . . 8 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈)
18	11, 17	nvscl 31228	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈)) → (𝑥( ·𝑠OLD ‘𝑈)𝑦) ∈ (BaseSet‘𝑈))
19	9, 18	mp3an1 1477	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈)) → (𝑥( ·𝑠OLD ‘𝑈)𝑦) ∈ (BaseSet‘𝑈))
20		eqid 2761	. . . . . . . 8 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈)
21	11, 20	nvgcl 31222	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝑥( ·𝑠OLD ‘𝑈)𝑦) ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧) ∈ (BaseSet‘𝑈))
22	9, 21	mp3an1 1477	. . . . . 6 ⊢ (((𝑥( ·𝑠OLD ‘𝑈)𝑦) ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧) ∈ (BaseSet‘𝑈))
23	19, 22	stoic3 1809	. . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧) ∈ (BaseSet‘𝑈))
24		fvco3 6985	. . . . 5 ⊢ ((𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊) ∧ ((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧) ∈ (BaseSet‘𝑈)) → ((𝑇 ∘ 𝑆)‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = (𝑇‘(𝑆‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧))))
25	14, 23, 24	sylancr 599	. . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇 ∘ 𝑆)‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = (𝑇‘(𝑆‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧))))
26		id 23	. . . . . 6 ⊢ (𝑥 ∈ ℂ → 𝑥 ∈ ℂ)
27	14	ffvelcdmi 7083	. . . . . 6 ⊢ (𝑦 ∈ (BaseSet‘𝑈) → (𝑆‘𝑦) ∈ (BaseSet‘𝑊))
28	14	ffvelcdmi 7083	. . . . . 6 ⊢ (𝑧 ∈ (BaseSet‘𝑈) → (𝑆‘𝑧) ∈ (BaseSet‘𝑊))
29	1, 2, 3	3pm3.2i 1358	. . . . . . 7 ⊢ (𝑊 ∈ NrmCVec ∧ 𝑋 ∈ NrmCVec ∧ 𝑇 ∈ 𝑀)
30		eqid 2761	. . . . . . . 8 ⊢ ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊)
31		eqid 2761	. . . . . . . 8 ⊢ ( +𝑣 ‘𝑋) = ( +𝑣 ‘𝑋)
32		eqid 2761	. . . . . . . 8 ⊢ ( ·𝑠OLD ‘𝑊) = ( ·𝑠OLD ‘𝑊)
33		eqid 2761	. . . . . . . 8 ⊢ ( ·𝑠OLD ‘𝑋) = ( ·𝑠OLD ‘𝑋)
34	4, 5, 30, 31, 32, 33, 6	lnolin 31356	. . . . . . 7 ⊢ (((𝑊 ∈ NrmCVec ∧ 𝑋 ∈ NrmCVec ∧ 𝑇 ∈ 𝑀) ∧ (𝑥 ∈ ℂ ∧ (𝑆‘𝑦) ∈ (BaseSet‘𝑊) ∧ (𝑆‘𝑧) ∈ (BaseSet‘𝑊))) → (𝑇‘((𝑥( ·𝑠OLD ‘𝑊)(𝑆‘𝑦))( +𝑣 ‘𝑊)(𝑆‘𝑧))) = ((𝑥( ·𝑠OLD ‘𝑋)(𝑇‘(𝑆‘𝑦)))( +𝑣 ‘𝑋)(𝑇‘(𝑆‘𝑧))))
35	29, 34	mpan 703	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ (𝑆‘𝑦) ∈ (BaseSet‘𝑊) ∧ (𝑆‘𝑧) ∈ (BaseSet‘𝑊)) → (𝑇‘((𝑥( ·𝑠OLD ‘𝑊)(𝑆‘𝑦))( +𝑣 ‘𝑊)(𝑆‘𝑧))) = ((𝑥( ·𝑠OLD ‘𝑋)(𝑇‘(𝑆‘𝑦)))( +𝑣 ‘𝑋)(𝑇‘(𝑆‘𝑧))))
36	26, 27, 28, 35	syl3an 1178	. . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑇‘((𝑥( ·𝑠OLD ‘𝑊)(𝑆‘𝑦))( +𝑣 ‘𝑊)(𝑆‘𝑧))) = ((𝑥( ·𝑠OLD ‘𝑋)(𝑇‘(𝑆‘𝑦)))( +𝑣 ‘𝑋)(𝑇‘(𝑆‘𝑧))))
37	9, 1, 10	3pm3.2i 1358	. . . . . . 7 ⊢ (𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑆 ∈ 𝐿)
38	11, 4, 20, 30, 17, 32, 12	lnolin 31356	. . . . . . 7 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑆‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(𝑆‘𝑦))( +𝑣 ‘𝑊)(𝑆‘𝑧)))
39	37, 38	mpan 703	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑆‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(𝑆‘𝑦))( +𝑣 ‘𝑊)(𝑆‘𝑧)))
40	39	fveq2d 6889	. . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑇‘(𝑆‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧))) = (𝑇‘((𝑥( ·𝑠OLD ‘𝑊)(𝑆‘𝑦))( +𝑣 ‘𝑊)(𝑆‘𝑧))))
41		simp2 1155	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → 𝑦 ∈ (BaseSet‘𝑈))
42		fvco3 6985	. . . . . . . 8 ⊢ ((𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊) ∧ 𝑦 ∈ (BaseSet‘𝑈)) → ((𝑇 ∘ 𝑆)‘𝑦) = (𝑇‘(𝑆‘𝑦)))
43	14, 41, 42	sylancr 599	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇 ∘ 𝑆)‘𝑦) = (𝑇‘(𝑆‘𝑦)))
44	43	oveq2d 7436	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑥( ·𝑠OLD ‘𝑋)((𝑇 ∘ 𝑆)‘𝑦)) = (𝑥( ·𝑠OLD ‘𝑋)(𝑇‘(𝑆‘𝑦))))
45		simp3 1156	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → 𝑧 ∈ (BaseSet‘𝑈))
46		fvco3 6985	. . . . . . 7 ⊢ ((𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇 ∘ 𝑆)‘𝑧) = (𝑇‘(𝑆‘𝑧)))
47	14, 45, 46	sylancr 599	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇 ∘ 𝑆)‘𝑧) = (𝑇‘(𝑆‘𝑧)))
48	44, 47	oveq12d 7438	. . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD ‘𝑋)((𝑇 ∘ 𝑆)‘𝑦))( +𝑣 ‘𝑋)((𝑇 ∘ 𝑆)‘𝑧)) = ((𝑥( ·𝑠OLD ‘𝑋)(𝑇‘(𝑆‘𝑦)))( +𝑣 ‘𝑋)(𝑇‘(𝑆‘𝑧))))
49	36, 40, 48	3eqtr4rd 2807	. . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD ‘𝑋)((𝑇 ∘ 𝑆)‘𝑦))( +𝑣 ‘𝑋)((𝑇 ∘ 𝑆)‘𝑧)) = (𝑇‘(𝑆‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧))))
50	25, 49	eqtr4d 2799	. . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇 ∘ 𝑆)‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑋)((𝑇 ∘ 𝑆)‘𝑦))( +𝑣 ‘𝑋)((𝑇 ∘ 𝑆)‘𝑧)))
51	50	rgen3 3208	. 2 ⊢ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)((𝑇 ∘ 𝑆)‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑋)((𝑇 ∘ 𝑆)‘𝑦))( +𝑣 ‘𝑋)((𝑇 ∘ 𝑆)‘𝑧))
52		lnocoi.n	. . . 4 ⊢ 𝑁 = (𝑈 LnOp 𝑋)
53	11, 5, 20, 31, 17, 33, 52	islno 31355	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑋 ∈ NrmCVec) → ((𝑇 ∘ 𝑆) ∈ 𝑁 ↔ ((𝑇 ∘ 𝑆):(BaseSet‘𝑈)⟶(BaseSet‘𝑋) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)((𝑇 ∘ 𝑆)‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑋)((𝑇 ∘ 𝑆)‘𝑦))( +𝑣 ‘𝑋)((𝑇 ∘ 𝑆)‘𝑧)))))
54	9, 2, 53	mp2an 705	. 2 ⊢ ((𝑇 ∘ 𝑆) ∈ 𝑁 ↔ ((𝑇 ∘ 𝑆):(BaseSet‘𝑈)⟶(BaseSet‘𝑋) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)((𝑇 ∘ 𝑆)‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑋)((𝑇 ∘ 𝑆)‘𝑦))( +𝑣 ‘𝑋)((𝑇 ∘ 𝑆)‘𝑧))))
55	16, 51, 54	mpbir2an 724	1 ⊢ (𝑇 ∘ 𝑆) ∈ 𝑁

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ∘ ccom 5655  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  ℂcc 11198  NrmCVeccnv 31186   +_𝑣 cpv 31187  BaseSetcba 31188   ·_𝑠OLD cns 31189   LnOp clno 31342

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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  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 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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8849  df-grpo 31095  df-ablo 31147  df-vc 31161  df-nv 31194  df-va 31197  df-ba 31198  df-sm 31199  df-0v 31200  df-nmcv 31202  df-lno 31346

This theorem is used by: (None)