| 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 12318 | . . . 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 31371 | . . . 4 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ ( -1 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → (𝑇‘(( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = (( -1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 10 | 1, 9 | mp3anr1 1487 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → (𝑇‘(( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = (( -1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 11 | 10 | ancom2s 663 | . 2 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘(( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = (( -1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 12 | lnosub.5 | . . . . . 6 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
| 13 | 2, 4, 6, 12 | nvmval2 31260 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
| 14 | 13 | 3expb 1138 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑀𝐵) = (( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
| 15 | 14 | 3ad2antl1 1204 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑀𝐵) = (( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
| 16 | 15 | fveq2d 6900 | . 2 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘(𝐴𝑀𝐵)) = (𝑇‘(( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴))) |
| 17 | simpl2 1211 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝑊 ∈ NrmCVec) | |
| 18 | 2, 3, 8 | lnof 31372 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶(BaseSet‘𝑊)) |
| 19 | simpl 488 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 20 | ffvelcdm 7092 | . . . 4 ⊢ ((𝑇:𝑋⟶(BaseSet‘𝑊) ∧ 𝐴 ∈ 𝑋) → (𝑇‘𝐴) ∈ (BaseSet‘𝑊)) | |
| 21 | 18, 19, 20 | syl2an 608 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘𝐴) ∈ (BaseSet‘𝑊)) |
| 22 | simpr 490 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
| 23 | ffvelcdm 7092 | . . . 4 ⊢ ((𝑇:𝑋⟶(BaseSet‘𝑊) ∧ 𝐵 ∈ 𝑋) → (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) | |
| 24 | 18, 22, 23 | syl2an 608 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) |
| 25 | lnosub.6 | . . . 4 ⊢ 𝑁 = ( −𝑣 ‘𝑊) | |
| 26 | 3, 5, 7, 25 | nvmval2 31260 | . . 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 |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 ⟶wf 6543 ‘cfv 6547 (class class class)co 7430 ℂcc 11211 1c1 11214 -cneg 11555 NrmCVeccnv 31201 +𝑣 cpv 31202 BaseSetcba 31203 ·𝑠OLD cns 31204 −𝑣 cnsb 31206 LnOp clno 31357 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-mulcom 11277 ax-addass 11278 ax-mulass 11279 ax-distr 11280 ax-i2m1 11281 ax-1ne0 11282 ax-1rid 11283 ax-rnegex 11284 ax-rrecex 11285 ax-cnre 11286 ax-pre-lttri 11287 ax-pre-lttrn 11288 ax-pre-ltadd 11289 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-1st 8011 df-2nd 8012 df-er 8731 df-map 8863 df-en 8988 df-dom 8989 df-sdom 8990 df-pnf 11358 df-mnf 11359 df-ltxr 11361 df-sub 11556 df-neg 11557 df-grpo 31110 df-gid 31111 df-ginv 31112 df-gdiv 31113 df-ablo 31162 df-vc 31176 df-nv 31209 df-va 31212 df-ba 31213 df-sm 31214 df-0v 31215 df-vs 31216 df-nmcv 31217 df-lno 31361 |
| This theorem is used by: blometi 31420 blocnilem 31421 ubthlem2 31488 |
| Copyright terms: Public domain | W3C validator |