ip2subdi - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ip2subdi		Structured version Visualization version GIF version

Theorem ip2subdi 21590

Description: Distributive law for inner product subtraction. (Contributed by Mario Carneiro, 8-Oct-2015.)

**Hypotheses**
Ref	Expression
phlsrng.f	⊢ 𝐹 = (Scalar‘𝑊)
phllmhm.h	⊢ , = (·_𝑖‘𝑊)
phllmhm.v	⊢ 𝑉 = (Base‘𝑊)
ipsubdir.m	⊢ − = (-_g‘𝑊)
ipsubdir.s	⊢ 𝑆 = (-_g‘𝐹)
ip2subdi.p	⊢ + = (+_g‘𝐹)
ip2subdi.1	⊢ (𝜑 → 𝑊 ∈ PreHil)
ip2subdi.2	⊢ (𝜑 → 𝐴 ∈ 𝑉)
ip2subdi.3	⊢ (𝜑 → 𝐵 ∈ 𝑉)
ip2subdi.4	⊢ (𝜑 → 𝐶 ∈ 𝑉)
ip2subdi.5	⊢ (𝜑 → 𝐷 ∈ 𝑉)

**Assertion**
Ref	Expression
ip2subdi	⊢ (𝜑 → ((𝐴 − 𝐵) , (𝐶 − 𝐷)) = (((𝐴 , 𝐶) + (𝐵 , 𝐷))𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))))

**Proof of Theorem ip2subdi**
Step	Hyp	Ref	Expression
1		eqid 2728	. . . 4 ⊢ (Base‘𝐹) = (Base‘𝐹)
2		ip2subdi.p	. . . 4 ⊢ + = (+_g‘𝐹)
3		ipsubdir.s	. . . 4 ⊢ 𝑆 = (-_g‘𝐹)
4		ip2subdi.1	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ PreHil)
5		phllmod 21576	. . . . . . 7 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod)
6	4, 5	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LMod)
7		phlsrng.f	. . . . . . 7 ⊢ 𝐹 = (Scalar‘𝑊)
8	7	lmodring 20765	. . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring)
9	6, 8	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ Ring)
10		ringabl 20231	. . . . 5 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Abel)
11	9, 10	syl 17	. . . 4 ⊢ (𝜑 → 𝐹 ∈ Abel)
12		ip2subdi.2	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
13		ip2subdi.4	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
14		phllmhm.h	. . . . . 6 ⊢ , = (·_𝑖‘𝑊)
15		phllmhm.v	. . . . . 6 ⊢ 𝑉 = (Base‘𝑊)
16	7, 14, 15, 1	ipcl 21579	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 , 𝐶) ∈ (Base‘𝐹))
17	4, 12, 13, 16	syl3anc 1368	. . . 4 ⊢ (𝜑 → (𝐴 , 𝐶) ∈ (Base‘𝐹))
18		ip2subdi.5	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ 𝑉)
19	7, 14, 15, 1	ipcl 21579	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉) → (𝐴 , 𝐷) ∈ (Base‘𝐹))
20	4, 12, 18, 19	syl3anc 1368	. . . 4 ⊢ (𝜑 → (𝐴 , 𝐷) ∈ (Base‘𝐹))
21		ip2subdi.3	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
22	7, 14, 15, 1	ipcl 21579	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐵 , 𝐶) ∈ (Base‘𝐹))
23	4, 21, 13, 22	syl3anc 1368	. . . 4 ⊢ (𝜑 → (𝐵 , 𝐶) ∈ (Base‘𝐹))
24	1, 2, 3, 11, 17, 20, 23	ablsubsub4 19787	. . 3 ⊢ (𝜑 → (((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆(𝐵 , 𝐶)) = ((𝐴 , 𝐶)𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))))
25	24	oveq1d 7441	. 2 ⊢ (𝜑 → ((((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆(𝐵 , 𝐶)) + (𝐵 , 𝐷)) = (((𝐴 , 𝐶)𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) + (𝐵 , 𝐷)))
26		ipsubdir.m	. . . . . 6 ⊢ − = (-_g‘𝑊)
27	15, 26	lmodvsubcl 20804	. . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉) → (𝐶 − 𝐷) ∈ 𝑉)
28	6, 13, 18, 27	syl3anc 1368	. . . 4 ⊢ (𝜑 → (𝐶 − 𝐷) ∈ 𝑉)
29	7, 14, 15, 26, 3	ipsubdir 21588	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ (𝐶 − 𝐷) ∈ 𝑉)) → ((𝐴 − 𝐵) , (𝐶 − 𝐷)) = ((𝐴 , (𝐶 − 𝐷))𝑆(𝐵 , (𝐶 − 𝐷))))
30	4, 12, 21, 28, 29	syl13anc 1369	. . 3 ⊢ (𝜑 → ((𝐴 − 𝐵) , (𝐶 − 𝐷)) = ((𝐴 , (𝐶 − 𝐷))𝑆(𝐵 , (𝐶 − 𝐷))))
31	7, 14, 15, 26, 3	ipsubdi 21589	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → (𝐴 , (𝐶 − 𝐷)) = ((𝐴 , 𝐶)𝑆(𝐴 , 𝐷)))
32	4, 12, 13, 18, 31	syl13anc 1369	. . . 4 ⊢ (𝜑 → (𝐴 , (𝐶 − 𝐷)) = ((𝐴 , 𝐶)𝑆(𝐴 , 𝐷)))
33	7, 14, 15, 26, 3	ipsubdi 21589	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → (𝐵 , (𝐶 − 𝐷)) = ((𝐵 , 𝐶)𝑆(𝐵 , 𝐷)))
34	4, 21, 13, 18, 33	syl13anc 1369	. . . 4 ⊢ (𝜑 → (𝐵 , (𝐶 − 𝐷)) = ((𝐵 , 𝐶)𝑆(𝐵 , 𝐷)))
35	32, 34	oveq12d 7444	. . 3 ⊢ (𝜑 → ((𝐴 , (𝐶 − 𝐷))𝑆(𝐵 , (𝐶 − 𝐷))) = (((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆((𝐵 , 𝐶)𝑆(𝐵 , 𝐷))))
36		ringgrp 20192	. . . . . 6 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Grp)
37	9, 36	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ Grp)
38	1, 3	grpsubcl 18990	. . . . 5 ⊢ ((𝐹 ∈ Grp ∧ (𝐴 , 𝐶) ∈ (Base‘𝐹) ∧ (𝐴 , 𝐷) ∈ (Base‘𝐹)) → ((𝐴 , 𝐶)𝑆(𝐴 , 𝐷)) ∈ (Base‘𝐹))
39	37, 17, 20, 38	syl3anc 1368	. . . 4 ⊢ (𝜑 → ((𝐴 , 𝐶)𝑆(𝐴 , 𝐷)) ∈ (Base‘𝐹))
40	7, 14, 15, 1	ipcl 21579	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉) → (𝐵 , 𝐷) ∈ (Base‘𝐹))
41	4, 21, 18, 40	syl3anc 1368	. . . 4 ⊢ (𝜑 → (𝐵 , 𝐷) ∈ (Base‘𝐹))
42	1, 2, 3, 11, 39, 23, 41	ablsubsub 19786	. . 3 ⊢ (𝜑 → (((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆((𝐵 , 𝐶)𝑆(𝐵 , 𝐷))) = ((((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆(𝐵 , 𝐶)) + (𝐵 , 𝐷)))
43	30, 35, 42	3eqtrd 2772	. 2 ⊢ (𝜑 → ((𝐴 − 𝐵) , (𝐶 − 𝐷)) = ((((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆(𝐵 , 𝐶)) + (𝐵 , 𝐷)))
44	1, 2	ringacl 20228	. . . 4 ⊢ ((𝐹 ∈ Ring ∧ (𝐴 , 𝐷) ∈ (Base‘𝐹) ∧ (𝐵 , 𝐶) ∈ (Base‘𝐹)) → ((𝐴 , 𝐷) + (𝐵 , 𝐶)) ∈ (Base‘𝐹))
45	9, 20, 23, 44	syl3anc 1368	. . 3 ⊢ (𝜑 → ((𝐴 , 𝐷) + (𝐵 , 𝐶)) ∈ (Base‘𝐹))
46	1, 2, 3	abladdsub 19781	. . 3 ⊢ ((𝐹 ∈ Abel ∧ ((𝐴 , 𝐶) ∈ (Base‘𝐹) ∧ (𝐵 , 𝐷) ∈ (Base‘𝐹) ∧ ((𝐴 , 𝐷) + (𝐵 , 𝐶)) ∈ (Base‘𝐹))) → (((𝐴 , 𝐶) + (𝐵 , 𝐷))𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) = (((𝐴 , 𝐶)𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) + (𝐵 , 𝐷)))
47	11, 17, 41, 45, 46	syl13anc 1369	. 2 ⊢ (𝜑 → (((𝐴 , 𝐶) + (𝐵 , 𝐷))𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) = (((𝐴 , 𝐶)𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) + (𝐵 , 𝐷)))
48	25, 43, 47	3eqtr4d 2778	1 ⊢ (𝜑 → ((𝐴 − 𝐵) , (𝐶 − 𝐷)) = (((𝐴 , 𝐶) + (𝐵 , 𝐷))𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2098 ‘cfv 6553 (class class class)co 7426 Basecbs 17189 +_gcplusg 17242 Scalarcsca 17245 ·_𝑖cip 17247 Grpcgrp 18904 -_gcsg 18906 Abelcabl 19750 Ringcrg 20187 LModclmod 20757 PreHilcphl 21570

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-rep 5289 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7748 ax-cnex 11204 ax-resscn 11205 ax-1cn 11206 ax-icn 11207 ax-addcl 11208 ax-addrcl 11209 ax-mulcl 11210 ax-mulrcl 11211 ax-mulcom 11212 ax-addass 11213 ax-mulass 11214 ax-distr 11215 ax-i2m1 11216 ax-1ne0 11217 ax-1rid 11218 ax-rnegex 11219 ax-rrecex 11220 ax-cnre 11221 ax-pre-lttri 11222 ax-pre-lttrn 11223 ax-pre-ltadd 11224 ax-pre-mulgt0 11225

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7879 df-1st 8001 df-2nd 8002 df-tpos 8240 df-frecs 8295 df-wrecs 8326 df-recs 8400 df-rdg 8439 df-er 8733 df-map 8855 df-en 8973 df-dom 8974 df-sdom 8975 df-pnf 11290 df-mnf 11291 df-xr 11292 df-ltxr 11293 df-le 11294 df-sub 11486 df-neg 11487 df-nn 12253 df-2 12315 df-3 12316 df-4 12317 df-5 12318 df-6 12319 df-7 12320 df-8 12321 df-sets 17142 df-slot 17160 df-ndx 17172 df-base 17190 df-plusg 17255 df-mulr 17256 df-sca 17258 df-vsca 17259 df-ip 17260 df-0g 17432 df-mgm 18609 df-sgrp 18688 df-mnd 18704 df-mhm 18749 df-grp 18907 df-minusg 18908 df-sbg 18909 df-ghm 19182 df-cmn 19751 df-abl 19752 df-mgp 20089 df-ur 20136 df-ring 20189 df-oppr 20287 df-rhm 20425 df-staf 20739 df-srng 20740 df-lmod 20759 df-lmhm 20921 df-lvec 21002 df-sra 21072 df-rgmod 21073 df-phl 21572

This theorem is referenced by: cph2subdi 25166 ipcau2 25190 tcphcphlem1 25191

W3C validator