HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem mulcnsr 6406
Description: Multiplication of complex numbers in terms of signed reals.
Assertion
Ref Expression
mulcnsr |- (((A e. R. /\ B e. R.) /\ (C e. R. /\ D e. R.)) -> (<.A, B>. x. <.C, D>.) = <.((A .R C) +R (-1R .R (B .R D))), ((B .R C) +R (A .R D))>.)

Proof of Theorem mulcnsr
StepHypRef Expression
1 opex 3527 . 2 |- <.((A .R C) +R (-1R .R (B .R D))), ((B .R C) +R (A .R D))>. e. _V
2 opreq1 4889 . . . . 5 |- (w = A -> (w .R u) = (A .R u))
3 opreq1 4889 . . . . . 6 |- (v = B -> (v .R f) = (B .R f))
43opreq2d 4898 . . . . 5 |- (v = B -> (-1R .R (v .R f)) = (-1R .R (B .R f)))
52, 4opreqan12d 4902 . . . 4 |- ((w = A /\ v = B) -> ((w .R u) +R (-1R .R (v .R f))) = ((A .R u) +R (-1R .R (B .R f))))
6 opreq1 4889 . . . . 5 |- (v = B -> (v .R u) = (B .R u))
7 opreq1 4889 . . . . 5 |- (w = A -> (w .R f) = (A .R f))
86, 7opreqan12rd 4903 . . . 4 |- ((w = A /\ v = B) -> ((v .R u) +R (w .R f)) = ((B .R u) +R (A .R f)))
95, 8opeq12d 3166 . . 3 |- ((w = A /\ v = B) -> <.((w .R u) +R (-1R .R (v .R f))), ((v .R u) +R (w .R f))>. = <.((A .R u) +R (-1R .R (B .R f))), ((B .R u) +R (A .R f))>.)
10 opreq2 4890 . . . . 5 |- (u = C -> (A .R u) = (A .R C))
11 opreq2 4890 . . . . . 6 |- (f = D -> (B .R f) = (B .R D))
1211opreq2d 4898 . . . . 5 |- (f = D -> (-1R .R (B .R f)) = (-1R .R (B .R D)))
1310, 12opreqan12d 4902 . . . 4 |- ((u = C /\ f = D) -> ((A .R u) +R (-1R .R (B .R f))) = ((A .R C) +R (-1R .R (B .R D))))
14 opreq2 4890 . . . . 5 |- (u = C -> (B .R u) = (B .R C))
15 opreq2 4890 . . . . 5 |- (f = D -> (A .R f) = (A .R D))
1614, 15opreqan12d 4902 . . . 4 |- ((u = C /\ f = D) -> ((B .R u) +R (A .R f)) = ((B .R C) +R (A .R D)))
1713, 16opeq12d 3166 . . 3 |- ((u = C /\ f = D) -> <.((A .R u) +R (-1R .R (B .R f))), ((B .R u) +R (A .R f))>. = <.((A .R C) +R (-1R .R (B .R D))), ((B .R C) +R (A .R D))>.)
189, 17sylan9eq 1948 . 2 |- (((w = A /\ v = B) /\ (u = C /\ f = D)) -> <.((w .R u) +R (-1R .R (v .R f))), ((v .R u) +R (w .R f))>. = <.((A .R C) +R (-1R .R (B .R D))), ((B .R C) +R (A .R D))>.)
19 df-mul 6398 . . 3 |- x. = {<.<.x, y>., z>. | ((x e. CC /\ y e. CC) /\ E.wE.vE.uE.f((x = <.w, v>. /\ y = <.u, f>.) /\ z = <.((w .R u) +R (-1R .R (v .R f))), ((v .R u) +R (w .R f))>.))}
20 df-c 6392 . . . . . . 7 |- CC = (R. X. R.)
2120eleq2i 1961 . . . . . 6 |- (x e. CC <-> x e. (R. X. R.))
2220eleq2i 1961 . . . . . 6 |- (y e. CC <-> y e. (R. X. R.))
2321, 22anbi12i 540 . . . . 5 |- ((x e. CC /\ y e. CC) <-> (x e. (R. X. R.) /\ y e. (R. X. R.)))
2423anbi1i 539 . . . 4 |- (((x e. CC /\ y e. CC) /\ E.wE.vE.uE.f((x = <.w, v>. /\ y = <.u, f>.) /\ z = <.((w .R u) +R (-1R .R (v .R f))), ((v .R u) +R (w .R f))>.)) <-> ((x e. (R. X. R.) /\ y e. (R. X. R.)) /\ E.wE.vE.uE.f((x = <.w, v>. /\ y = <.u, f>.) /\ z = <.((w .R u) +R (-1R .R (v .R f))), ((v .R u) +R (w .R f))>.)))
2524oprabbii 4923 . . 3 |- {<.<.x, y>., z>. | ((x e. CC /\ y e. CC) /\ E.wE.vE.uE.f((x = <.w, v>. /\ y = <.u, f>.) /\ z = <.((w .R u) +R (-1R .R (v .R f))), ((v .R u) +R (w .R f))>.))} = {<.<.x, y>., z>. | ((x e. (R. X. R.) /\ y e. (R. X. R.)) /\ E.wE.vE.uE.f((x = <.w, v>. /\ y = <.u, f>.) /\ z = <.((w .R u) +R (-1R .R (v .R f))), ((v .R u) +R (w .R f))>.))}
2619, 25eqtri 1908 . 2 |- x. = {<.<.x, y>., z>. | ((x e. (R. X. R.) /\ y e. (R. X. R.)) /\ E.wE.vE.uE.f((x = <.w, v>. /\ y = <.u, f>.) /\ z = <.((w .R u) +R (-1R .R (v .R f))), ((v .R u) +R (w .R f))>.))}
271, 18, 26oprabval3 4959 1 |- (((A e. R. /\ B e. R.) /\ (C e. R. /\ D e. R.)) -> (<.A, B>. x. <.C, D>.) = <.((A .R C) +R (-1R .R (B .R D))), ((B .R C) +R (A .R D))>.)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 240   = wceq 1298   e. wcel 1300  E.wex 1326  <.cop 3046   X. cxp 3984  (class class class)co 4884  {copab2 4885  R.cnr 6145  -1Rcm1r 6148   +R cplr 6149   .R cmr 6150  CCcc 6384   x. cmul 6391
This theorem is referenced by:  mulresr 6409  mulcnsrec 6416  axmulopr 6418  ax1id 6435  axi2m1 6438  axcnre 6439
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-rex 2110  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-id 3586  df-xp 4000  df-rel 4001  df-cnv 4002  df-co 4003  df-dm 4004  df-rn 4005  df-res 4006  df-ima 4007  df-fun 4008  df-fv 4014  df-opr 4886  df-oprab 4887  df-c 6392  df-mul 6398
Copyright terms: Public domain