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 11909 | . . . 4 ⊢ -1 ∈ ℂ | |
2 | lnosub.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
3 | eqid 2736 | . . . . 5 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊) | |
4 | eqid 2736 | . . . . 5 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
5 | eqid 2736 | . . . . 5 ⊢ ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊) | |
6 | eqid 2736 | . . . . 5 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
7 | eqid 2736 | . . . . 5 ⊢ ( ·𝑠OLD ‘𝑊) = ( ·𝑠OLD ‘𝑊) | |
8 | lnosub.7 | . . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊) | |
9 | 2, 3, 4, 5, 6, 7, 8 | lnolin 28789 | . . . 4 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (-1 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → (𝑇‘((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
10 | 1, 9 | mp3anr1 1460 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → (𝑇‘((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
11 | 10 | ancom2s 650 | . 2 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
12 | lnosub.5 | . . . . . 6 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
13 | 2, 4, 6, 12 | nvmval2 28678 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = ((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
14 | 13 | 3expb 1122 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑀𝐵) = ((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
15 | 14 | 3ad2antl1 1187 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑀𝐵) = ((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴)) |
16 | 15 | fveq2d 6699 | . 2 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘(𝐴𝑀𝐵)) = (𝑇‘((-1( ·𝑠OLD ‘𝑈)𝐵)( +𝑣 ‘𝑈)𝐴))) |
17 | simpl2 1194 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝑊 ∈ NrmCVec) | |
18 | 2, 3, 8 | lnof 28790 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶(BaseSet‘𝑊)) |
19 | simpl 486 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
20 | ffvelrn 6880 | . . . 4 ⊢ ((𝑇:𝑋⟶(BaseSet‘𝑊) ∧ 𝐴 ∈ 𝑋) → (𝑇‘𝐴) ∈ (BaseSet‘𝑊)) | |
21 | 18, 19, 20 | syl2an 599 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘𝐴) ∈ (BaseSet‘𝑊)) |
22 | simpr 488 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
23 | ffvelrn 6880 | . . . 4 ⊢ ((𝑇:𝑋⟶(BaseSet‘𝑊) ∧ 𝐵 ∈ 𝑋) → (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) | |
24 | 18, 22, 23 | syl2an 599 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) |
25 | lnosub.6 | . . . 4 ⊢ 𝑁 = ( −𝑣 ‘𝑊) | |
26 | 3, 5, 7, 25 | nvmval2 28678 | . . 3 ⊢ ((𝑊 ∈ NrmCVec ∧ (𝑇‘𝐴) ∈ (BaseSet‘𝑊) ∧ (𝑇‘𝐵) ∈ (BaseSet‘𝑊)) → ((𝑇‘𝐴)𝑁(𝑇‘𝐵)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
27 | 17, 21, 24, 26 | syl3anc 1373 | . 2 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝑇‘𝐴)𝑁(𝑇‘𝐵)) = ((-1( ·𝑠OLD ‘𝑊)(𝑇‘𝐵))( +𝑣 ‘𝑊)(𝑇‘𝐴))) |
28 | 11, 16, 27 | 3eqtr4d 2781 | 1 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑇‘(𝐴𝑀𝐵)) = ((𝑇‘𝐴)𝑁(𝑇‘𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2112 ⟶wf 6354 ‘cfv 6358 (class class class)co 7191 ℂcc 10692 1c1 10695 -cneg 11028 NrmCVeccnv 28619 +𝑣 cpv 28620 BaseSetcba 28621 ·𝑠OLD cns 28622 −𝑣 cnsb 28624 LnOp clno 28775 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-rep 5164 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 ax-resscn 10751 ax-1cn 10752 ax-icn 10753 ax-addcl 10754 ax-addrcl 10755 ax-mulcl 10756 ax-mulrcl 10757 ax-mulcom 10758 ax-addass 10759 ax-mulass 10760 ax-distr 10761 ax-i2m1 10762 ax-1ne0 10763 ax-1rid 10764 ax-rnegex 10765 ax-rrecex 10766 ax-cnre 10767 ax-pre-lttri 10768 ax-pre-lttrn 10769 ax-pre-ltadd 10770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-nel 3037 df-ral 3056 df-rex 3057 df-reu 3058 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-iun 4892 df-br 5040 df-opab 5102 df-mpt 5121 df-id 5440 df-po 5453 df-so 5454 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7148 df-ov 7194 df-oprab 7195 df-mpo 7196 df-1st 7739 df-2nd 7740 df-er 8369 df-map 8488 df-en 8605 df-dom 8606 df-sdom 8607 df-pnf 10834 df-mnf 10835 df-ltxr 10837 df-sub 11029 df-neg 11030 df-grpo 28528 df-gid 28529 df-ginv 28530 df-gdiv 28531 df-ablo 28580 df-vc 28594 df-nv 28627 df-va 28630 df-ba 28631 df-sm 28632 df-0v 28633 df-vs 28634 df-nmcv 28635 df-lno 28779 |
This theorem is referenced by: blometi 28838 blocnilem 28839 ubthlem2 28906 |
Copyright terms: Public domain | W3C validator |