MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opelcn Structured version   Unicode version

Theorem opelcn 9502
Description: Ordered pair membership in the class of complex numbers. (Contributed by NM, 14-May-1996.) (New usage is discouraged.)
Assertion
Ref Expression
opelcn  |-  ( <. A ,  B >.  e.  CC  <->  ( A  e. 
R.  /\  B  e.  R. ) )

Proof of Theorem opelcn
StepHypRef Expression
1 df-c 9494 . . 3  |-  CC  =  ( R.  X.  R. )
21eleq2i 2545 . 2  |-  ( <. A ,  B >.  e.  CC  <->  <. A ,  B >.  e.  ( R.  X.  R. ) )
3 opelxp 5028 . 2  |-  ( <. A ,  B >.  e.  ( R.  X.  R. ) 
<->  ( A  e.  R.  /\  B  e.  R. )
)
42, 3bitri 249 1  |-  ( <. A ,  B >.  e.  CC  <->  ( A  e. 
R.  /\  B  e.  R. ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 369    e. wcel 1767   <.cop 4033    X. cxp 4997   R.cnr 9239   CCcc 9486
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pr 4686
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-opab 4506  df-xp 5005  df-c 9494
This theorem is referenced by:  axicn  9523
  Copyright terms: Public domain W3C validator