| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dipsubdir | Structured version Visualization version GIF version | ||
| Description: Distributive law for inner product subtraction. (Contributed by NM, 20-Nov-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ipsubdir.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| ipsubdir.3 | ⊢ 𝑀 = ( −𝑣 ‘𝑈) |
| ipsubdir.7 | ⊢ 𝑃 = (·𝑖OLD‘𝑈) |
| Ref | Expression |
|---|---|
| dipsubdir | ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑀𝐵)𝑃𝐶) = ((𝐴𝑃𝐶) − (𝐵𝑃𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | idd 24 | . . . . 5 ⊢ (𝑈 ∈ CPreHilOLD → (𝐴 ∈ 𝑋 → 𝐴 ∈ 𝑋)) | |
| 2 | phnv 30796 | . . . . . . 7 ⊢ (𝑈 ∈ CPreHilOLD → 𝑈 ∈ NrmCVec) | |
| 3 | neg1cn 12117 | . . . . . . . 8 ⊢ -1 ∈ ℂ | |
| 4 | ipsubdir.1 | . . . . . . . . 9 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 5 | eqid 2733 | . . . . . . . . 9 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
| 6 | 4, 5 | nvscl 30608 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐵 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋) |
| 7 | 3, 6 | mp3an2 1451 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋) |
| 8 | 2, 7 | sylan 580 | . . . . . 6 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝐵 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋) |
| 9 | 8 | ex 412 | . . . . 5 ⊢ (𝑈 ∈ CPreHilOLD → (𝐵 ∈ 𝑋 → (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋)) |
| 10 | idd 24 | . . . . 5 ⊢ (𝑈 ∈ CPreHilOLD → (𝐶 ∈ 𝑋 → 𝐶 ∈ 𝑋)) | |
| 11 | 1, 9, 10 | 3anim123d 1445 | . . . 4 ⊢ (𝑈 ∈ CPreHilOLD → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴 ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋))) |
| 12 | 11 | imp 406 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) |
| 13 | eqid 2733 | . . . 4 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 14 | ipsubdir.7 | . . . 4 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
| 15 | 4, 13, 14 | dipdir 30824 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))𝑃𝐶) = ((𝐴𝑃𝐶) + ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶))) |
| 16 | 12, 15 | syldan 591 | . 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))𝑃𝐶) = ((𝐴𝑃𝐶) + ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶))) |
| 17 | ipsubdir.3 | . . . . . 6 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
| 18 | 4, 13, 5, 17 | nvmval 30624 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))) |
| 19 | 2, 18 | syl3an1 1163 | . . . 4 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))) |
| 20 | 19 | 3adant3r3 1185 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑀𝐵) = (𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))) |
| 21 | 20 | oveq1d 7367 | . 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑀𝐵)𝑃𝐶) = ((𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))𝑃𝐶)) |
| 22 | 4, 5, 14 | dipass 30827 | . . . . . . 7 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (-1 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶) = (-1 · (𝐵𝑃𝐶))) |
| 23 | 3, 22 | mp3anr1 1460 | . . . . . 6 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶) = (-1 · (𝐵𝑃𝐶))) |
| 24 | 4, 14 | dipcl 30694 | . . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝑃𝐶) ∈ ℂ) |
| 25 | 24 | 3expb 1120 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝑃𝐶) ∈ ℂ) |
| 26 | 2, 25 | sylan 580 | . . . . . . 7 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝑃𝐶) ∈ ℂ) |
| 27 | 26 | mulm1d 11576 | . . . . . 6 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (-1 · (𝐵𝑃𝐶)) = -(𝐵𝑃𝐶)) |
| 28 | 23, 27 | eqtrd 2768 | . . . . 5 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶) = -(𝐵𝑃𝐶)) |
| 29 | 28 | 3adantr1 1170 | . . . 4 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶) = -(𝐵𝑃𝐶)) |
| 30 | 29 | oveq2d 7368 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑃𝐶) + ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶)) = ((𝐴𝑃𝐶) + -(𝐵𝑃𝐶))) |
| 31 | 4, 14 | dipcl 30694 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝑃𝐶) ∈ ℂ) |
| 32 | 31 | 3adant3r2 1184 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑃𝐶) ∈ ℂ) |
| 33 | 24 | 3adant3r1 1183 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝑃𝐶) ∈ ℂ) |
| 34 | 32, 33 | negsubd 11485 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑃𝐶) + -(𝐵𝑃𝐶)) = ((𝐴𝑃𝐶) − (𝐵𝑃𝐶))) |
| 35 | 2, 34 | sylan 580 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑃𝐶) + -(𝐵𝑃𝐶)) = ((𝐴𝑃𝐶) − (𝐵𝑃𝐶))) |
| 36 | 30, 35 | eqtr2d 2769 | . 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑃𝐶) − (𝐵𝑃𝐶)) = ((𝐴𝑃𝐶) + ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶))) |
| 37 | 16, 21, 36 | 3eqtr4d 2778 | 1 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑀𝐵)𝑃𝐶) = ((𝐴𝑃𝐶) − (𝐵𝑃𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ‘cfv 6486 (class class class)co 7352 ℂcc 11011 1c1 11014 + caddc 11016 · cmul 11018 − cmin 11351 -cneg 11352 NrmCVeccnv 30566 +𝑣 cpv 30567 BaseSetcba 30568 ·𝑠OLD cns 30569 −𝑣 cnsb 30571 ·𝑖OLDcdip 30682 CPreHilOLDccphlo 30794 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-inf2 9538 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 ax-pre-sup 11091 ax-addf 11092 ax-mulf 11093 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-tp 4580 df-op 4582 df-uni 4859 df-int 4898 df-iun 4943 df-iin 4944 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-isom 6495 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-of 7616 df-om 7803 df-1st 7927 df-2nd 7928 df-supp 8097 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-1o 8391 df-2o 8392 df-er 8628 df-map 8758 df-ixp 8828 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-fsupp 9253 df-fi 9302 df-sup 9333 df-inf 9334 df-oi 9403 df-card 9839 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-div 11782 df-nn 12133 df-2 12195 df-3 12196 df-4 12197 df-5 12198 df-6 12199 df-7 12200 df-8 12201 df-9 12202 df-n0 12389 df-z 12476 df-dec 12595 df-uz 12739 df-q 12849 df-rp 12893 df-xneg 13013 df-xadd 13014 df-xmul 13015 df-ioo 13251 df-icc 13254 df-fz 13410 df-fzo 13557 df-seq 13911 df-exp 13971 df-hash 14240 df-cj 15008 df-re 15009 df-im 15010 df-sqrt 15144 df-abs 15145 df-clim 15397 df-sum 15596 df-struct 17060 df-sets 17077 df-slot 17095 df-ndx 17107 df-base 17123 df-ress 17144 df-plusg 17176 df-mulr 17177 df-starv 17178 df-sca 17179 df-vsca 17180 df-ip 17181 df-tset 17182 df-ple 17183 df-ds 17185 df-unif 17186 df-hom 17187 df-cco 17188 df-rest 17328 df-topn 17329 df-0g 17347 df-gsum 17348 df-topgen 17349 df-pt 17350 df-prds 17353 df-xrs 17408 df-qtop 17413 df-imas 17414 df-xps 17416 df-mre 17490 df-mrc 17491 df-acs 17493 df-mgm 18550 df-sgrp 18629 df-mnd 18645 df-submnd 18694 df-mulg 18983 df-cntz 19231 df-cmn 19696 df-psmet 21285 df-xmet 21286 df-met 21287 df-bl 21288 df-mopn 21289 df-cnfld 21294 df-top 22810 df-topon 22827 df-topsp 22849 df-bases 22862 df-cld 22935 df-ntr 22936 df-cls 22937 df-cn 23143 df-cnp 23144 df-t1 23230 df-haus 23231 df-tx 23478 df-hmeo 23671 df-xms 24236 df-ms 24237 df-tms 24238 df-grpo 30475 df-gid 30476 df-ginv 30477 df-gdiv 30478 df-ablo 30527 df-vc 30541 df-nv 30574 df-va 30577 df-ba 30578 df-sm 30579 df-0v 30580 df-vs 30581 df-nmcv 30582 df-ims 30583 df-dip 30683 df-ph 30795 |
| This theorem is referenced by: dipsubdi 30831 siilem1 30833 |
| Copyright terms: Public domain | W3C validator |