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 21416

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 2730	. . . 4 ⊢ (Base‘𝐹) = (Base‘𝐹)
2		ip2subdi.p	. . . 4 ⊢ + = (+_g‘𝐹)
3		ipsubdir.s	. . . 4 ⊢ 𝑆 = (-_g‘𝐹)
4		ip2subdi.1	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ PreHil)
5		phllmod 21402	. . . . . . 7 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod)
6	4, 5	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LMod)
7		phlsrng.f	. . . . . . 7 ⊢ 𝐹 = (Scalar‘𝑊)
8	7	lmodring 20622	. . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring)
9	6, 8	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ Ring)
10		ringabl 20169	. . . . 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 21405	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 , 𝐶) ∈ (Base‘𝐹))
17	4, 12, 13, 16	syl3anc 1369	. . . 4 ⊢ (𝜑 → (𝐴 , 𝐶) ∈ (Base‘𝐹))
18		ip2subdi.5	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ 𝑉)
19	7, 14, 15, 1	ipcl 21405	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉) → (𝐴 , 𝐷) ∈ (Base‘𝐹))
20	4, 12, 18, 19	syl3anc 1369	. . . 4 ⊢ (𝜑 → (𝐴 , 𝐷) ∈ (Base‘𝐹))
21		ip2subdi.3	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
22	7, 14, 15, 1	ipcl 21405	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐵 , 𝐶) ∈ (Base‘𝐹))
23	4, 21, 13, 22	syl3anc 1369	. . . 4 ⊢ (𝜑 → (𝐵 , 𝐶) ∈ (Base‘𝐹))
24	1, 2, 3, 11, 17, 20, 23	ablsubsub4 19727	. . 3 ⊢ (𝜑 → (((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆(𝐵 , 𝐶)) = ((𝐴 , 𝐶)𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))))
25	24	oveq1d 7426	. 2 ⊢ (𝜑 → ((((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆(𝐵 , 𝐶)) + (𝐵 , 𝐷)) = (((𝐴 , 𝐶)𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) + (𝐵 , 𝐷)))
26		ipsubdir.m	. . . . . 6 ⊢ − = (-_g‘𝑊)
27	15, 26	lmodvsubcl 20661	. . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉) → (𝐶 − 𝐷) ∈ 𝑉)
28	6, 13, 18, 27	syl3anc 1369	. . . 4 ⊢ (𝜑 → (𝐶 − 𝐷) ∈ 𝑉)
29	7, 14, 15, 26, 3	ipsubdir 21414	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ (𝐶 − 𝐷) ∈ 𝑉)) → ((𝐴 − 𝐵) , (𝐶 − 𝐷)) = ((𝐴 , (𝐶 − 𝐷))𝑆(𝐵 , (𝐶 − 𝐷))))
30	4, 12, 21, 28, 29	syl13anc 1370	. . 3 ⊢ (𝜑 → ((𝐴 − 𝐵) , (𝐶 − 𝐷)) = ((𝐴 , (𝐶 − 𝐷))𝑆(𝐵 , (𝐶 − 𝐷))))
31	7, 14, 15, 26, 3	ipsubdi 21415	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → (𝐴 , (𝐶 − 𝐷)) = ((𝐴 , 𝐶)𝑆(𝐴 , 𝐷)))
32	4, 12, 13, 18, 31	syl13anc 1370	. . . 4 ⊢ (𝜑 → (𝐴 , (𝐶 − 𝐷)) = ((𝐴 , 𝐶)𝑆(𝐴 , 𝐷)))
33	7, 14, 15, 26, 3	ipsubdi 21415	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → (𝐵 , (𝐶 − 𝐷)) = ((𝐵 , 𝐶)𝑆(𝐵 , 𝐷)))
34	4, 21, 13, 18, 33	syl13anc 1370	. . . 4 ⊢ (𝜑 → (𝐵 , (𝐶 − 𝐷)) = ((𝐵 , 𝐶)𝑆(𝐵 , 𝐷)))
35	32, 34	oveq12d 7429	. . 3 ⊢ (𝜑 → ((𝐴 , (𝐶 − 𝐷))𝑆(𝐵 , (𝐶 − 𝐷))) = (((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆((𝐵 , 𝐶)𝑆(𝐵 , 𝐷))))
36		ringgrp 20132	. . . . . 6 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Grp)
37	9, 36	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ Grp)
38	1, 3	grpsubcl 18939	. . . . 5 ⊢ ((𝐹 ∈ Grp ∧ (𝐴 , 𝐶) ∈ (Base‘𝐹) ∧ (𝐴 , 𝐷) ∈ (Base‘𝐹)) → ((𝐴 , 𝐶)𝑆(𝐴 , 𝐷)) ∈ (Base‘𝐹))
39	37, 17, 20, 38	syl3anc 1369	. . . 4 ⊢ (𝜑 → ((𝐴 , 𝐶)𝑆(𝐴 , 𝐷)) ∈ (Base‘𝐹))
40	7, 14, 15, 1	ipcl 21405	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉) → (𝐵 , 𝐷) ∈ (Base‘𝐹))
41	4, 21, 18, 40	syl3anc 1369	. . . 4 ⊢ (𝜑 → (𝐵 , 𝐷) ∈ (Base‘𝐹))
42	1, 2, 3, 11, 39, 23, 41	ablsubsub 19726	. . 3 ⊢ (𝜑 → (((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆((𝐵 , 𝐶)𝑆(𝐵 , 𝐷))) = ((((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆(𝐵 , 𝐶)) + (𝐵 , 𝐷)))
43	30, 35, 42	3eqtrd 2774	. 2 ⊢ (𝜑 → ((𝐴 − 𝐵) , (𝐶 − 𝐷)) = ((((𝐴 , 𝐶)𝑆(𝐴 , 𝐷))𝑆(𝐵 , 𝐶)) + (𝐵 , 𝐷)))
44	1, 2	ringacl 20166	. . . 4 ⊢ ((𝐹 ∈ Ring ∧ (𝐴 , 𝐷) ∈ (Base‘𝐹) ∧ (𝐵 , 𝐶) ∈ (Base‘𝐹)) → ((𝐴 , 𝐷) + (𝐵 , 𝐶)) ∈ (Base‘𝐹))
45	9, 20, 23, 44	syl3anc 1369	. . 3 ⊢ (𝜑 → ((𝐴 , 𝐷) + (𝐵 , 𝐶)) ∈ (Base‘𝐹))
46	1, 2, 3	abladdsub 19721	. . 3 ⊢ ((𝐹 ∈ Abel ∧ ((𝐴 , 𝐶) ∈ (Base‘𝐹) ∧ (𝐵 , 𝐷) ∈ (Base‘𝐹) ∧ ((𝐴 , 𝐷) + (𝐵 , 𝐶)) ∈ (Base‘𝐹))) → (((𝐴 , 𝐶) + (𝐵 , 𝐷))𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) = (((𝐴 , 𝐶)𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) + (𝐵 , 𝐷)))
47	11, 17, 41, 45, 46	syl13anc 1370	. 2 ⊢ (𝜑 → (((𝐴 , 𝐶) + (𝐵 , 𝐷))𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) = (((𝐴 , 𝐶)𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))) + (𝐵 , 𝐷)))
48	25, 43, 47	3eqtr4d 2780	1 ⊢ (𝜑 → ((𝐴 − 𝐵) , (𝐶 − 𝐷)) = (((𝐴 , 𝐶) + (𝐵 , 𝐷))𝑆((𝐴 , 𝐷) + (𝐵 , 𝐶))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2104 ‘cfv 6542 (class class class)co 7411 Basecbs 17148 +_gcplusg 17201 Scalarcsca 17204 ·_𝑖cip 17206 Grpcgrp 18855 -_gcsg 18857 Abelcabl 19690 Ringcrg 20127 LModclmod 20614 PreHilcphl 21396

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-tpos 8213 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-2 12279 df-3 12280 df-4 12281 df-5 12282 df-6 12283 df-7 12284 df-8 12285 df-sets 17101 df-slot 17119 df-ndx 17131 df-base 17149 df-plusg 17214 df-mulr 17215 df-sca 17217 df-vsca 17218 df-ip 17219 df-0g 17391 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-mhm 18705 df-grp 18858 df-minusg 18859 df-sbg 18860 df-ghm 19128 df-cmn 19691 df-abl 19692 df-mgp 20029 df-ur 20076 df-ring 20129 df-oppr 20225 df-rhm 20363 df-staf 20596 df-srng 20597 df-lmod 20616 df-lmhm 20777 df-lvec 20858 df-sra 20930 df-rgmod 20931 df-phl 21398

This theorem is referenced by: cph2subdi 24958 ipcau2 24982 tcphcphlem1 24983

W3C validator