![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cphsubdi | Structured version Visualization version GIF version |
Description: Distributive law for inner product subtraction. Complex version of ipsubdi 21684. (Contributed by Mario Carneiro, 16-Oct-2015.) |
Ref | Expression |
---|---|
cphipcj.h | ⊢ , = (·𝑖‘𝑊) |
cphipcj.v | ⊢ 𝑉 = (Base‘𝑊) |
cphsubdir.m | ⊢ − = (-g‘𝑊) |
Ref | Expression |
---|---|
cphsubdi | ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , (𝐵 − 𝐶)) = ((𝐴 , 𝐵) − (𝐴 , 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cphphl 25224 | . . 3 ⊢ (𝑊 ∈ ℂPreHil → 𝑊 ∈ PreHil) | |
2 | eqid 2740 | . . . 4 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊) | |
3 | cphipcj.h | . . . 4 ⊢ , = (·𝑖‘𝑊) | |
4 | cphipcj.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
5 | cphsubdir.m | . . . 4 ⊢ − = (-g‘𝑊) | |
6 | eqid 2740 | . . . 4 ⊢ (-g‘(Scalar‘𝑊)) = (-g‘(Scalar‘𝑊)) | |
7 | 2, 3, 4, 5, 6 | ipsubdi 21684 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , (𝐵 − 𝐶)) = ((𝐴 , 𝐵)(-g‘(Scalar‘𝑊))(𝐴 , 𝐶))) |
8 | 1, 7 | sylan 579 | . 2 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , (𝐵 − 𝐶)) = ((𝐴 , 𝐵)(-g‘(Scalar‘𝑊))(𝐴 , 𝐶))) |
9 | cphclm 25242 | . . . 4 ⊢ (𝑊 ∈ ℂPreHil → 𝑊 ∈ ℂMod) | |
10 | 9 | adantr 480 | . . 3 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ ℂMod) |
11 | 1 | adantr 480 | . . . 4 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ PreHil) |
12 | simpr1 1194 | . . . 4 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝑉) | |
13 | simpr2 1195 | . . . 4 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
14 | eqid 2740 | . . . . 5 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊)) | |
15 | 2, 3, 4, 14 | ipcl 21674 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 , 𝐵) ∈ (Base‘(Scalar‘𝑊))) |
16 | 11, 12, 13, 15 | syl3anc 1371 | . . 3 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , 𝐵) ∈ (Base‘(Scalar‘𝑊))) |
17 | simpr3 1196 | . . . 4 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) | |
18 | 2, 3, 4, 14 | ipcl 21674 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 , 𝐶) ∈ (Base‘(Scalar‘𝑊))) |
19 | 11, 12, 17, 18 | syl3anc 1371 | . . 3 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , 𝐶) ∈ (Base‘(Scalar‘𝑊))) |
20 | 2, 14 | clmsub 25132 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 , 𝐵) ∈ (Base‘(Scalar‘𝑊)) ∧ (𝐴 , 𝐶) ∈ (Base‘(Scalar‘𝑊))) → ((𝐴 , 𝐵) − (𝐴 , 𝐶)) = ((𝐴 , 𝐵)(-g‘(Scalar‘𝑊))(𝐴 , 𝐶))) |
21 | 10, 16, 19, 20 | syl3anc 1371 | . 2 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 , 𝐵) − (𝐴 , 𝐶)) = ((𝐴 , 𝐵)(-g‘(Scalar‘𝑊))(𝐴 , 𝐶))) |
22 | 8, 21 | eqtr4d 2783 | 1 ⊢ ((𝑊 ∈ ℂPreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , (𝐵 − 𝐶)) = ((𝐴 , 𝐵) − (𝐴 , 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ‘cfv 6573 (class class class)co 7448 − cmin 11520 Basecbs 17258 Scalarcsca 17314 ·𝑖cip 17316 -gcsg 18975 PreHilcphl 21665 ℂModcclm 25114 ℂPreHilccph 25219 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-addf 11263 ax-mulf 11264 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-tpos 8267 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-er 8763 df-map 8886 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-z 12640 df-dec 12759 df-uz 12904 df-fz 13568 df-seq 14053 df-exp 14113 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-mulr 17325 df-starv 17326 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-unif 17334 df-0g 17501 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-mhm 18818 df-grp 18976 df-minusg 18977 df-sbg 18978 df-subg 19163 df-ghm 19253 df-cmn 19824 df-abl 19825 df-mgp 20162 df-rng 20180 df-ur 20209 df-ring 20262 df-cring 20263 df-oppr 20360 df-dvdsr 20383 df-unit 20384 df-rhm 20498 df-subrg 20597 df-drng 20753 df-staf 20862 df-srng 20863 df-lmod 20882 df-lmhm 21044 df-lvec 21125 df-sra 21195 df-rgmod 21196 df-cnfld 21388 df-phl 21667 df-nlm 24620 df-clm 25115 df-cph 25221 |
This theorem is referenced by: ipcnlem2 25297 pjthlem1 25490 |
Copyright terms: Public domain | W3C validator |