| 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 12345 | . . . 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 31413 | . . . 4 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ ( -1 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → (𝑇‘(( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = (( -1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 10 | 1, 9 | mp3anr1 1488 | . . 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 31302 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
| 14 | 13 | 3expb 1138 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑀𝐵) = (( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
| 15 | 14 | 3ad2antl1 1204 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑀𝐵) = (( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
| 16 | 15 | fveq2d 6920 | . 2 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘(𝐴𝑀𝐵)) = (𝑇‘(( -1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴))) |
| 17 | simpl2 1211 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝑊 ∈ NrmCVec) | |
| 18 | 2, 3, 8 | lnof 31414 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶(BaseSet‘𝑊)) |
| 19 | simpl 488 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 20 | ffvelcdm 7113 | . . . 4 ⊢ ((𝑇:𝑋⟶(BaseSet‘𝑊) ∧ 𝐴 ∈ 𝑋) → (𝑇‘𝐴) ∈ (BaseSet‘𝑊)) | |
| 21 | 18, 19, 20 | syl2an 608 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘𝐴) ∈ (BaseSet‘𝑊)) |
| 22 | simpr 490 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
| 23 | ffvelcdm 7113 | . . . 4 ⊢ ((𝑇:𝑋⟶(BaseSet‘𝑊) ∧ 𝐵 ∈ 𝑋) → (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) | |
| 24 | 18, 22, 23 | syl2an 608 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) |
| 25 | lnosub.6 | . . . 4 ⊢ 𝑁 = ( −𝑣 ‘𝑊) | |
| 26 | 3, 5, 7, 25 | nvmval2 31302 | . . 3 ⊢ ((𝑊 ∈ NrmCVec ∧ (𝑇‘𝐴) ∈ (BaseSet‘𝑊) ∧ (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) → ((𝑇‘𝐴)𝑁(𝑇‘𝐵)) = (( -1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
| 27 | 17, 21, 24, 26 | syl3anc 1399 | . 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 1570 ∈ wcel 2147 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 1c1 11240 -cneg 11581 NrmCVeccnv 31243 +𝑣 cpv 31244 BaseSetcba 31245 ·𝑠OLD cns 31246 −𝑣 cnsb 31248 LnOp clno 31399 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-ltxr 11387 df-sub 11582 df-neg 11583 df-grpo 31152 df-gid 31153 df-ginv 31154 df-gdiv 31155 df-ablo 31204 df-vc 31218 df-nv 31251 df-va 31254 df-ba 31255 df-sm 31256 df-0v 31257 df-vs 31258 df-nmcv 31259 df-lno 31403 |
| This theorem is used by: blometi 31462 blocnilem 31463 ubthlem2 31530 |
| Copyright terms: Public domain | W3C validator |