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

Theorem axrnegex 7991
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 8033. (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
StepHypRef Expression
1 elreal2 7942 . . . . 5  |-  ( A  e.  RR  <->  ( ( 1st `  A )  e. 
R.  /\  A  =  <. ( 1st `  A
) ,  0R >. ) )
21simplbi 274 . . . 4  |-  ( A  e.  RR  ->  ( 1st `  A )  e. 
R. )
3 m1r 7864 . . . 4  |-  -1R  e.  R.
4 mulclsr 7866 . . . 4  |-  ( ( ( 1st `  A
)  e.  R.  /\  -1R  e.  R. )  -> 
( ( 1st `  A
)  .R  -1R )  e.  R. )
52, 3, 4sylancl 413 . . 3  |-  ( A  e.  RR  ->  (
( 1st `  A
)  .R  -1R )  e.  R. )
6 opelreal 7939 . . 3  |-  ( <.
( ( 1st `  A
)  .R  -1R ) ,  0R >.  e.  RR  <->  ( ( 1st `  A
)  .R  -1R )  e.  R. )
75, 6sylibr 134 . 2  |-  ( A  e.  RR  ->  <. (
( 1st `  A
)  .R  -1R ) ,  0R >.  e.  RR )
81simprbi 275 . . . 4  |-  ( A  e.  RR  ->  A  =  <. ( 1st `  A
) ,  0R >. )
98oveq1d 5958 . . 3  |-  ( A  e.  RR  ->  ( A  +  <. ( ( 1st `  A )  .R  -1R ) ,  0R >. )  =  (
<. ( 1st `  A
) ,  0R >.  + 
<. ( ( 1st `  A
)  .R  -1R ) ,  0R >. ) )
10 addresr 7949 . . . 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 >. )
112, 5, 10syl2anc 411 . . 3  |-  ( A  e.  RR  ->  ( <. ( 1st `  A
) ,  0R >.  + 
<. ( ( 1st `  A
)  .R  -1R ) ,  0R >. )  =  <. ( ( 1st `  A
)  +R  ( ( 1st `  A )  .R  -1R ) ) ,  0R >. )
12 pn0sr 7883 . . . . . 6  |-  ( ( 1st `  A )  e.  R.  ->  (
( 1st `  A
)  +R  ( ( 1st `  A )  .R  -1R ) )  =  0R )
1312opeq1d 3824 . . . . 5  |-  ( ( 1st `  A )  e.  R.  ->  <. (
( 1st `  A
)  +R  ( ( 1st `  A )  .R  -1R ) ) ,  0R >.  =  <. 0R ,  0R >. )
14 df-0 7931 . . . . 5  |-  0  =  <. 0R ,  0R >.
1513, 14eqtr4di 2255 . . . 4  |-  ( ( 1st `  A )  e.  R.  ->  <. (
( 1st `  A
)  +R  ( ( 1st `  A )  .R  -1R ) ) ,  0R >.  =  0 )
162, 15syl 14 . . 3  |-  ( A  e.  RR  ->  <. (
( 1st `  A
)  +R  ( ( 1st `  A )  .R  -1R ) ) ,  0R >.  =  0 )
179, 11, 163eqtrd 2241 . 2  |-  ( A  e.  RR  ->  ( A  +  <. ( ( 1st `  A )  .R  -1R ) ,  0R >. )  =  0 )
18 oveq2 5951 . . . 4  |-  ( x  =  <. ( ( 1st `  A )  .R  -1R ) ,  0R >.  ->  ( A  +  x )  =  ( A  +  <. ( ( 1st `  A
)  .R  -1R ) ,  0R >. ) )
1918eqeq1d 2213 . . 3  |-  ( x  =  <. ( ( 1st `  A )  .R  -1R ) ,  0R >.  ->  (
( A  +  x
)  =  0  <->  ( A  +  <. ( ( 1st `  A )  .R  -1R ) ,  0R >. )  =  0 ) )
2019rspcev 2876 . 2  |-  ( (
<. ( ( 1st `  A
)  .R  -1R ) ,  0R >.  e.  RR  /\  ( A  +  <. ( ( 1st `  A
)  .R  -1R ) ,  0R >. )  =  0 )  ->  E. x  e.  RR  ( A  +  x )  =  0 )
217, 17, 20syl2anc 411 1  |-  ( A  e.  RR  ->  E. x  e.  RR  ( A  +  x )  =  0 )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1372    e. wcel 2175   E.wrex 2484   <.cop 3635   ` cfv 5270  (class class class)co 5943   1stc1st 6223   R.cnr 7409   0Rc0r 7410   -1Rcm1r 7412    +R cplr 7413    .R cmr 7414   RRcr 7923   0cc0 7924    + caddc 7927
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 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-nul 4169  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-iinf 4635
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-reu 2490  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-tr 4142  df-eprel 4335  df-id 4339  df-po 4342  df-iso 4343  df-iord 4412  df-on 4414  df-suc 4417  df-iom 4638  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-ov 5946  df-oprab 5947  df-mpo 5948  df-1st 6225  df-2nd 6226  df-recs 6390  df-irdg 6455  df-1o 6501  df-2o 6502  df-oadd 6505  df-omul 6506  df-er 6619  df-ec 6621  df-qs 6625  df-ni 7416  df-pli 7417  df-mi 7418  df-lti 7419  df-plpq 7456  df-mpq 7457  df-enq 7459  df-nqqs 7460  df-plqqs 7461  df-mqqs 7462  df-1nqqs 7463  df-rq 7464  df-ltnqqs 7465  df-enq0 7536  df-nq0 7537  df-0nq0 7538  df-plq0 7539  df-mq0 7540  df-inp 7578  df-i1p 7579  df-iplp 7580  df-imp 7581  df-enr 7838  df-nr 7839  df-plr 7840  df-mr 7841  df-0r 7843  df-1r 7844  df-m1r 7845  df-c 7930  df-0 7931  df-r 7934  df-add 7935
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator