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

Theorem opelcn 7427
Description: Ordered pair membership in the class of complex numbers. (Contributed by NM, 14-May-1996.)
Assertion
Ref Expression
opelcn (⟨𝐴, 𝐵⟩ ∈ ℂ ↔ (𝐴R𝐵R))

Proof of Theorem opelcn
StepHypRef Expression
1 df-c 7419 . . 3 ℂ = (R × R)
21eleq2i 2155 . 2 (⟨𝐴, 𝐵⟩ ∈ ℂ ↔ ⟨𝐴, 𝐵⟩ ∈ (R × R))
3 opelxp 4483 . 2 (⟨𝐴, 𝐵⟩ ∈ (R × R) ↔ (𝐴R𝐵R))
42, 3bitri 183 1 (⟨𝐴, 𝐵⟩ ∈ ℂ ↔ (𝐴R𝐵R))
Colors of variables: wff set class
Syntax hints:  wa 103  wb 104  wcel 1439  cop 3455   × cxp 4452  Rcnr 6919  cc 7411
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-sep 3965  ax-pow 4017  ax-pr 4047
This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-nf 1396  df-sb 1694  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ral 2365  df-rex 2366  df-v 2624  df-un 3006  df-in 3008  df-ss 3015  df-pw 3437  df-sn 3458  df-pr 3459  df-op 3461  df-opab 3908  df-xp 4460  df-c 7419
This theorem is referenced by:  axicn  7463
  Copyright terms: Public domain W3C validator