MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lnoadd Unicode version

Theorem lnoadd 21336
Description: Addition property of a linear operator. (Contributed by NM, 7-Dec-2007.) (Revised by Mario Carneiro, 19-Nov-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
lnoadd.1  |-  X  =  ( BaseSet `  U )
lnoadd.5  |-  G  =  ( +v `  U
)
lnoadd.6  |-  H  =  ( +v `  W
)
lnoadd.7  |-  L  =  ( U  LnOp  W
)
Assertion
Ref Expression
lnoadd  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  ( T `  ( A G B ) )  =  ( ( T `  A
) H ( T `
 B ) ) )

Proof of Theorem lnoadd
StepHypRef Expression
1 ax-1cn 8795 . . 3  |-  1  e.  CC
2 lnoadd.1 . . . 4  |-  X  =  ( BaseSet `  U )
3 eqid 2283 . . . 4  |-  ( BaseSet `  W )  =  (
BaseSet `  W )
4 lnoadd.5 . . . 4  |-  G  =  ( +v `  U
)
5 lnoadd.6 . . . 4  |-  H  =  ( +v `  W
)
6 eqid 2283 . . . 4  |-  ( .s
OLD `  U )  =  ( .s OLD `  U )
7 eqid 2283 . . . 4  |-  ( .s
OLD `  W )  =  ( .s OLD `  W )
8 lnoadd.7 . . . 4  |-  L  =  ( U  LnOp  W
)
92, 3, 4, 5, 6, 7, 8lnolin 21332 . . 3  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  (
1  e.  CC  /\  A  e.  X  /\  B  e.  X )
)  ->  ( T `  ( ( 1 ( .s OLD `  U
) A ) G B ) )  =  ( ( 1 ( .s OLD `  W
) ( T `  A ) ) H ( T `  B
) ) )
101, 9mp3anr1 1274 . 2  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  ( T `  ( ( 1 ( .s OLD `  U
) A ) G B ) )  =  ( ( 1 ( .s OLD `  W
) ( T `  A ) ) H ( T `  B
) ) )
11 simp1 955 . . . . 5  |-  ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  ->  U  e.  NrmCVec )
12 simpl 443 . . . . 5  |-  ( ( A  e.  X  /\  B  e.  X )  ->  A  e.  X )
132, 6nvsid 21185 . . . . 5  |-  ( ( U  e.  NrmCVec  /\  A  e.  X )  ->  (
1 ( .s OLD `  U ) A )  =  A )
1411, 12, 13syl2an 463 . . . 4  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  ( 1 ( .s OLD `  U
) A )  =  A )
1514oveq1d 5873 . . 3  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  ( (
1 ( .s OLD `  U ) A ) G B )  =  ( A G B ) )
1615fveq2d 5529 . 2  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  ( T `  ( ( 1 ( .s OLD `  U
) A ) G B ) )  =  ( T `  ( A G B ) ) )
17 simpl2 959 . . . 4  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  W  e.  NrmCVec )
182, 3, 8lnof 21333 . . . . 5  |-  ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  ->  T : X --> ( BaseSet `  W
) )
19 ffvelrn 5663 . . . . 5  |-  ( ( T : X --> ( BaseSet `  W )  /\  A  e.  X )  ->  ( T `  A )  e.  ( BaseSet `  W )
)
2018, 12, 19syl2an 463 . . . 4  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  ( T `  A )  e.  (
BaseSet `  W ) )
213, 7nvsid 21185 . . . 4  |-  ( ( W  e.  NrmCVec  /\  ( T `  A )  e.  ( BaseSet `  W )
)  ->  ( 1 ( .s OLD `  W
) ( T `  A ) )  =  ( T `  A
) )
2217, 20, 21syl2anc 642 . . 3  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  ( 1 ( .s OLD `  W
) ( T `  A ) )  =  ( T `  A
) )
2322oveq1d 5873 . 2  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  ( (
1 ( .s OLD `  W ) ( T `
 A ) ) H ( T `  B ) )  =  ( ( T `  A ) H ( T `  B ) ) )
2410, 16, 233eqtr3d 2323 1  |-  ( ( ( U  e.  NrmCVec  /\  W  e.  NrmCVec  /\  T  e.  L )  /\  ( A  e.  X  /\  B  e.  X )
)  ->  ( T `  ( A G B ) )  =  ( ( T `  A
) H ( T `
 B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684   -->wf 5251   ` cfv 5255  (class class class)co 5858   CCcc 8735   1c1 8738   NrmCVeccnv 21140   +vcpv 21141   BaseSetcba 21142   .s
OLDcns 21143    LnOp clno 21318
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-1cn 8795
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-map 6774  df-vc 21102  df-nv 21148  df-va 21151  df-ba 21152  df-sm 21153  df-0v 21154  df-nmcv 21156  df-lno 21322
  Copyright terms: Public domain W3C validator