Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  lnocoi Structured version   Visualization version   GIF version

Theorem lnocoi 26996
 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.
StepHypRef Expression
1 lnocoi.w . . . 4 𝑊 ∈ NrmCVec
2 lnocoi.x . . . 4 𝑋 ∈ NrmCVec
3 lnocoi.t . . . 4 𝑇𝑀
4 eqid 2610 . . . . 5 (BaseSet‘𝑊) = (BaseSet‘𝑊)
5 eqid 2610 . . . . 5 (BaseSet‘𝑋) = (BaseSet‘𝑋)
6 lnocoi.m . . . . 5 𝑀 = (𝑊 LnOp 𝑋)
74, 5, 6lnof 26994 . . . 4 ((𝑊 ∈ NrmCVec ∧ 𝑋 ∈ NrmCVec ∧ 𝑇𝑀) → 𝑇:(BaseSet‘𝑊)⟶(BaseSet‘𝑋))
81, 2, 3, 7mp3an 1416 . . 3 𝑇:(BaseSet‘𝑊)⟶(BaseSet‘𝑋)
9 lnocoi.u . . . 4 𝑈 ∈ NrmCVec
10 lnocoi.s . . . 4 𝑆𝐿
11 eqid 2610 . . . . 5 (BaseSet‘𝑈) = (BaseSet‘𝑈)
12 lnocoi.l . . . . 5 𝐿 = (𝑈 LnOp 𝑊)
1311, 4, 12lnof 26994 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑆𝐿) → 𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊))
149, 1, 10, 13mp3an 1416 . . 3 𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)
15 fco 5971 . . 3 ((𝑇:(BaseSet‘𝑊)⟶(BaseSet‘𝑋) ∧ 𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → (𝑇𝑆):(BaseSet‘𝑈)⟶(BaseSet‘𝑋))
168, 14, 15mp2an 704 . 2 (𝑇𝑆):(BaseSet‘𝑈)⟶(BaseSet‘𝑋)
17 eqid 2610 . . . . . . . 8 ( ·𝑠OLD𝑈) = ( ·𝑠OLD𝑈)
1811, 17nvscl 26865 . . . . . . 7 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈)) → (𝑥( ·𝑠OLD𝑈)𝑦) ∈ (BaseSet‘𝑈))
199, 18mp3an1 1403 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈)) → (𝑥( ·𝑠OLD𝑈)𝑦) ∈ (BaseSet‘𝑈))
20 eqid 2610 . . . . . . . 8 ( +𝑣𝑈) = ( +𝑣𝑈)
2111, 20nvgcl 26859 . . . . . . 7 ((𝑈 ∈ NrmCVec ∧ (𝑥( ·𝑠OLD𝑈)𝑦) ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧) ∈ (BaseSet‘𝑈))
229, 21mp3an1 1403 . . . . . 6 (((𝑥( ·𝑠OLD𝑈)𝑦) ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧) ∈ (BaseSet‘𝑈))
2319, 22stoic3 1692 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧) ∈ (BaseSet‘𝑈))
24 fvco3 6185 . . . . 5 ((𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊) ∧ ((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧) ∈ (BaseSet‘𝑈)) → ((𝑇𝑆)‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧)) = (𝑇‘(𝑆‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧))))
2514, 23, 24sylancr 694 . . . 4 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇𝑆)‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧)) = (𝑇‘(𝑆‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧))))
26 id 22 . . . . . 6 (𝑥 ∈ ℂ → 𝑥 ∈ ℂ)
2714ffvelrni 6266 . . . . . 6 (𝑦 ∈ (BaseSet‘𝑈) → (𝑆𝑦) ∈ (BaseSet‘𝑊))
2814ffvelrni 6266 . . . . . 6 (𝑧 ∈ (BaseSet‘𝑈) → (𝑆𝑧) ∈ (BaseSet‘𝑊))
291, 2, 33pm3.2i 1232 . . . . . . 7 (𝑊 ∈ NrmCVec ∧ 𝑋 ∈ NrmCVec ∧ 𝑇𝑀)
30 eqid 2610 . . . . . . . 8 ( +𝑣𝑊) = ( +𝑣𝑊)
31 eqid 2610 . . . . . . . 8 ( +𝑣𝑋) = ( +𝑣𝑋)
32 eqid 2610 . . . . . . . 8 ( ·𝑠OLD𝑊) = ( ·𝑠OLD𝑊)
33 eqid 2610 . . . . . . . 8 ( ·𝑠OLD𝑋) = ( ·𝑠OLD𝑋)
344, 5, 30, 31, 32, 33, 6lnolin 26993 . . . . . . 7 (((𝑊 ∈ NrmCVec ∧ 𝑋 ∈ NrmCVec ∧ 𝑇𝑀) ∧ (𝑥 ∈ ℂ ∧ (𝑆𝑦) ∈ (BaseSet‘𝑊) ∧ (𝑆𝑧) ∈ (BaseSet‘𝑊))) → (𝑇‘((𝑥( ·𝑠OLD𝑊)(𝑆𝑦))( +𝑣𝑊)(𝑆𝑧))) = ((𝑥( ·𝑠OLD𝑋)(𝑇‘(𝑆𝑦)))( +𝑣𝑋)(𝑇‘(𝑆𝑧))))
3529, 34mpan 702 . . . . . 6 ((𝑥 ∈ ℂ ∧ (𝑆𝑦) ∈ (BaseSet‘𝑊) ∧ (𝑆𝑧) ∈ (BaseSet‘𝑊)) → (𝑇‘((𝑥( ·𝑠OLD𝑊)(𝑆𝑦))( +𝑣𝑊)(𝑆𝑧))) = ((𝑥( ·𝑠OLD𝑋)(𝑇‘(𝑆𝑦)))( +𝑣𝑋)(𝑇‘(𝑆𝑧))))
3626, 27, 28, 35syl3an 1360 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑇‘((𝑥( ·𝑠OLD𝑊)(𝑆𝑦))( +𝑣𝑊)(𝑆𝑧))) = ((𝑥( ·𝑠OLD𝑋)(𝑇‘(𝑆𝑦)))( +𝑣𝑋)(𝑇‘(𝑆𝑧))))
379, 1, 103pm3.2i 1232 . . . . . . 7 (𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑆𝐿)
3811, 4, 20, 30, 17, 32, 12lnolin 26993 . . . . . . 7 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑆𝐿) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑆‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧)) = ((𝑥( ·𝑠OLD𝑊)(𝑆𝑦))( +𝑣𝑊)(𝑆𝑧)))
3937, 38mpan 702 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑆‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧)) = ((𝑥( ·𝑠OLD𝑊)(𝑆𝑦))( +𝑣𝑊)(𝑆𝑧)))
4039fveq2d 6107 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑇‘(𝑆‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧))) = (𝑇‘((𝑥( ·𝑠OLD𝑊)(𝑆𝑦))( +𝑣𝑊)(𝑆𝑧))))
41 simp2 1055 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → 𝑦 ∈ (BaseSet‘𝑈))
42 fvco3 6185 . . . . . . . 8 ((𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊) ∧ 𝑦 ∈ (BaseSet‘𝑈)) → ((𝑇𝑆)‘𝑦) = (𝑇‘(𝑆𝑦)))
4314, 41, 42sylancr 694 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇𝑆)‘𝑦) = (𝑇‘(𝑆𝑦)))
4443oveq2d 6565 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑥( ·𝑠OLD𝑋)((𝑇𝑆)‘𝑦)) = (𝑥( ·𝑠OLD𝑋)(𝑇‘(𝑆𝑦))))
45 simp3 1056 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → 𝑧 ∈ (BaseSet‘𝑈))
46 fvco3 6185 . . . . . . 7 ((𝑆:(BaseSet‘𝑈)⟶(BaseSet‘𝑊) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇𝑆)‘𝑧) = (𝑇‘(𝑆𝑧)))
4714, 45, 46sylancr 694 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇𝑆)‘𝑧) = (𝑇‘(𝑆𝑧)))
4844, 47oveq12d 6567 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD𝑋)((𝑇𝑆)‘𝑦))( +𝑣𝑋)((𝑇𝑆)‘𝑧)) = ((𝑥( ·𝑠OLD𝑋)(𝑇‘(𝑆𝑦)))( +𝑣𝑋)(𝑇‘(𝑆𝑧))))
4936, 40, 483eqtr4rd 2655 . . . 4 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD𝑋)((𝑇𝑆)‘𝑦))( +𝑣𝑋)((𝑇𝑆)‘𝑧)) = (𝑇‘(𝑆‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧))))
5025, 49eqtr4d 2647 . . 3 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑇𝑆)‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧)) = ((𝑥( ·𝑠OLD𝑋)((𝑇𝑆)‘𝑦))( +𝑣𝑋)((𝑇𝑆)‘𝑧)))
5150rgen3 2959 . 2 𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)((𝑇𝑆)‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧)) = ((𝑥( ·𝑠OLD𝑋)((𝑇𝑆)‘𝑦))( +𝑣𝑋)((𝑇𝑆)‘𝑧))
52 lnocoi.n . . . 4 𝑁 = (𝑈 LnOp 𝑋)
5311, 5, 20, 31, 17, 33, 52islno 26992 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑋 ∈ NrmCVec) → ((𝑇𝑆) ∈ 𝑁 ↔ ((𝑇𝑆):(BaseSet‘𝑈)⟶(BaseSet‘𝑋) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)((𝑇𝑆)‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧)) = ((𝑥( ·𝑠OLD𝑋)((𝑇𝑆)‘𝑦))( +𝑣𝑋)((𝑇𝑆)‘𝑧)))))
549, 2, 53mp2an 704 . 2 ((𝑇𝑆) ∈ 𝑁 ↔ ((𝑇𝑆):(BaseSet‘𝑈)⟶(BaseSet‘𝑋) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)((𝑇𝑆)‘((𝑥( ·𝑠OLD𝑈)𝑦)( +𝑣𝑈)𝑧)) = ((𝑥( ·𝑠OLD𝑋)((𝑇𝑆)‘𝑦))( +𝑣𝑋)((𝑇𝑆)‘𝑧))))
5516, 51, 54mpbir2an 957 1 (𝑇𝑆) ∈ 𝑁
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  ∀wral 2896   ∘ ccom 5042  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549  ℂcc 9813  NrmCVeccnv 26823   +𝑣 cpv 26824  BaseSetcba 26825   ·𝑠OLD cns 26826   LnOp clno 26979 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-map 7746  df-grpo 26731  df-ablo 26783  df-vc 26798  df-nv 26831  df-va 26834  df-ba 26835  df-sm 26836  df-0v 26837  df-nmcv 26839  df-lno 26983 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator