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

Theorem elreal2 7638
Description: Ordered pair membership in the class of complex numbers. (Contributed by Mario Carneiro, 15-Jun-2013.)
Assertion
Ref Expression
elreal2  |-  ( A  e.  RR  <->  ( ( 1st `  A )  e. 
R.  /\  A  =  <. ( 1st `  A
) ,  0R >. ) )

Proof of Theorem elreal2
StepHypRef Expression
1 df-r 7630 . . 3  |-  RR  =  ( R.  X.  { 0R } )
21eleq2i 2206 . 2  |-  ( A  e.  RR  <->  A  e.  ( R.  X.  { 0R } ) )
3 xp1st 6063 . . . 4  |-  ( A  e.  ( R.  X.  { 0R } )  -> 
( 1st `  A
)  e.  R. )
4 1st2nd2 6073 . . . . 5  |-  ( A  e.  ( R.  X.  { 0R } )  ->  A  =  <. ( 1st `  A ) ,  ( 2nd `  A )
>. )
5 xp2nd 6064 . . . . . . 7  |-  ( A  e.  ( R.  X.  { 0R } )  -> 
( 2nd `  A
)  e.  { 0R } )
6 elsni 3545 . . . . . . 7  |-  ( ( 2nd `  A )  e.  { 0R }  ->  ( 2nd `  A
)  =  0R )
75, 6syl 14 . . . . . 6  |-  ( A  e.  ( R.  X.  { 0R } )  -> 
( 2nd `  A
)  =  0R )
87opeq2d 3712 . . . . 5  |-  ( A  e.  ( R.  X.  { 0R } )  ->  <. ( 1st `  A
) ,  ( 2nd `  A ) >.  =  <. ( 1st `  A ) ,  0R >. )
94, 8eqtrd 2172 . . . 4  |-  ( A  e.  ( R.  X.  { 0R } )  ->  A  =  <. ( 1st `  A ) ,  0R >. )
103, 9jca 304 . . 3  |-  ( A  e.  ( R.  X.  { 0R } )  -> 
( ( 1st `  A
)  e.  R.  /\  A  =  <. ( 1st `  A ) ,  0R >. ) )
11 eleq1 2202 . . . . 5  |-  ( A  =  <. ( 1st `  A
) ,  0R >.  -> 
( A  e.  ( R.  X.  { 0R } )  <->  <. ( 1st `  A ) ,  0R >.  e.  ( R.  X.  { 0R } ) ) )
12 0r 7558 . . . . . . . 8  |-  0R  e.  R.
1312elexi 2698 . . . . . . 7  |-  0R  e.  _V
1413snid 3556 . . . . . 6  |-  0R  e.  { 0R }
15 opelxp 4569 . . . . . 6  |-  ( <.
( 1st `  A
) ,  0R >.  e.  ( R.  X.  { 0R } )  <->  ( ( 1st `  A )  e. 
R.  /\  0R  e.  { 0R } ) )
1614, 15mpbiran2 925 . . . . 5  |-  ( <.
( 1st `  A
) ,  0R >.  e.  ( R.  X.  { 0R } )  <->  ( 1st `  A )  e.  R. )
1711, 16syl6bb 195 . . . 4  |-  ( A  =  <. ( 1st `  A
) ,  0R >.  -> 
( A  e.  ( R.  X.  { 0R } )  <->  ( 1st `  A )  e.  R. ) )
1817biimparc 297 . . 3  |-  ( ( ( 1st `  A
)  e.  R.  /\  A  =  <. ( 1st `  A ) ,  0R >. )  ->  A  e.  ( R.  X.  { 0R } ) )
1910, 18impbii 125 . 2  |-  ( A  e.  ( R.  X.  { 0R } )  <->  ( ( 1st `  A )  e. 
R.  /\  A  =  <. ( 1st `  A
) ,  0R >. ) )
202, 19bitri 183 1  |-  ( A  e.  RR  <->  ( ( 1st `  A )  e. 
R.  /\  A  =  <. ( 1st `  A
) ,  0R >. ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1331    e. wcel 1480   {csn 3527   <.cop 3530    X. cxp 4537   ` cfv 5123   1stc1st 6036   2ndc2nd 6037   R.cnr 7105   0Rc0r 7106   RRcr 7619
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 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502
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 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-eprel 4211  df-id 4215  df-po 4218  df-iso 4219  df-iord 4288  df-on 4290  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-irdg 6267  df-1o 6313  df-oadd 6317  df-omul 6318  df-er 6429  df-ec 6431  df-qs 6435  df-ni 7112  df-pli 7113  df-mi 7114  df-lti 7115  df-plpq 7152  df-mpq 7153  df-enq 7155  df-nqqs 7156  df-plqqs 7157  df-mqqs 7158  df-1nqqs 7159  df-rq 7160  df-ltnqqs 7161  df-inp 7274  df-i1p 7275  df-enr 7534  df-nr 7535  df-0r 7539  df-r 7630
This theorem is referenced by:  ltresr2  7648  axrnegex  7687  axpre-suploclemres  7709
  Copyright terms: Public domain W3C validator