Theorem nvaddsub4 30605

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 12113	. . . . . 6 ⊢ -1 ∈ ℂ
2		nvpncan2.1	. . . . . . 7 ⊢ 𝑋 = (BaseSet‘𝑈)
3		nvpncan2.2	. . . . . . 7 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
4		eqid 2729	. . . . . . 7 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈)
5	2, 3, 4	nvdi 30578	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ (-1 ∈ ℂ ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
6	1, 5	mp3anr1 1460	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
7	6	3adant2 1131	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
8	7	oveq2d 7365	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
9	2, 4	nvscl 30574	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋)
10	1, 9	mp3an2 1451	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋)
11	2, 4	nvscl 30574	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐷 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)
12	1, 11	mp3an2 1451	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐷 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)
13	10, 12	anim12dan 619	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋))
14	13	3adant2 1131	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋))
15	2, 3	nvadd4 30573	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ((-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
16	14, 15	syld3an3 1411	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
17	8, 16	eqtrd 2764	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
18		simp1 1136	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → 𝑈 ∈ NrmCVec)
19	2, 3	nvgcl 30568	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
20	19	3expb 1120	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
21	20	3adant3 1132	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
22	2, 3	nvgcl 30568	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐶𝐺𝐷) ∈ 𝑋)
23	22	3expb 1120	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
24	23	3adant2 1131	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
25		nvpncan2.3	. . . 4 ⊢ 𝑀 = ( −𝑣 ‘𝑈)
26	2, 3, 4, 25	nvmval 30590	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝐺𝐷) ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))))
27	18, 21, 24, 26	syl3anc 1373	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))))
28	2, 3, 4, 25	nvmval 30590	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶)))
29	28	3adant3r 1182	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶)))
30	29	3adant2r 1180	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶)))
31	2, 3, 4, 25	nvmval 30590	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
32	31	3adant3l 1181	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
33	32	3adant2l 1179	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
34	30, 33	oveq12d 7367	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
35	17, 27, 34	3eqtr4d 2774	1 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ‘cfv 6482  (class class class)co 7349  ℂcc 11007  1c1 11010  -cneg 11348  NrmCVeccnv 30532   +_𝑣 cpv 30533  BaseSetcba 30534   ·_𝑠OLD cns 30535   −_𝑣 cnsb 30537

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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-resscn 11066  ax-1cn 11067  ax-icn 11068  ax-addcl 11069  ax-addrcl 11070  ax-mulcl 11071  ax-mulrcl 11072  ax-mulcom 11073  ax-addass 11074  ax-mulass 11075  ax-distr 11076  ax-i2m1 11077  ax-1ne0 11078  ax-1rid 11079  ax-rnegex 11080  ax-rrecex 11081  ax-cnre 11082  ax-pre-lttri 11083  ax-pre-lttrn 11084  ax-pre-ltadd 11085

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-id 5514  df-po 5527  df-so 5528  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-1st 7924  df-2nd 7925  df-er 8625  df-en 8873  df-dom 8874  df-sdom 8875  df-pnf 11151  df-mnf 11152  df-ltxr 11154  df-sub 11349  df-neg 11350  df-grpo 30441  df-gid 30442  df-ginv 30443  df-gdiv 30444  df-ablo 30493  df-vc 30507  df-nv 30540  df-va 30543  df-ba 30544  df-sm 30545  df-0v 30546  df-vs 30547  df-nmcv 30548

This theorem is referenced by:  vacn  30642  minvecolem2  30823