![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ipsubdi | Structured version Visualization version GIF version |
Description: Distributive law for inner product subtraction. (Contributed by NM, 20-Nov-2007.) (Revised by Mario Carneiro, 7-Oct-2015.) |
Ref | Expression |
---|---|
phlsrng.f | ⊢ 𝐹 = (Scalar‘𝑊) |
phllmhm.h | ⊢ , = (·𝑖‘𝑊) |
phllmhm.v | ⊢ 𝑉 = (Base‘𝑊) |
ipsubdir.m | ⊢ − = (-g‘𝑊) |
ipsubdir.s | ⊢ 𝑆 = (-g‘𝐹) |
Ref | Expression |
---|---|
ipsubdi | ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , (𝐵 − 𝐶)) = ((𝐴 , 𝐵)𝑆(𝐴 , 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 473 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ PreHil) | |
2 | simpr1 1067 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝑉) | |
3 | phllmod 19975 | . . . . . . . 8 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
4 | 3 | adantr 481 | . . . . . . 7 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ LMod) |
5 | lmodgrp 18870 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp) | |
6 | 4, 5 | syl 17 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ Grp) |
7 | simpr2 1068 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
8 | simpr3 1069 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) | |
9 | phllmhm.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
10 | ipsubdir.m | . . . . . . 7 ⊢ − = (-g‘𝑊) | |
11 | 9, 10 | grpsubcl 17495 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐵 − 𝐶) ∈ 𝑉) |
12 | 6, 7, 8, 11 | syl3anc 1326 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐵 − 𝐶) ∈ 𝑉) |
13 | phlsrng.f | . . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊) | |
14 | phllmhm.h | . . . . . 6 ⊢ , = (·𝑖‘𝑊) | |
15 | eqid 2622 | . . . . . 6 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
16 | eqid 2622 | . . . . . 6 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
17 | 13, 14, 9, 15, 16 | ipdi 19985 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ (𝐵 − 𝐶) ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , ((𝐵 − 𝐶)(+g‘𝑊)𝐶)) = ((𝐴 , (𝐵 − 𝐶))(+g‘𝐹)(𝐴 , 𝐶))) |
18 | 1, 2, 12, 8, 17 | syl13anc 1328 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , ((𝐵 − 𝐶)(+g‘𝑊)𝐶)) = ((𝐴 , (𝐵 − 𝐶))(+g‘𝐹)(𝐴 , 𝐶))) |
19 | 9, 15, 10 | grpnpcan 17507 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → ((𝐵 − 𝐶)(+g‘𝑊)𝐶) = 𝐵) |
20 | 6, 7, 8, 19 | syl3anc 1326 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐵 − 𝐶)(+g‘𝑊)𝐶) = 𝐵) |
21 | 20 | oveq2d 6666 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , ((𝐵 − 𝐶)(+g‘𝑊)𝐶)) = (𝐴 , 𝐵)) |
22 | 18, 21 | eqtr3d 2658 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 , (𝐵 − 𝐶))(+g‘𝐹)(𝐴 , 𝐶)) = (𝐴 , 𝐵)) |
23 | 13 | lmodfgrp 18872 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Grp) |
24 | 4, 23 | syl 17 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐹 ∈ Grp) |
25 | eqid 2622 | . . . . . 6 ⊢ (Base‘𝐹) = (Base‘𝐹) | |
26 | 13, 14, 9, 25 | ipcl 19978 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 , 𝐵) ∈ (Base‘𝐹)) |
27 | 1, 2, 7, 26 | syl3anc 1326 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , 𝐵) ∈ (Base‘𝐹)) |
28 | 13, 14, 9, 25 | ipcl 19978 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 , 𝐶) ∈ (Base‘𝐹)) |
29 | 1, 2, 8, 28 | syl3anc 1326 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , 𝐶) ∈ (Base‘𝐹)) |
30 | 13, 14, 9, 25 | ipcl 19978 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ (𝐵 − 𝐶) ∈ 𝑉) → (𝐴 , (𝐵 − 𝐶)) ∈ (Base‘𝐹)) |
31 | 1, 2, 12, 30 | syl3anc 1326 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , (𝐵 − 𝐶)) ∈ (Base‘𝐹)) |
32 | ipsubdir.s | . . . . 5 ⊢ 𝑆 = (-g‘𝐹) | |
33 | 25, 16, 32 | grpsubadd 17503 | . . . 4 ⊢ ((𝐹 ∈ Grp ∧ ((𝐴 , 𝐵) ∈ (Base‘𝐹) ∧ (𝐴 , 𝐶) ∈ (Base‘𝐹) ∧ (𝐴 , (𝐵 − 𝐶)) ∈ (Base‘𝐹))) → (((𝐴 , 𝐵)𝑆(𝐴 , 𝐶)) = (𝐴 , (𝐵 − 𝐶)) ↔ ((𝐴 , (𝐵 − 𝐶))(+g‘𝐹)(𝐴 , 𝐶)) = (𝐴 , 𝐵))) |
34 | 24, 27, 29, 31, 33 | syl13anc 1328 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (((𝐴 , 𝐵)𝑆(𝐴 , 𝐶)) = (𝐴 , (𝐵 − 𝐶)) ↔ ((𝐴 , (𝐵 − 𝐶))(+g‘𝐹)(𝐴 , 𝐶)) = (𝐴 , 𝐵))) |
35 | 22, 34 | mpbird 247 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 , 𝐵)𝑆(𝐴 , 𝐶)) = (𝐴 , (𝐵 − 𝐶))) |
36 | 35 | eqcomd 2628 | 1 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , (𝐵 − 𝐶)) = ((𝐴 , 𝐵)𝑆(𝐴 , 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 +gcplusg 15941 Scalarcsca 15944 ·𝑖cip 15946 Grpcgrp 17422 -gcsg 17424 LModclmod 18863 PreHilcphl 19969 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-tpos 7352 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-plusg 15954 df-mulr 15955 df-sca 15957 df-vsca 15958 df-ip 15959 df-0g 16102 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-mhm 17335 df-grp 17425 df-minusg 17426 df-sbg 17427 df-ghm 17658 df-mgp 18490 df-ur 18502 df-ring 18549 df-oppr 18623 df-rnghom 18715 df-staf 18845 df-srng 18846 df-lmod 18865 df-lmhm 19022 df-lvec 19103 df-sra 19172 df-rgmod 19173 df-phl 19971 |
This theorem is referenced by: ip2subdi 19989 ip2eq 19998 cphsubdi 23009 |
Copyright terms: Public domain | W3C validator |