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

Theorem nvaddsub4 30689
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 12407 . . . . . 6 -1 ∈ ℂ
2 nvpncan2.1 . . . . . . 7 𝑋 = (BaseSet‘𝑈)
3 nvpncan2.2 . . . . . . 7 𝐺 = ( +𝑣𝑈)
4 eqid 2740 . . . . . . 7 ( ·𝑠OLD𝑈) = ( ·𝑠OLD𝑈)
52, 3, 4nvdi 30662 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ (-1 ∈ ℂ ∧ 𝐶𝑋𝐷𝑋)) → (-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷)))
61, 5mp3anr1 1458 . . . . 5 ((𝑈 ∈ NrmCVec ∧ (𝐶𝑋𝐷𝑋)) → (-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷)))
763adant2 1131 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷)) = ((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷)))
87oveq2d 7464 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷))))
92, 4nvscl 30658 . . . . . . 7 ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐶𝑋) → (-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋)
101, 9mp3an2 1449 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ 𝐶𝑋) → (-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋)
112, 4nvscl 30658 . . . . . . 7 ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐷𝑋) → (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋)
121, 11mp3an2 1449 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ 𝐷𝑋) → (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋)
1310, 12anim12dan 618 . . . . 5 ((𝑈 ∈ NrmCVec ∧ (𝐶𝑋𝐷𝑋)) → ((-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋))
14133adant2 1131 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋))
152, 3nvadd4 30657 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ ((-1( ·𝑠OLD𝑈)𝐶) ∈ 𝑋 ∧ (-1( ·𝑠OLD𝑈)𝐷) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷))))
1614, 15syld3an3 1409 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝐺((-1( ·𝑠OLD𝑈)𝐶)𝐺(-1( ·𝑠OLD𝑈)𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷))))
178, 16eqtrd 2780 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷))) = ((𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷))))
18 simp1 1136 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → 𝑈 ∈ NrmCVec)
192, 3nvgcl 30652 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
20193expb 1120 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
21203adant3 1132 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (𝐴𝐺𝐵) ∈ 𝑋)
222, 3nvgcl 30652 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐶𝑋𝐷𝑋) → (𝐶𝐺𝐷) ∈ 𝑋)
23223expb 1120 . . . 4 ((𝑈 ∈ NrmCVec ∧ (𝐶𝑋𝐷𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
24233adant2 1131 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (𝐶𝐺𝐷) ∈ 𝑋)
25 nvpncan2.3 . . . 4 𝑀 = ( −𝑣𝑈)
262, 3, 4, 25nvmval 30674 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝐺𝐷) ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷))))
2718, 21, 24, 26syl3anc 1371 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD𝑈)(𝐶𝐺𝐷))))
282, 3, 4, 25nvmval 30674 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶)))
29283adant3r 1181 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝐴𝑋 ∧ (𝐶𝑋𝐷𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶)))
30293adant2r 1179 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (𝐴𝑀𝐶) = (𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶)))
312, 3, 4, 25nvmval 30674 . . . . 5 ((𝑈 ∈ NrmCVec ∧ 𝐵𝑋𝐷𝑋) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷)))
32313adant3l 1180 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝐵𝑋 ∧ (𝐶𝑋𝐷𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷)))
33323adant2l 1178 . . 3 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → (𝐵𝑀𝐷) = (𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷)))
3430, 33oveq12d 7466 . 2 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)) = ((𝐴𝐺(-1( ·𝑠OLD𝑈)𝐶))𝐺(𝐵𝐺(-1( ·𝑠OLD𝑈)𝐷))))
3517, 27, 343eqtr4d 2790 1 ((𝑈 ∈ NrmCVec ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐷𝑋)) → ((𝐴𝐺𝐵)𝑀(𝐶𝐺𝐷)) = ((𝐴𝑀𝐶)𝐺(𝐵𝑀𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1537  wcel 2108  cfv 6573  (class class class)co 7448  cc 11182  1c1 11185  -cneg 11521  NrmCVeccnv 30616   +𝑣 cpv 30617  BaseSetcba 30618   ·𝑠OLD cns 30619  𝑣 cnsb 30621
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-po 5607  df-so 5608  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-er 8763  df-en 9004  df-dom 9005  df-sdom 9006  df-pnf 11326  df-mnf 11327  df-ltxr 11329  df-sub 11522  df-neg 11523  df-grpo 30525  df-gid 30526  df-ginv 30527  df-gdiv 30528  df-ablo 30577  df-vc 30591  df-nv 30624  df-va 30627  df-ba 30628  df-sm 30629  df-0v 30630  df-vs 30631  df-nmcv 30632
This theorem is referenced by:  vacn  30726  minvecolem2  30907
  Copyright terms: Public domain W3C validator