| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lnosub | Structured version Visualization version GIF version | ||
| Description: Subtraction property of a linear operator. (Contributed by NM, 7-Dec-2007.) (Revised by Mario Carneiro, 19-Nov-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| lnosub.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| lnosub.5 | ⊢ 𝑀 = ( −𝑣 ‘𝑈) |
| lnosub.6 | ⊢ 𝑁 = ( −𝑣 ‘𝑊) |
| lnosub.7 | ⊢ 𝐿 = (𝑈 LnOp 𝑊) |
| Ref | Expression |
|---|---|
| lnosub | ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘(𝐴𝑀𝐵)) = ((𝑇‘𝐴)𝑁(𝑇‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | neg1cn 12198 | . . . 4 ⊢ -1 ∈ ℂ | |
| 2 | lnosub.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 3 | eqid 2763 | . . . . 5 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊) | |
| 4 | eqid 2763 | . . . . 5 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 5 | eqid 2763 | . . . . 5 ⊢ ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊) | |
| 6 | eqid 2763 | . . . . 5 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
| 7 | eqid 2763 | . . . . 5 ⊢ ( ·𝑠OLD ‘𝑊) = ( ·𝑠OLD ‘𝑊) | |
| 8 | lnosub.7 | . . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊) | |
| 9 | 2, 3, 4, 5, 6, 7, 8 | lnolin 31106 | . . . 4 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (-1 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → (𝑇‘((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 10 | 1, 9 | mp3anr1 1487 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → (𝑇‘((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 11 | 10 | ancom2s 662 | . 2 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 12 | lnosub.5 | . . . . . 6 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
| 13 | 2, 4, 6, 12 | nvmval2 30995 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = ((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
| 14 | 13 | 3expb 1138 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑀𝐵) = ((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
| 15 | 14 | 3ad2antl1 1204 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑀𝐵) = ((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
| 16 | 15 | fveq2d 6885 | . 2 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘(𝐴𝑀𝐵)) = (𝑇‘((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴))) |
| 17 | simpl2 1211 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝑊 ∈ NrmCVec) | |
| 18 | 2, 3, 8 | lnof 31107 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶(BaseSet‘𝑊)) |
| 19 | simpl 487 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 20 | ffvelcdm 7076 | . . . 4 ⊢ ((𝑇:𝑋⟶(BaseSet‘𝑊) ∧ 𝐴 ∈ 𝑋) → (𝑇‘𝐴) ∈ (BaseSet‘𝑊)) | |
| 21 | 18, 19, 20 | syl2an 607 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘𝐴) ∈ (BaseSet‘𝑊)) |
| 22 | simpr 489 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
| 23 | ffvelcdm 7076 | . . . 4 ⊢ ((𝑇:𝑋⟶(BaseSet‘𝑊) ∧ 𝐵 ∈ 𝑋) → (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) | |
| 24 | 18, 22, 23 | syl2an 607 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) |
| 25 | lnosub.6 | . . . 4 ⊢ 𝑁 = ( −𝑣 ‘𝑊) | |
| 26 | 3, 5, 7, 25 | nvmval2 30995 | . . 3 ⊢ ((𝑊 ∈ NrmCVec ∧ (𝑇‘𝐴) ∈ (BaseSet‘𝑊) ∧ (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) → ((𝑇‘𝐴)𝑁(𝑇‘𝐵)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 27 | 17, 21, 24, 26 | syl3anc 1398 | . 2 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝑇‘𝐴)𝑁(𝑇‘𝐵)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 28 | 11, 16, 27 | 3eqtr4d 2808 | 1 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘(𝐴𝑀𝐵)) = ((𝑇‘𝐴)𝑁(𝑇‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ℂcc 11093 1c1 11096 -cneg 11437 NrmCVeccnv 30936 +𝑣 cpv 30937 BaseSetcba 30938 ·𝑠OLD cns 30939 −𝑣 cnsb 30941 LnOp clno 31092 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-po 5569 df-so 5570 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7982 df-2nd 7983 df-er 8690 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-ltxr 11243 df-sub 11438 df-neg 11439 df-grpo 30845 df-gid 30846 df-ginv 30847 df-gdiv 30848 df-ablo 30897 df-vc 30911 df-nv 30944 df-va 30947 df-ba 30948 df-sm 30949 df-0v 30950 df-vs 30951 df-nmcv 30952 df-lno 31096 |
| This theorem is referenced by: blometi 31155 blocnilem 31156 ubthlem2 31223 |
| Copyright terms: Public domain | W3C validator |