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

Theorem mulcnsr 11054
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 5406 . 2 ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩ ∈ V
2 oveq1 7367 . . . . 5 (𝑤 = 𝐴 → (𝑤 ·R 𝑢) = (𝐴 ·R 𝑢))
3 oveq1 7367 . . . . . 6 (𝑣 = 𝐵 → (𝑣 ·R 𝑓) = (𝐵 ·R 𝑓))
43oveq2d 7376 . . . . 5 (𝑣 = 𝐵 → (-1R ·R (𝑣 ·R 𝑓)) = (-1R ·R (𝐵 ·R 𝑓)))
52, 4oveqan12d 7379 . . . 4 ((𝑤 = 𝐴𝑣 = 𝐵) → ((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))) = ((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))))
6 oveq1 7367 . . . . 5 (𝑣 = 𝐵 → (𝑣 ·R 𝑢) = (𝐵 ·R 𝑢))
7 oveq1 7367 . . . . 5 (𝑤 = 𝐴 → (𝑤 ·R 𝑓) = (𝐴 ·R 𝑓))
86, 7oveqan12rd 7380 . . . 4 ((𝑤 = 𝐴𝑣 = 𝐵) → ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓)) = ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓)))
95, 8opeq12d 4815 . . 3 ((𝑤 = 𝐴𝑣 = 𝐵) → ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩ = ⟨((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))), ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓))⟩)
10 oveq2 7368 . . . . 5 (𝑢 = 𝐶 → (𝐴 ·R 𝑢) = (𝐴 ·R 𝐶))
11 oveq2 7368 . . . . . 6 (𝑓 = 𝐷 → (𝐵 ·R 𝑓) = (𝐵 ·R 𝐷))
1211oveq2d 7376 . . . . 5 (𝑓 = 𝐷 → (-1R ·R (𝐵 ·R 𝑓)) = (-1R ·R (𝐵 ·R 𝐷)))
1310, 12oveqan12d 7379 . . . 4 ((𝑢 = 𝐶𝑓 = 𝐷) → ((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))) = ((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))))
14 oveq2 7368 . . . . 5 (𝑢 = 𝐶 → (𝐵 ·R 𝑢) = (𝐵 ·R 𝐶))
15 oveq2 7368 . . . . 5 (𝑓 = 𝐷 → (𝐴 ·R 𝑓) = (𝐴 ·R 𝐷))
1614, 15oveqan12d 7379 . . . 4 ((𝑢 = 𝐶𝑓 = 𝐷) → ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓)) = ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷)))
1713, 16opeq12d 4815 . . 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 11045 . . 3 · = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
20 df-c 11039 . . . . . . 7 ℂ = (R × R)
2120eleq2i 2833 . . . . . 6 (𝑥 ∈ ℂ ↔ 𝑥 ∈ (R × R))
2220eleq2i 2833 . . . . . 6 (𝑦 ∈ ℂ ↔ 𝑦 ∈ (R × R))
2321, 22anbi12i 635 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ↔ (𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)))
2423anbi1i 631 . . . 4 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)) ↔ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)))
2524oprabbii 7427 . . 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 7523 1 (((𝐴R𝐵R) ∧ (𝐶R𝐷R)) → (⟨𝐴, 𝐵⟩ · ⟨𝐶, 𝐷⟩) = ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1548  wex 1787  wcel 2121  cop 4564   × cxp 5619  (class class class)co 7360  {coprab 7361  Rcnr 10783  -1Rcm1r 10786   +R cplr 10787   ·R cmr 10788  cc 11031   · cmul 11038
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-iota 6445  df-fun 6491  df-fv 6497  df-ov 7363  df-oprab 7364  df-c 11039  df-mul 11045
This theorem is referenced by:  mulresr  11057  mulcnsrec  11062  axmulf  11064  axi2m1  11077  axcnre  11082
  Copyright terms: Public domain W3C validator