Theorem nvaddsub4 27512

Description: Rearrangement of 4 terms in a mixed vector addition and subtraction. (Contributed by NM, 8-Feb-2008.) (New usage is discouraged.)

Hypotheses

Ref	Expression
nvpncan2.1	⊢ 𝑋 = (BaseSet‘𝑈)
nvpncan2.2	⊢ 𝐺 = ( +𝑣 ‘𝑈)
nvpncan2.3	⊢ 𝑀 = ( −𝑣 ‘𝑈)

Assertion

Ref	Expression
nvaddsub4	⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)))

Proof of Theorem nvaddsub4

Step	Hyp	Ref	Expression
1		neg1cn 11124	. . . . . 6 ⊢ -1 ∈ ℂ
2		nvpncan2.1	. . . . . . 7 ⊢ 𝑋 = (BaseSet‘𝑈)
3		nvpncan2.2	. . . . . . 7 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
4		eqid 2622	. . . . . . 7 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈)
5	2, 3, 4	nvdi 27485	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ (-1 ∈ ℂ ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
6	1, 5	mp3anr1 1421	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
7	6	3adant2 1080	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
8	7	oveq2d 6666	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
9	2, 4	nvscl 27481	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋)
10	1, 9	mp3an2 1412	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋)
11	2, 4	nvscl 27481	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐷 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)
12	1, 11	mp3an2 1412	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐷 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)
13	10, 12	anim12dan 882	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋))
14	13	3adant2 1080	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋))
15	2, 3	nvadd4 27480	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ((-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
16	14, 15	syld3an3 1371	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
17	8, 16	eqtrd 2656	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
18		simp1 1061	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → 𝑈 ∈ NrmCVec)
19	2, 3	nvgcl 27475	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
20	19	3expb 1266	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
21	20	3adant3 1081	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
22	2, 3	nvgcl 27475	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐶𝐺𝐷) ∈ 𝑋)
23	22	3expb 1266	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
24	23	3adant2 1080	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
25		nvpncan2.3	. . . 4 ⊢ 𝑀 = ( −𝑣 ‘𝑈)
26	2, 3, 4, 25	nvmval 27497	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝐺𝐷) ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))))
27	18, 21, 24, 26	syl3anc 1326	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))))
28	2, 3, 4, 25	nvmval 27497	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶)))
29	28	3adant3r 1323	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶)))
30	29	3adant2r 1321	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶)))
31	2, 3, 4, 25	nvmval 27497	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
32	31	3adant3l 1322	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
33	32	3adant2l 1320	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
34	30, 33	oveq12d 6668	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
35	17, 27, 34	3eqtr4d 2666	1 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)))

Syntax hints:   → wi 4   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990  ‘cfv 5888  (class class class)co 6650  ℂcc 9934  1c1 9937  -cneg 10267  NrmCVeccnv 27439   +_𝑣 cpv 27440  BaseSetcba 27441   ·_𝑠OLD cns 27442   −_𝑣 cnsb 27444

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-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

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-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-po 5035  df-so 5036  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-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-1st 7168  df-2nd 7169  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-pnf 10076  df-mnf 10077  df-ltxr 10079  df-sub 10268  df-neg 10269  df-grpo 27347  df-gid 27348  df-ginv 27349  df-gdiv 27350  df-ablo 27399  df-vc 27414  df-nv 27447  df-va 27450  df-ba 27451  df-sm 27452  df-0v 27453  df-vs 27454  df-nmcv 27455

This theorem is referenced by:  vacn  27549  minvecolem2  27731