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

Theorem nvaddsub4 31124
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 12230 . . . . . 6 -1 ∈ ℂ
2 nvpncan2.1 . . . . . . 7 𝑋 = (BaseSet‘𝑈)
3 nvpncan2.2 . . . . . . 7 𝐺 = ( +𝑣𝑈)
4 eqid 2762 . . . . . . 7 ( ·𝑠OLD𝑈) = ( ·𝑠OLD𝑈)
52, 3, 4nvdi 31097 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ (-1 ∈ ℂ ∧ 𝐶𝑋𝐷𝑋)) → (-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷)))
61, 5mp3anr1 1487 . . . . 5 ((𝑈 ∈ NrmCVec ∧ (𝐶𝑋𝐷𝑋)) → (-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷)))
763adant2 1149 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷)))
87oveq2d 7432 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷))))
92, 4nvscl 31093 . . . . . . 7 ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐶𝑋) → (-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋)
101, 9mp3an2 1478 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ 𝐶𝑋) → (-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋)
112, 4nvscl 31093 . . . . . . 7 ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐷𝑋) → (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋)
121, 11mp3an2 1478 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ 𝐷𝑋) → (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋)
1310, 12anim12dan 631 . . . . 5 ((𝑈 ∈ NrmCVec ∧ (𝐶𝑋𝐷𝑋)) → ((-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋))
14133adant2 1149 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋))
152, 3nvadd4 31092 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ ((-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷))))
1614, 15syld3an3 1436 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷))))
178, 16eqtrd 2797 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷))))
18 simp1 1154 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → 𝑈 ∈ NrmCVec)
192, 3nvgcl 31087 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
20193expb 1138 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
21203adant3 1150 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
222, 3nvgcl 31087 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐶𝑋𝐷𝑋) → (𝐶𝐺𝐷) ∈ 𝑋)
23223expb 1138 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐶𝑋𝐷𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
24233adant2 1149 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
25 nvpncan2.3 . . . 4 𝑀 = ( −𝑣𝑈)
262, 3, 4, 25nvmval 31109 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝐺𝐷) ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷))))
2718, 21, 24, 26syl3anc 1398 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷))))
282, 3, 4, 25nvmval 31109 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶)))
29283adant3r 1200 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝐴𝑋 ∧ (𝐶𝑋𝐷𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶)))
30293adant2r 1198 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶)))
312, 3, 4, 25nvmval 31109 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐵𝑋𝐷𝑋) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷)))
32313adant3l 1199 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝐵𝑋 ∧ (𝐶𝑋𝐷𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷)))
33323adant2l 1197 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷)))
3430, 33oveq12d 7434 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)) = ((𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷))))
3517, 27, 343eqtr4d 2807 1 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  cfv 6537  (class class class)co 7416  cc 11125  1c1 11128  -cneg 11469  NrmCVeccnv 31051   +𝑣 cpv 31052  BaseSetcba 31053   ·𝑠OLD cns 31054  𝑣 cnsb 31056
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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11272  df-mnf 11273  df-ltxr 11275  df-sub 11470  df-neg 11471  df-grpo 30960  df-gid 30961  df-ginv 30962  df-gdiv 30963  df-ablo 31012  df-vc 31026  df-nv 31059  df-va 31062  df-ba 31063  df-sm 31064  df-0v 31065  df-vs 31066  df-nmcv 31067
This theorem is used by:  vacn  31161  minvecolem2  31342
  Copyright terms: Public domain W3C validator