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

Theorem mulcnsr 11146
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 5443 . 2 ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩ ∈ V
2 oveq1 7423 . . . . 5 (𝑤 = 𝐴 → (𝑤 ·R 𝑢) = (𝐴 ·R 𝑢))
3 oveq1 7423 . . . . . 6 (𝑣 = 𝐵 → (𝑣 ·R 𝑓) = (𝐵 ·R 𝑓))
43oveq2d 7432 . . . . 5 (𝑣 = 𝐵 → (-1R ·R (𝑣 ·R 𝑓)) = (-1R ·R (𝐵 ·R 𝑓)))
52, 4oveqan12d 7435 . . . 4 ((𝑤 = 𝐴𝑣 = 𝐵) → ((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))) = ((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))))
6 oveq1 7423 . . . . 5 (𝑣 = 𝐵 → (𝑣 ·R 𝑢) = (𝐵 ·R 𝑢))
7 oveq1 7423 . . . . 5 (𝑤 = 𝐴 → (𝑤 ·R 𝑓) = (𝐴 ·R 𝑓))
86, 7oveqan12rd 7436 . . . 4 ((𝑤 = 𝐴𝑣 = 𝐵) → ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓)) = ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓)))
95, 8opeq12d 4844 . . 3 ((𝑤 = 𝐴𝑣 = 𝐵) → ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩ = ⟨((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))), ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓))⟩)
10 oveq2 7424 . . . . 5 (𝑢 = 𝐶 → (𝐴 ·R 𝑢) = (𝐴 ·R 𝐶))
11 oveq2 7424 . . . . . 6 (𝑓 = 𝐷 → (𝐵 ·R 𝑓) = (𝐵 ·R 𝐷))
1211oveq2d 7432 . . . . 5 (𝑓 = 𝐷 → (-1R ·R (𝐵 ·R 𝑓)) = (-1R ·R (𝐵 ·R 𝐷)))
1310, 12oveqan12d 7435 . . . 4 ((𝑢 = 𝐶𝑓 = 𝐷) → ((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))) = ((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))))
14 oveq2 7424 . . . . 5 (𝑢 = 𝐶 → (𝐵 ·R 𝑢) = (𝐵 ·R 𝐶))
15 oveq2 7424 . . . . 5 (𝑓 = 𝐷 → (𝐴 ·R 𝑓) = (𝐴 ·R 𝐷))
1614, 15oveqan12d 7435 . . . 4 ((𝑢 = 𝐶𝑓 = 𝐷) → ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓)) = ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷)))
1713, 16opeq12d 4844 . . 3 ((𝑢 = 𝐶𝑓 = 𝐷) → ⟨((𝐴 ·R 𝑢) +R (-1R ·R (𝐵 ·R 𝑓))), ((𝐵 ·R 𝑢) +R (𝐴 ·R 𝑓))⟩ = ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩)
189, 17sylan9eq 2817 . 2 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩ = ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩)
19 df-mul 11137 . . 3 · = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
20 df-c 11131 . . . . . . 7 ℂ = (R × R)
2120eleq2i 2854 . . . . . 6 (𝑥 ∈ ℂ ↔ 𝑥 ∈ (R × R))
2220eleq2i 2854 . . . . . 6 (𝑦 ∈ ℂ ↔ 𝑦 ∈ (R × R))
2321, 22anbi12i 640 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ↔ (𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)))
2423anbi1i 636 . . . 4 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)) ↔ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)))
2524oprabbii 7483 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
2619, 25eqtri 2785 . 2 · = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
271, 18, 26ov3 7579 1 (((𝐴R𝐵R) ∧ (𝐶R𝐷R)) → (⟨𝐴, 𝐵⟩ · ⟨𝐶, 𝐷⟩) = ⟨((𝐴 ·R 𝐶) +R (-1R ·R (𝐵 ·R 𝐷))), ((𝐵 ·R 𝐶) +R (𝐴 ·R 𝐷))⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wex 1812  wcel 2145  cop 4593   × cxp 5657  (class class class)co 7416  {coprab 7417  Rcnr 10875  -1Rcm1r 10878   +R cplr 10879   ·R cmr 10880  cc 11123   · cmul 11130
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-sep 5255  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7419  df-oprab 7420  df-c 11131  df-mul 11137
This theorem is used by:  mulresr  11149  mulcnsrec  11154  axmulf  11156  axi2m1  11169  axcnre  11174
  Copyright terms: Public domain W3C validator