ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  addcnsr GIF version

Theorem addcnsr 7635
Description: Addition of complex numbers in terms of signed reals. (Contributed by NM, 28-May-1995.)
Assertion
Ref Expression
addcnsr (((𝐴R𝐵R) ∧ (𝐶R𝐷R)) → (⟨𝐴, 𝐵⟩ + ⟨𝐶, 𝐷⟩) = ⟨(𝐴 +R 𝐶), (𝐵 +R 𝐷)⟩)

Proof of Theorem addcnsr
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 addclsr 7554 . . . 4 ((𝐴R𝐶R) → (𝐴 +R 𝐶) ∈ R)
21ad2ant2r 500 . . 3 (((𝐴R𝐵R) ∧ (𝐶R𝐷R)) → (𝐴 +R 𝐶) ∈ R)
3 addclsr 7554 . . . 4 ((𝐵R𝐷R) → (𝐵 +R 𝐷) ∈ R)
43ad2ant2l 499 . . 3 (((𝐴R𝐵R) ∧ (𝐶R𝐷R)) → (𝐵 +R 𝐷) ∈ R)
5 opelxpi 4566 . . 3 (((𝐴 +R 𝐶) ∈ R ∧ (𝐵 +R 𝐷) ∈ R) → ⟨(𝐴 +R 𝐶), (𝐵 +R 𝐷)⟩ ∈ (R × R))
62, 4, 5syl2anc 408 . 2 (((𝐴R𝐵R) ∧ (𝐶R𝐷R)) → ⟨(𝐴 +R 𝐶), (𝐵 +R 𝐷)⟩ ∈ (R × R))
7 simpll 518 . . . 4 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → 𝑤 = 𝐴)
8 simprl 520 . . . 4 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → 𝑢 = 𝐶)
97, 8oveq12d 5785 . . 3 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → (𝑤 +R 𝑢) = (𝐴 +R 𝐶))
10 simplr 519 . . . 4 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → 𝑣 = 𝐵)
11 simprr 521 . . . 4 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → 𝑓 = 𝐷)
1210, 11oveq12d 5785 . . 3 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → (𝑣 +R 𝑓) = (𝐵 +R 𝐷))
139, 12opeq12d 3708 . 2 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → ⟨(𝑤 +R 𝑢), (𝑣 +R 𝑓)⟩ = ⟨(𝐴 +R 𝐶), (𝐵 +R 𝐷)⟩)
14 df-add 7624 . . 3 + = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 +R 𝑢), (𝑣 +R 𝑓)⟩))}
15 df-c 7619 . . . . . . 7 ℂ = (R × R)
1615eleq2i 2204 . . . . . 6 (𝑥 ∈ ℂ ↔ 𝑥 ∈ (R × R))
1715eleq2i 2204 . . . . . 6 (𝑦 ∈ ℂ ↔ 𝑦 ∈ (R × R))
1816, 17anbi12i 455 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ↔ (𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)))
1918anbi1i 453 . . . 4 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 +R 𝑢), (𝑣 +R 𝑓)⟩)) ↔ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 +R 𝑢), (𝑣 +R 𝑓)⟩)))
2019oprabbii 5819 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 +R 𝑢), (𝑣 +R 𝑓)⟩))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 +R 𝑢), (𝑣 +R 𝑓)⟩))}
2114, 20eqtri 2158 . 2 + = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 +R 𝑢), (𝑣 +R 𝑓)⟩))}
226, 13, 21ovi3 5900 1 (((𝐴R𝐵R) ∧ (𝐶R𝐷R)) → (⟨𝐴, 𝐵⟩ + ⟨𝐶, 𝐷⟩) = ⟨(𝐴 +R 𝐶), (𝐵 +R 𝐷)⟩)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1331  wex 1468  wcel 1480  cop 3525   × cxp 4532  (class class class)co 5767  {coprab 5768  Rcnr 7098   +R cplr 7102  cc 7611   + caddc 7616
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-eprel 4206  df-id 4210  df-po 4213  df-iso 4214  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-1o 6306  df-2o 6307  df-oadd 6310  df-omul 6311  df-er 6422  df-ec 6424  df-qs 6428  df-ni 7105  df-pli 7106  df-mi 7107  df-lti 7108  df-plpq 7145  df-mpq 7146  df-enq 7148  df-nqqs 7149  df-plqqs 7150  df-mqqs 7151  df-1nqqs 7152  df-rq 7153  df-ltnqqs 7154  df-enq0 7225  df-nq0 7226  df-0nq0 7227  df-plq0 7228  df-mq0 7229  df-inp 7267  df-iplp 7269  df-enr 7527  df-nr 7528  df-plr 7529  df-c 7619  df-add 7624
This theorem is referenced by:  addresr  7638  addcnsrec  7643  axaddcl  7665  axaddcom  7671  ax0id  7679  axcnre  7682
  Copyright terms: Public domain W3C validator