Theorem elreal2 9953

Description: Ordered pair membership in the class of complex numbers. (Contributed by Mario Carneiro, 15-Jun-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
elreal2	|- ( A e. RR <-> ( ( 1st ` A ) e. R. /\ A = <. ( 1st ` A ) , 0R >. ) )

Proof of Theorem elreal2

Step	Hyp	Ref	Expression
1		df-r 9946	. . 3 |- RR = ( R. X. { 0R } )
2	1	eleq2i 2693	. 2 |- ( A e. RR <-> A e. ( R. X. { 0R } ) )
3		xp1st 7198	. . . 4 |- ( A e. ( R. X. { 0R } ) -> ( 1st ` A ) e. R. )
4		1st2nd2 7205	. . . . 5 |- ( A e. ( R. X. { 0R } ) -> A = <. ( 1st ` A ) , ( 2nd ` A ) >. )
5		xp2nd 7199	. . . . . . 7 |- ( A e. ( R. X. { 0R } ) -> ( 2nd ` A ) e. { 0R } )
6		elsni 4194	. . . . . . 7 |- ( ( 2nd ` A ) e. { 0R } -> ( 2nd ` A ) = 0R )
7	5, 6	syl 17	. . . . . 6 |- ( A e. ( R. X. { 0R } ) -> ( 2nd ` A ) = 0R )
8	7	opeq2d 4409	. . . . 5 |- ( A e. ( R. X. { 0R } ) -> <. ( 1st ` A ) , ( 2nd ` A ) >. = <. ( 1st ` A ) , 0R >. )
9	4, 8	eqtrd 2656	. . . 4 |- ( A e. ( R. X. { 0R } ) -> A = <. ( 1st ` A ) , 0R >. )
10	3, 9	jca 554	. . 3 |- ( A e. ( R. X. { 0R } ) -> ( ( 1st ` A ) e. R. /\ A = <. ( 1st ` A ) , 0R >. ) )
11		eleq1 2689	. . . . 5 |- ( A = <. ( 1st ` A ) , 0R >. -> ( A e. ( R. X. { 0R } ) <-> <. ( 1st ` A ) , 0R >. e. ( R. X. { 0R } ) ) )
12		0r 9901	. . . . . . . 8 |- 0R e. R.
13	12	elexi 3213	. . . . . . 7 |- 0R e. _V
14	13	snid 4208	. . . . . 6 |- 0R e. { 0R }
15		opelxp 5146	. . . . . 6 |- ( <. ( 1st ` A ) , 0R >. e. ( R. X. { 0R } ) <-> ( ( 1st ` A ) e. R. /\ 0R e. { 0R } ) )
16	14, 15	mpbiran2 954	. . . . 5 |- ( <. ( 1st ` A ) , 0R >. e. ( R. X. { 0R } ) <-> ( 1st ` A ) e. R. )
17	11, 16	syl6bb 276	. . . 4 |- ( A = <. ( 1st ` A ) , 0R >. -> ( A e. ( R. X. { 0R } ) <-> ( 1st ` A ) e. R. ) )
18	17	biimparc 504	. . 3 |- ( ( ( 1st ` A ) e. R. /\ A = <. ( 1st ` A ) , 0R >. ) -> A e. ( R. X. { 0R } ) )
19	10, 18	impbii 199	. 2 |- ( A e. ( R. X. { 0R } ) <-> ( ( 1st ` A ) e. R. /\ A = <. ( 1st ` A ) , 0R >. ) )
20	2, 19	bitri 264	1 |- ( A e. RR <-> ( ( 1st ` A ) e. R. /\ A = <. ( 1st ` A ) , 0R >. ) )

Syntax hints:   <-> wb 196   /\ wa 384   = wceq 1483   e. wcel 1990   {csn 4177   <.cop 4183   X. cxp 5112   ` cfv 5888   1stc1st 7166   2ndc2nd 7167   R.cnr 9687   0Rc0r 9688   RRcr 9935

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-inf2 8538

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-omul 7565  df-er 7742  df-ec 7744  df-qs 7748  df-ni 9694  df-pli 9695  df-mi 9696  df-lti 9697  df-plpq 9730  df-mpq 9731  df-ltpq 9732  df-enq 9733  df-nq 9734  df-erq 9735  df-plq 9736  df-mq 9737  df-1nq 9738  df-rq 9739  df-ltnq 9740  df-np 9803  df-1p 9804  df-enr 9877  df-nr 9878  df-0r 9882  df-r 9946

This theorem is referenced by:  ltresr2  9962  axrnegex  9983  axpre-sup  9990