Theorem nvaddsub4 31178

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 12260	. . . . . 6 ⊢ -1 ∈ ℂ
2		nvpncan2.1	. . . . . . 7 ⊢ 𝑋 = (BaseSet‘𝑈)
3		nvpncan2.2	. . . . . . 7 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
4		eqid 2760	. . . . . . 7 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈)
5	2, 3, 4	nvdi 31151	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ (-1 ∈ ℂ ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
6	1, 5	mp3anr1 1487	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
7	6	3adant2 1149	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
8	7	oveq2d 7425	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
9	2, 4	nvscl 31147	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋)
10	1, 9	mp3an2 1478	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋)
11	2, 4	nvscl 31147	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐷 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)
12	1, 11	mp3an2 1478	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐷 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)
13	10, 12	anim12dan 631	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋))
14	13	3adant2 1149	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋))
15	2, 3	nvadd4 31146	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ((-1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
16	14, 15	syld3an3 1436	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD ‘𝑈)𝐶)𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
17	8, 16	eqtrd 2795	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
18		simp1 1154	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → 𝑈 ∈ NrmCVec)
19	2, 3	nvgcl 31141	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
20	19	3expb 1138	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
21	20	3adant3 1150	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
22	2, 3	nvgcl 31141	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐶𝐺𝐷) ∈ 𝑋)
23	22	3expb 1138	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
24	23	3adant2 1149	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
25		nvpncan2.3	. . . 4 ⊢ 𝑀 = ( −𝑣 ‘𝑈)
26	2, 3, 4, 25	nvmval 31163	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝐺𝐷) ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))))
27	18, 21, 24, 26	syl3anc 1398	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))))
28	2, 3, 4, 25	nvmval 31163	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶)))
29	28	3adant3r 1200	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶)))
30	29	3adant2r 1198	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶)))
31	2, 3, 4, 25	nvmval 31163	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
32	31	3adant3l 1199	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
33	32	3adant2l 1197	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷)))
34	30, 33	oveq12d 7427	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD ‘𝑈)𝐷))))
35	17, 27, 34	3eqtr4d 2805	1 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ‘cfv 6528  (class class class)co 7409  ℂcc 11155  1c1 11158  -cneg 11499  NrmCVeccnv 31105   +_𝑣 cpv 31106  BaseSetcba 31107   ·_𝑠OLD cns 31108   −_𝑣 cnsb 31110

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7735  ax-resscn 11214  ax-1cn 11215  ax-icn 11216  ax-addcl 11217  ax-addrcl 11218  ax-mulcl 11219  ax-mulrcl 11220  ax-mulcom 11221  ax-addass 11222  ax-mulass 11223  ax-distr 11224  ax-i2m1 11225  ax-1ne0 11226  ax-1rid 11227  ax-rnegex 11228  ax-rrecex 11229  ax-cnre 11230  ax-pre-lttri 11231  ax-pre-lttrn 11232  ax-pre-ltadd 11233

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5543  df-po 5556  df-so 5557  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-riota 7366  df-ov 7412  df-oprab 7413  df-mpo 7414  df-1st 7985  df-2nd 7986  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11302  df-mnf 11303  df-ltxr 11305  df-sub 11500  df-neg 11501  df-grpo 31014  df-gid 31015  df-ginv 31016  df-gdiv 31017  df-ablo 31066  df-vc 31080  df-nv 31113  df-va 31116  df-ba 31117  df-sm 31118  df-0v 31119  df-vs 31120  df-nmcv 31121

This theorem is used by:  vacn  31215  minvecolem2  31396