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

Theorem nvaddsub4 31318
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
StepHypRef Expression
1 neg1cn 12344 . . . . . 6 -1 ∈ ℂ
2 nvpncan2.1 . . . . . . 7 𝑋 = (BaseSet‘𝑈)
3 nvpncan2.2 . . . . . . 7 𝐺 = ( +𝑣 ‘𝑈)
4 eqid 2766 . . . . . . 7 ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈)
52, 3, 4nvdi 31291 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ ( -1 ∈ ℂ ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ( -1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = (( -1( ·𝑠OLD ‘𝑈)𝐶)𝐺( -1( ·𝑠OLD ‘𝑈)𝐷)))
61, 5mp3anr1 1490 . . . . 5 ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ( -1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = (( -1( ·𝑠OLD ‘𝑈)𝐶)𝐺( -1( ·𝑠OLD ‘𝑈)𝐷)))
763adant2 1150 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ( -1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷)) = (( -1( ·𝑠OLD ‘𝑈)𝐶)𝐺( -1( ·𝑠OLD ‘𝑈)𝐷)))
87oveq2d 7466 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺( -1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺𝐵)𝐺(( -1( ·𝑠OLD ‘𝑈)𝐶)𝐺( -1( ·𝑠OLD ‘𝑈)𝐷))))
92, 4nvscl 31287 . . . . . . 7 ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → ( -1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋)
101, 9mp3an2 1481 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋) → ( -1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋)
112, 4nvscl 31287 . . . . . . 7 ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐷 ∈ 𝑋) → ( -1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)
121, 11mp3an2 1481 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ 𝐷 ∈ 𝑋) → ( -1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)
1310, 12anim12dan 631 . . . . 5 ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (( -1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ ( -1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋))
14133adant2 1150 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (( -1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ ( -1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋))
152, 3nvadd4 31286 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (( -1( ·𝑠OLD ‘𝑈)𝐶) ∈ 𝑋 ∧ ( -1( ·𝑠OLD ‘𝑈)𝐷) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(( -1( ·𝑠OLD ‘𝑈)𝐶)𝐺( -1( ·𝑠OLD ‘𝑈)𝐷))) = ((𝐴𝐺( -1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺( -1( ·𝑠OLD ‘𝑈)𝐷))))
1614, 15syld3an3 1439 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(( -1( ·𝑠OLD ‘𝑈)𝐶)𝐺( -1( ·𝑠OLD ‘𝑈)𝐷))) = ((𝐴𝐺( -1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺( -1( ·𝑠OLD ‘𝑈)𝐷))))
178, 16eqtrd 2801 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺( -1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺( -1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺( -1( ·𝑠OLD ‘𝑈)𝐷))))
18 simp1 1155 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → 𝑈 ∈ NrmCVec)
192, 3nvgcl 31281 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
20193expb 1139 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
21203adant3 1151 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
222, 3nvgcl 31281 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐶𝐺𝐷) ∈ 𝑋)
23223expb 1139 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
24233adant2 1150 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
25 nvpncan2.3 . . . 4 𝑀 = ( −𝑣 ‘𝑈)
262, 3, 4, 25nvmval 31303 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝐺𝐷) ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺( -1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))))
2718, 21, 24, 26syl3anc 1401 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺( -1( ·𝑠OLD ‘𝑈)(𝐶𝐺𝐷))))
282, 3, 4, 25nvmval 31303 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝑀𝐶) = (𝐴𝐺( -1( ·𝑠OLD ‘𝑈)𝐶)))
29283adant3r 1202 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺( -1( ·𝑠OLD ‘𝑈)𝐶)))
30293adant2r 1200 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺( -1( ·𝑠OLD ‘𝑈)𝐶)))
312, 3, 4, 25nvmval 31303 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐵𝑀𝐷) = (𝐵𝐺( -1( ·𝑠OLD ‘𝑈)𝐷)))
32313adant3l 1201 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺( -1( ·𝑠OLD ‘𝑈)𝐷)))
33323adant2l 1199 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺( -1( ·𝑠OLD ‘𝑈)𝐷)))
3430, 33oveq12d 7468 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)) = ((𝐴𝐺( -1( ·𝑠OLD ‘𝑈)𝐶))𝐺(𝐵𝐺( -1( ·𝑠OLD ‘𝑈)𝐷))))
3517, 27, 343eqtr4d 2811 1 ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ‘cfv 6565  (class class class)co 7450  ℂcc 11236  1c1 11239   -cneg 11580  NrmCVeccnv 31245   +𝑣 cpv 31246  BaseSetcba 31247   ·𝑠OLD cns 31248   −𝑣 cnsb 31250
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-po 5565  df-so 5566  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-pnf 11383  df-mnf 11384  df-ltxr 11386  df-sub 11581  df-neg 11582  df-grpo 31154  df-gid 31155  df-ginv 31156  df-gdiv 31157  df-ablo 31206  df-vc 31220  df-nv 31253  df-va 31256  df-ba 31257  df-sm 31258  df-0v 31259  df-vs 31260  df-nmcv 31261
This theorem is used by:  vacn  31355  minvecolem2  31536
  Copyright terms: Public domain W3C validator