Theorem axrnegex 8247

Description: Existence of negative of real number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-rnegex 8289. (Contributed by NM, 15-May-1996.) (New usage is discouraged.)

Assertion

Ref	Expression
axrnegex	|- ( A e. RR -> E. x e. RR ( A + x ) = 0 )

Distinct variable group:   x, A

Proof of Theorem axrnegex

Step	Hyp	Ref	Expression
1		elreal2 8198	. . . . 5 |- ( A e. RR <-> ( ( 1st ` A ) e. R. /\ A = <. ( 1st ` A ) , 0R >. ) )
2	1	simplbi 274	. . . 4 |- ( A e. RR -> ( 1st ` A ) e. R. )
3		m1r 8120	. . . 4 |- -1R e. R.
4		mulclsr 8122	. . . 4 |- ( ( ( 1st ` A ) e. R. /\ -1R e. R. ) -> ( ( 1st ` A ) .R -1R ) e. R. )
5	2, 3, 4	sylancl 417	. . 3 |- ( A e. RR -> ( ( 1st ` A ) .R -1R ) e. R. )
6		opelreal 8195	. . 3 |- ( <. ( ( 1st ` A ) .R -1R ) , 0R >. e. RR <-> ( ( 1st ` A ) .R -1R ) e. R. )
7	5, 6	sylibr 134	. 2 |- ( A e. RR -> <. ( ( 1st ` A ) .R -1R ) , 0R >. e. RR )
8	1	simprbi 275	. . . 4 |- ( A e. RR -> A = <. ( 1st ` A ) , 0R >. )
9	8	oveq1d 6100	. . 3 |- ( A e. RR -> ( A + <. ( ( 1st ` A ) .R -1R ) , 0R >. ) = ( <. ( 1st ` A ) , 0R >. + <. ( ( 1st ` A ) .R -1R ) , 0R >. ) )
10		addresr 8205	. . . 4 |- ( ( ( 1st ` A ) e. R. /\ ( ( 1st ` A ) .R -1R ) e. R. ) -> ( <. ( 1st ` A ) , 0R >. + <. ( ( 1st ` A ) .R -1R ) , 0R >. ) = <. ( ( 1st ` A ) +R ( ( 1st ` A ) .R -1R ) ) , 0R >. )
11	2, 5, 10	syl2anc 415	. . 3 |- ( A e. RR -> ( <. ( 1st ` A ) , 0R >. + <. ( ( 1st ` A ) .R -1R ) , 0R >. ) = <. ( ( 1st ` A ) +R ( ( 1st ` A ) .R -1R ) ) , 0R >. )
12		pn0sr 8139	. . . . . 6 |- ( ( 1st ` A ) e. R. -> ( ( 1st ` A ) +R ( ( 1st ` A ) .R -1R ) ) = 0R )
13	12	opeq1d 3910	. . . . 5 |- ( ( 1st ` A ) e. R. -> <. ( ( 1st ` A ) +R ( ( 1st ` A ) .R -1R ) ) , 0R >. = <. 0R , 0R >. )
14		df-0 8187	. . . . 5 |- 0 = <. 0R , 0R >.
15	13, 14	eqtr4di 2289	. . . 4 |- ( ( 1st ` A ) e. R. -> <. ( ( 1st ` A ) +R ( ( 1st ` A ) .R -1R ) ) , 0R >. = 0 )
16	2, 15	syl 14	. . 3 |- ( A e. RR -> <. ( ( 1st ` A ) +R ( ( 1st ` A ) .R -1R ) ) , 0R >. = 0 )
17	9, 11, 16	3eqtrd 2275	. 2 |- ( A e. RR -> ( A + <. ( ( 1st ` A ) .R -1R ) , 0R >. ) = 0 )
18		oveq2 6093	. . . 4 |- ( x = <. ( ( 1st ` A ) .R -1R ) , 0R >. -> ( A + x ) = ( A + <. ( ( 1st ` A ) .R -1R ) , 0R >. ) )
19	18	eqeq1d 2247	. . 3 |- ( x = <. ( ( 1st ` A ) .R -1R ) , 0R >. -> ( ( A + x ) = 0 <-> ( A + <. ( ( 1st ` A ) .R -1R ) , 0R >. ) = 0 ) )
20	19	rspcev 2929	. 2 |- ( ( <. ( ( 1st ` A ) .R -1R ) , 0R >. e. RR /\ ( A + <. ( ( 1st ` A ) .R -1R ) , 0R >. ) = 0 ) -> E. x e. RR ( A + x ) = 0 )
21	7, 17, 20	syl2anc 415	1 |- ( A e. RR -> E. x e. RR ( A + x ) = 0 )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   e. wcel 2209   E.wrex 2529   <.cop 3712   ` cfv 5377  (class class class)co 6085   1stc1st 6372   R.cnr 7665   0Rc0r 7666   -1Rcm1r 7668   +R cplr 7669   .R cmr 7670   RRcr 8179   0cc0 8180   + caddc 8183

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7672  df-pli 7673  df-mi 7674  df-lti 7675  df-plpq 7712  df-mpq 7713  df-enq 7715  df-nqqs 7716  df-plqqs 7717  df-mqqs 7718  df-1nqqs 7719  df-rq 7720  df-ltnqqs 7721  df-enq0 7792  df-nq0 7793  df-0nq0 7794  df-plq0 7795  df-mq0 7796  df-inp 7834  df-i1p 7835  df-iplp 7836  df-imp 7837  df-enr 8094  df-nr 8095  df-plr 8096  df-mr 8097  df-0r 8099  df-1r 8100  df-m1r 8101  df-c 8186  df-0 8187  df-r 8190  df-add 8191

This theorem is used by: (None)