![]() |
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 28009 | . . . . . . 7 ⊢ (𝑈 ∈ CPreHilOLD → 𝑈 ∈ NrmCVec) | |
3 | neg1cn 11326 | . . . . . . . 8 ⊢ -1 ∈ ℂ | |
4 | ipsubdir.1 | . . . . . . . . 9 ⊢ 𝑋 = (BaseSet‘𝑈) | |
5 | eqid 2771 | . . . . . . . . 9 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
6 | 4, 5 | nvscl 27821 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐵 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋) |
7 | 3, 6 | mp3an2 1560 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋) |
8 | 2, 7 | sylan 569 | . . . . . 6 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝐵 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋) |
9 | 8 | ex 397 | . . . . 5 ⊢ (𝑈 ∈ CPreHilOLD → (𝐵 ∈ 𝑋 → (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋)) |
10 | idd 24 | . . . . 5 ⊢ (𝑈 ∈ CPreHilOLD → (𝐶 ∈ 𝑋 → 𝐶 ∈ 𝑋)) | |
11 | 1, 9, 10 | 3anim123d 1554 | . . . 4 ⊢ (𝑈 ∈ CPreHilOLD → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴 ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋))) |
12 | 11 | imp 393 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) |
13 | eqid 2771 | . . . 4 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
14 | ipsubdir.7 | . . . 4 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
15 | 4, 13, 14 | dipdir 28037 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))𝑃𝐶) = ((𝐴𝑃𝐶) + ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶))) |
16 | 12, 15 | syldan 579 | . 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))𝑃𝐶) = ((𝐴𝑃𝐶) + ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶))) |
17 | ipsubdir.3 | . . . . . 6 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
18 | 4, 13, 5, 17 | nvmval 27837 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))) |
19 | 2, 18 | syl3an1 1166 | . . . 4 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))) |
20 | 19 | 3adant3r3 1199 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑀𝐵) = (𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))) |
21 | 20 | oveq1d 6808 | . 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑀𝐵)𝑃𝐶) = ((𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐵))𝑃𝐶)) |
22 | 4, 5, 14 | dipass 28040 | . . . . . . 7 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (-1 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶) = (-1 · (𝐵𝑃𝐶))) |
23 | 3, 22 | mp3anr1 1569 | . . . . . 6 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶) = (-1 · (𝐵𝑃𝐶))) |
24 | 4, 14 | dipcl 27907 | . . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝑃𝐶) ∈ ℂ) |
25 | 24 | 3expb 1113 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝑃𝐶) ∈ ℂ) |
26 | 2, 25 | sylan 569 | . . . . . . 7 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝑃𝐶) ∈ ℂ) |
27 | 26 | mulm1d 10684 | . . . . . 6 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (-1 · (𝐵𝑃𝐶)) = -(𝐵𝑃𝐶)) |
28 | 23, 27 | eqtrd 2805 | . . . . 5 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶) = -(𝐵𝑃𝐶)) |
29 | 28 | 3adantr1 1174 | . . . 4 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶) = -(𝐵𝑃𝐶)) |
30 | 29 | oveq2d 6809 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑃𝐶) + ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶)) = ((𝐴𝑃𝐶) + -(𝐵𝑃𝐶))) |
31 | 4, 14 | dipcl 27907 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝑃𝐶) ∈ ℂ) |
32 | 31 | 3adant3r2 1198 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑃𝐶) ∈ ℂ) |
33 | 24 | 3adant3r1 1197 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝑃𝐶) ∈ ℂ) |
34 | 32, 33 | negsubd 10600 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑃𝐶) + -(𝐵𝑃𝐶)) = ((𝐴𝑃𝐶) − (𝐵𝑃𝐶))) |
35 | 2, 34 | sylan 569 | . . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑃𝐶) + -(𝐵𝑃𝐶)) = ((𝐴𝑃𝐶) − (𝐵𝑃𝐶))) |
36 | 30, 35 | eqtr2d 2806 | . 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑃𝐶) − (𝐵𝑃𝐶)) = ((𝐴𝑃𝐶) + ((-1( ·𝑠OLD ‘𝑈)𝐵)𝑃𝐶))) |
37 | 16, 21, 36 | 3eqtr4d 2815 | 1 ⊢ ((𝑈 ∈ CPreHilOLD ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑀𝐵)𝑃𝐶) = ((𝐴𝑃𝐶) − (𝐵𝑃𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 382 ∧ w3a 1071 = wceq 1631 ∈ wcel 2145 ‘cfv 6031 (class class class)co 6793 ℂcc 10136 1c1 10139 + caddc 10141 · cmul 10143 − cmin 10468 -cneg 10469 NrmCVeccnv 27779 +𝑣 cpv 27780 BaseSetcba 27781 ·𝑠OLD cns 27782 −𝑣 cnsb 27784 ·𝑖OLDcdip 27895 CPreHilOLDccphlo 28007 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4904 ax-sep 4915 ax-nul 4923 ax-pow 4974 ax-pr 5034 ax-un 7096 ax-inf2 8702 ax-cnex 10194 ax-resscn 10195 ax-1cn 10196 ax-icn 10197 ax-addcl 10198 ax-addrcl 10199 ax-mulcl 10200 ax-mulrcl 10201 ax-mulcom 10202 ax-addass 10203 ax-mulass 10204 ax-distr 10205 ax-i2m1 10206 ax-1ne0 10207 ax-1rid 10208 ax-rnegex 10209 ax-rrecex 10210 ax-cnre 10211 ax-pre-lttri 10212 ax-pre-lttrn 10213 ax-pre-ltadd 10214 ax-pre-mulgt0 10215 ax-pre-sup 10216 ax-addf 10217 ax-mulf 10218 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-fal 1637 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4226 df-pw 4299 df-sn 4317 df-pr 4319 df-tp 4321 df-op 4323 df-uni 4575 df-int 4612 df-iun 4656 df-iin 4657 df-br 4787 df-opab 4847 df-mpt 4864 df-tr 4887 df-id 5157 df-eprel 5162 df-po 5170 df-so 5171 df-fr 5208 df-se 5209 df-we 5210 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-pred 5823 df-ord 5869 df-on 5870 df-lim 5871 df-suc 5872 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fo 6037 df-f1o 6038 df-fv 6039 df-isom 6040 df-riota 6754 df-ov 6796 df-oprab 6797 df-mpt2 6798 df-of 7044 df-om 7213 df-1st 7315 df-2nd 7316 df-supp 7447 df-wrecs 7559 df-recs 7621 df-rdg 7659 df-1o 7713 df-2o 7714 df-oadd 7717 df-er 7896 df-map 8011 df-ixp 8063 df-en 8110 df-dom 8111 df-sdom 8112 df-fin 8113 df-fsupp 8432 df-fi 8473 df-sup 8504 df-inf 8505 df-oi 8571 df-card 8965 df-cda 9192 df-pnf 10278 df-mnf 10279 df-xr 10280 df-ltxr 10281 df-le 10282 df-sub 10470 df-neg 10471 df-div 10887 df-nn 11223 df-2 11281 df-3 11282 df-4 11283 df-5 11284 df-6 11285 df-7 11286 df-8 11287 df-9 11288 df-n0 11495 df-z 11580 df-dec 11696 df-uz 11889 df-q 11992 df-rp 12036 df-xneg 12151 df-xadd 12152 df-xmul 12153 df-ioo 12384 df-icc 12387 df-fz 12534 df-fzo 12674 df-seq 13009 df-exp 13068 df-hash 13322 df-cj 14047 df-re 14048 df-im 14049 df-sqrt 14183 df-abs 14184 df-clim 14427 df-sum 14625 df-struct 16066 df-ndx 16067 df-slot 16068 df-base 16070 df-sets 16071 df-ress 16072 df-plusg 16162 df-mulr 16163 df-starv 16164 df-sca 16165 df-vsca 16166 df-ip 16167 df-tset 16168 df-ple 16169 df-ds 16172 df-unif 16173 df-hom 16174 df-cco 16175 df-rest 16291 df-topn 16292 df-0g 16310 df-gsum 16311 df-topgen 16312 df-pt 16313 df-prds 16316 df-xrs 16370 df-qtop 16375 df-imas 16376 df-xps 16378 df-mre 16454 df-mrc 16455 df-acs 16457 df-mgm 17450 df-sgrp 17492 df-mnd 17503 df-submnd 17544 df-mulg 17749 df-cntz 17957 df-cmn 18402 df-psmet 19953 df-xmet 19954 df-met 19955 df-bl 19956 df-mopn 19957 df-cnfld 19962 df-top 20919 df-topon 20936 df-topsp 20958 df-bases 20971 df-cld 21044 df-ntr 21045 df-cls 21046 df-cn 21252 df-cnp 21253 df-t1 21339 df-haus 21340 df-tx 21586 df-hmeo 21779 df-xms 22345 df-ms 22346 df-tms 22347 df-grpo 27687 df-gid 27688 df-ginv 27689 df-gdiv 27690 df-ablo 27739 df-vc 27754 df-nv 27787 df-va 27790 df-ba 27791 df-sm 27792 df-0v 27793 df-vs 27794 df-nmcv 27795 df-ims 27796 df-dip 27896 df-ph 28008 |
This theorem is referenced by: dipsubdi 28044 siilem1 28046 |
Copyright terms: Public domain | W3C validator |