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

Theorem mulcnsr 11072
Description: Multiplication of complex numbers in terms of signed reals. (Contributed by NM, 9-Aug-1995.) (New usage is discouraged.)
Assertion
Ref Expression
mulcnsr (((𝐴R𝐵R) ∧ (𝐶R𝐷R)) → (⟨𝐴, 𝐵⟩ · ⟨𝐶, 𝐷⟩) = ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩)

Proof of Theorem mulcnsr
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opex 5421 . 2 ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩ ∈ V
2 oveq1 7364 . . . . 5 (𝑤 = 𝐴 → (𝑤 ·R 𝑢) = (𝐴 ·R 𝑢))
3 oveq1 7364 . . . . . 6 (𝑣 = 𝐵 → (𝑣 ·R 𝑓) = (𝐵 ·R 𝑓))
43oveq2d 7373 . . . . 5 (𝑣 = 𝐵 → (-1R ·R (𝑣 ·R 𝑓)) = (-1R ·R (𝐵 ·R 𝑓)))
52, 4oveqan12d 7376 . . . 4 ((𝑤 = 𝐴𝑣 = 𝐵) → ((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))) = ((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))))
6 oveq1 7364 . . . . 5 (𝑣 = 𝐵 → (𝑣 ·R 𝑢) = (𝐵 ·R 𝑢))
7 oveq1 7364 . . . . 5 (𝑤 = 𝐴 → (𝑤 ·R 𝑓) = (𝐴 ·R 𝑓))
86, 7oveqan12rd 7377 . . . 4 ((𝑤 = 𝐴𝑣 = 𝐵) → ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓)) = ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓)))
95, 8opeq12d 4838 . . 3 ((𝑤 = 𝐴𝑣 = 𝐵) → ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩ = ⟨((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))), ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓))⟩)
10 oveq2 7365 . . . . 5 (𝑢 = 𝐶 → (𝐴 ·R 𝑢) = (𝐴 ·R 𝐶))
11 oveq2 7365 . . . . . 6 (𝑓 = 𝐷 → (𝐵 ·R 𝑓) = (𝐵 ·R 𝐷))
1211oveq2d 7373 . . . . 5 (𝑓 = 𝐷 → (-1R ·R (𝐵 ·R 𝑓)) = (-1R ·R (𝐵 ·R 𝐷)))
1310, 12oveqan12d 7376 . . . 4 ((𝑢 = 𝐶𝑓 = 𝐷) → ((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))) = ((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))))
14 oveq2 7365 . . . . 5 (𝑢 = 𝐶 → (𝐵 ·R 𝑢) = (𝐵 ·R 𝐶))
15 oveq2 7365 . . . . 5 (𝑓 = 𝐷 → (𝐴 ·R 𝑓) = (𝐴 ·R 𝐷))
1614, 15oveqan12d 7376 . . . 4 ((𝑢 = 𝐶𝑓 = 𝐷) → ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓)) = ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷)))
1713, 16opeq12d 4838 . . 3 ((𝑢 = 𝐶𝑓 = 𝐷) → ⟨((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))), ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓))⟩ = ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩)
189, 17sylan9eq 2796 . 2 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩ = ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩)
19 df-mul 11063 . . 3 · = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
20 df-c 11057 . . . . . . 7 ℂ = (R × R)
2120eleq2i 2829 . . . . . 6 (𝑥 ∈ ℂ ↔ 𝑥 ∈ (R × R))
2220eleq2i 2829 . . . . . 6 (𝑦 ∈ ℂ ↔ 𝑦 ∈ (R × R))
2321, 22anbi12i 627 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ↔ (𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)))
2423anbi1i 624 . . . 4 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)) ↔ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)))
2524oprabbii 7424 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
2619, 25eqtri 2764 . 2 · = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
271, 18, 26ov3 7517 1 (((𝐴R𝐵R) ∧ (𝐶R𝐷R)) → (⟨𝐴, 𝐵⟩ · ⟨𝐶, 𝐷⟩) = ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wex 1781  wcel 2106  cop 4592   × cxp 5631  (class class class)co 7357  {coprab 7358  Rcnr 10801  -1Rcm1r 10804   +R cplr 10805   ·R cmr 10806  cc 11049   · cmul 11056
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-iota 6448  df-fun 6498  df-fv 6504  df-ov 7360  df-oprab 7361  df-c 11057  df-mul 11063
This theorem is referenced by:  mulresr  11075  mulcnsrec  11080  axmulf  11082  axi2m1  11095  axcnre  11100
  Copyright terms: Public domain W3C validator