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

Theorem elreal2 8147
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 8139 . . 3  |-  RR  =  ( R.  X.  { 0R } )
21eleq2i 2301 . 2  |-  ( A  e.  RR  <->  A  e.  ( R.  X.  { 0R } ) )
3 xp1st 6361 . . . 4  |-  ( A  e.  ( R.  X.  { 0R } )  -> 
( 1st `  A
)  e.  R. )
4 1st2nd2 6371 . . . . 5  |-  ( A  e.  ( R.  X.  { 0R } )  ->  A  =  <. ( 1st `  A ) ,  ( 2nd `  A )
>. )
5 xp2nd 6362 . . . . . . 7  |-  ( A  e.  ( R.  X.  { 0R } )  -> 
( 2nd `  A
)  e.  { 0R } )
6 elsni 3709 . . . . . . 7  |-  ( ( 2nd `  A )  e.  { 0R }  ->  ( 2nd `  A
)  =  0R )
75, 6syl 14 . . . . . 6  |-  ( A  e.  ( R.  X.  { 0R } )  -> 
( 2nd `  A
)  =  0R )
87opeq2d 3892 . . . . 5  |-  ( A  e.  ( R.  X.  { 0R } )  ->  <. ( 1st `  A
) ,  ( 2nd `  A ) >.  =  <. ( 1st `  A ) ,  0R >. )
94, 8eqtrd 2267 . . . 4  |-  ( A  e.  ( R.  X.  { 0R } )  ->  A  =  <. ( 1st `  A ) ,  0R >. )
103, 9jca 306 . . 3  |-  ( A  e.  ( R.  X.  { 0R } )  -> 
( ( 1st `  A
)  e.  R.  /\  A  =  <. ( 1st `  A ) ,  0R >. ) )
11 eleq1 2297 . . . . 5  |-  ( A  =  <. ( 1st `  A
) ,  0R >.  -> 
( A  e.  ( R.  X.  { 0R } )  <->  <. ( 1st `  A ) ,  0R >.  e.  ( R.  X.  { 0R } ) ) )
12 0r 8067 . . . . . . . 8  |-  0R  e.  R.
1312elexi 2828 . . . . . . 7  |-  0R  e.  _V
1413snid 3722 . . . . . 6  |-  0R  e.  { 0R }
15 opelxp 4781 . . . . . 6  |-  ( <.
( 1st `  A
) ,  0R >.  e.  ( R.  X.  { 0R } )  <->  ( ( 1st `  A )  e. 
R.  /\  0R  e.  { 0R } ) )
1614, 15mpbiran2 950 . . . . 5  |-  ( <.
( 1st `  A
) ,  0R >.  e.  ( R.  X.  { 0R } )  <->  ( 1st `  A )  e.  R. )
1711, 16bitrdi 196 . . . 4  |-  ( A  =  <. ( 1st `  A
) ,  0R >.  -> 
( A  e.  ( R.  X.  { 0R } )  <->  ( 1st `  A )  e.  R. ) )
1817biimparc 299 . . 3  |-  ( ( ( 1st `  A
)  e.  R.  /\  A  =  <. ( 1st `  A ) ,  0R >. )  ->  A  e.  ( R.  X.  { 0R } ) )
1910, 18impbii 126 . 2  |-  ( A  e.  ( R.  X.  { 0R } )  <->  ( ( 1st `  A )  e. 
R.  /\  A  =  <. ( 1st `  A
) ,  0R >. ) )
202, 19bitri 184 1  |-  ( A  e.  RR  <->  ( ( 1st `  A )  e. 
R.  /\  A  =  <. ( 1st `  A
) ,  0R >. ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   {csn 3691   <.cop 3694    X. cxp 4749   ` cfv 5354   1stc1st 6334   2ndc2nd 6335   R.cnr 7614   0Rc0r 7615   RRcr 8128
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-eprel 4412  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-1o 6649  df-oadd 6653  df-omul 6654  df-er 6769  df-ec 6771  df-qs 6775  df-ni 7621  df-pli 7622  df-mi 7623  df-lti 7624  df-plpq 7661  df-mpq 7662  df-enq 7664  df-nqqs 7665  df-plqqs 7666  df-mqqs 7667  df-1nqqs 7668  df-rq 7669  df-ltnqqs 7670  df-inp 7783  df-i1p 7784  df-enr 8043  df-nr 8044  df-0r 8048  df-r 8139
This theorem is referenced by:  ltresr2  8157  axrnegex  8196  axpre-suploclemres  8218
  Copyright terms: Public domain W3C validator