Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ipsubdir | 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 |
---|---|
ipsubdir | ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) , 𝐶) = ((𝐴 , 𝐶)𝑆(𝐵 , 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 483 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ PreHil) | |
2 | phllmod 20835 | . . . . . . . 8 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
3 | 2 | adantr 481 | . . . . . . 7 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ LMod) |
4 | lmodgrp 20130 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp) | |
5 | 3, 4 | syl 17 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ Grp) |
6 | simpr1 1193 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝑉) | |
7 | simpr2 1194 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
8 | phllmhm.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
9 | ipsubdir.m | . . . . . . 7 ⊢ − = (-g‘𝑊) | |
10 | 8, 9 | grpsubcl 18655 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) ∈ 𝑉) |
11 | 5, 6, 7, 10 | syl3anc 1370 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 − 𝐵) ∈ 𝑉) |
12 | simpr3 1195 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) | |
13 | phlsrng.f | . . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊) | |
14 | phllmhm.h | . . . . . 6 ⊢ , = (·𝑖‘𝑊) | |
15 | eqid 2738 | . . . . . 6 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
16 | eqid 2738 | . . . . . 6 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
17 | 13, 14, 8, 15, 16 | ipdir 20844 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ ((𝐴 − 𝐵) ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (((𝐴 − 𝐵)(+g‘𝑊)𝐵) , 𝐶) = (((𝐴 − 𝐵) , 𝐶)(+g‘𝐹)(𝐵 , 𝐶))) |
18 | 1, 11, 7, 12, 17 | syl13anc 1371 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (((𝐴 − 𝐵)(+g‘𝑊)𝐵) , 𝐶) = (((𝐴 − 𝐵) , 𝐶)(+g‘𝐹)(𝐵 , 𝐶))) |
19 | 8, 15, 9 | grpnpcan 18667 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((𝐴 − 𝐵)(+g‘𝑊)𝐵) = 𝐴) |
20 | 5, 6, 7, 19 | syl3anc 1370 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵)(+g‘𝑊)𝐵) = 𝐴) |
21 | 20 | oveq1d 7290 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (((𝐴 − 𝐵)(+g‘𝑊)𝐵) , 𝐶) = (𝐴 , 𝐶)) |
22 | 18, 21 | eqtr3d 2780 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (((𝐴 − 𝐵) , 𝐶)(+g‘𝐹)(𝐵 , 𝐶)) = (𝐴 , 𝐶)) |
23 | 13 | lmodfgrp 20132 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Grp) |
24 | 3, 23 | syl 17 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐹 ∈ Grp) |
25 | eqid 2738 | . . . . . 6 ⊢ (Base‘𝐹) = (Base‘𝐹) | |
26 | 13, 14, 8, 25 | ipcl 20838 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 , 𝐶) ∈ (Base‘𝐹)) |
27 | 1, 6, 12, 26 | syl3anc 1370 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐴 , 𝐶) ∈ (Base‘𝐹)) |
28 | 13, 14, 8, 25 | ipcl 20838 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐵 , 𝐶) ∈ (Base‘𝐹)) |
29 | 1, 7, 12, 28 | syl3anc 1370 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐵 , 𝐶) ∈ (Base‘𝐹)) |
30 | 13, 14, 8, 25 | ipcl 20838 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 − 𝐵) ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → ((𝐴 − 𝐵) , 𝐶) ∈ (Base‘𝐹)) |
31 | 1, 11, 12, 30 | syl3anc 1370 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) , 𝐶) ∈ (Base‘𝐹)) |
32 | ipsubdir.s | . . . . 5 ⊢ 𝑆 = (-g‘𝐹) | |
33 | 25, 16, 32 | grpsubadd 18663 | . . . 4 ⊢ ((𝐹 ∈ Grp ∧ ((𝐴 , 𝐶) ∈ (Base‘𝐹) ∧ (𝐵 , 𝐶) ∈ (Base‘𝐹) ∧ ((𝐴 − 𝐵) , 𝐶) ∈ (Base‘𝐹))) → (((𝐴 , 𝐶)𝑆(𝐵 , 𝐶)) = ((𝐴 − 𝐵) , 𝐶) ↔ (((𝐴 − 𝐵) , 𝐶)(+g‘𝐹)(𝐵 , 𝐶)) = (𝐴 , 𝐶))) |
34 | 24, 27, 29, 31, 33 | syl13anc 1371 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (((𝐴 , 𝐶)𝑆(𝐵 , 𝐶)) = ((𝐴 − 𝐵) , 𝐶) ↔ (((𝐴 − 𝐵) , 𝐶)(+g‘𝐹)(𝐵 , 𝐶)) = (𝐴 , 𝐶))) |
35 | 22, 34 | mpbird 256 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 , 𝐶)𝑆(𝐵 , 𝐶)) = ((𝐴 − 𝐵) , 𝐶)) |
36 | 35 | eqcomd 2744 | 1 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) , 𝐶) = ((𝐴 , 𝐶)𝑆(𝐵 , 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 +gcplusg 16962 Scalarcsca 16965 ·𝑖cip 16967 Grpcgrp 18577 -gcsg 18579 LModclmod 20123 PreHilcphl 20829 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-plusg 16975 df-sca 16978 df-vsca 16979 df-ip 16980 df-0g 17152 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-grp 18580 df-minusg 18581 df-sbg 18582 df-ghm 18832 df-ring 19785 df-lmod 20125 df-lmhm 20284 df-lvec 20365 df-sra 20434 df-rgmod 20435 df-phl 20831 |
This theorem is referenced by: ip2subdi 20849 cphsubdir 24372 |
Copyright terms: Public domain | W3C validator |