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

Theorem rpnegap 9763
Description: Either a real apart from zero or its negation is a positive real, but not both. (Contributed by Jim Kingdon, 23-Mar-2020.)
Assertion
Ref Expression
rpnegap  |-  ( ( A  e.  RR  /\  A #  0 )  ->  ( A  e.  RR+  \/_  -u A  e.  RR+ ) )

Proof of Theorem rpnegap
StepHypRef Expression
1 0re 8028 . . . . . . 7  |-  0  e.  RR
2 reapltxor 8618 . . . . . . 7  |-  ( ( A  e.  RR  /\  0  e.  RR )  ->  ( A #  0  <->  ( A  <  0  \/_  0  <  A ) ) )
31, 2mpan2 425 . . . . . 6  |-  ( A  e.  RR  ->  ( A #  0  <->  ( A  <  0  \/_  0  < 
A ) ) )
4 xorcom 1399 . . . . . 6  |-  ( ( A  <  0  \/_  0  <  A )  <-> 
( 0  <  A  \/_  A  <  0 ) )
53, 4bitrdi 196 . . . . 5  |-  ( A  e.  RR  ->  ( A #  0  <->  ( 0  < 
A  \/_  A  <  0 ) ) )
65pm5.32i 454 . . . 4  |-  ( ( A  e.  RR  /\  A #  0 )  <->  ( A  e.  RR  /\  ( 0  <  A  \/_  A  <  0 ) ) )
7 anxordi 1411 . . . 4  |-  ( ( A  e.  RR  /\  ( 0  <  A  \/_  A  <  0 ) )  <->  ( ( A  e.  RR  /\  0  <  A )  \/_  ( A  e.  RR  /\  A  <  0 ) ) )
86, 7bitri 184 . . 3  |-  ( ( A  e.  RR  /\  A #  0 )  <->  ( ( A  e.  RR  /\  0  <  A )  \/_  ( A  e.  RR  /\  A  <  0 ) ) )
98biimpi 120 . 2  |-  ( ( A  e.  RR  /\  A #  0 )  ->  (
( A  e.  RR  /\  0  <  A ) 
\/_  ( A  e.  RR  /\  A  <  0 ) ) )
10 elrp 9732 . . . 4  |-  ( A  e.  RR+  <->  ( A  e.  RR  /\  0  < 
A ) )
1110a1i 9 . . 3  |-  ( ( A  e.  RR  /\  A #  0 )  ->  ( A  e.  RR+  <->  ( A  e.  RR  /\  0  < 
A ) ) )
12 elrp 9732 . . . . . 6  |-  ( -u A  e.  RR+  <->  ( -u A  e.  RR  /\  0  <  -u A ) )
13 renegcl 8289 . . . . . . 7  |-  ( A  e.  RR  ->  -u A  e.  RR )
1413biantrurd 305 . . . . . 6  |-  ( A  e.  RR  ->  (
0  <  -u A  <->  ( -u A  e.  RR  /\  0  <  -u A ) ) )
1512, 14bitr4id 199 . . . . 5  |-  ( A  e.  RR  ->  ( -u A  e.  RR+  <->  0  <  -u A ) )
16 lt0neg1 8497 . . . . 5  |-  ( A  e.  RR  ->  ( A  <  0  <->  0  <  -u A ) )
17 ibar 301 . . . . 5  |-  ( A  e.  RR  ->  ( A  <  0  <->  ( A  e.  RR  /\  A  <  0 ) ) )
1815, 16, 173bitr2d 216 . . . 4  |-  ( A  e.  RR  ->  ( -u A  e.  RR+  <->  ( A  e.  RR  /\  A  <  0 ) ) )
1918adantr 276 . . 3  |-  ( ( A  e.  RR  /\  A #  0 )  ->  ( -u A  e.  RR+  <->  ( A  e.  RR  /\  A  <  0 ) ) )
2011, 19xorbi12d 1393 . 2  |-  ( ( A  e.  RR  /\  A #  0 )  ->  (
( A  e.  RR+  \/_  -u A  e.  RR+ )  <->  ( ( A  e.  RR  /\  0  <  A ) 
\/_  ( A  e.  RR  /\  A  <  0 ) ) ) )
219, 20mpbird 167 1  |-  ( ( A  e.  RR  /\  A #  0 )  ->  ( A  e.  RR+  \/_  -u A  e.  RR+ ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/_ wxo 1386    e. wcel 2167   class class class wbr 4034   RRcr 7880   0cc0 7881    < clt 8063   -ucneg 8200   # cap 8610   RR+crp 9730
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7972  ax-resscn 7973  ax-1cn 7974  ax-1re 7975  ax-icn 7976  ax-addcl 7977  ax-addrcl 7978  ax-mulcl 7979  ax-mulrcl 7980  ax-addcom 7981  ax-mulcom 7982  ax-addass 7983  ax-mulass 7984  ax-distr 7985  ax-i2m1 7986  ax-0lt1 7987  ax-1rid 7988  ax-0id 7989  ax-rnegex 7990  ax-precex 7991  ax-cnre 7992  ax-pre-ltirr 7993  ax-pre-ltwlin 7994  ax-pre-lttrn 7995  ax-pre-apti 7996  ax-pre-ltadd 7997  ax-pre-mulgt0 7998
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-xor 1387  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-id 4329  df-po 4332  df-iso 4333  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-iota 5220  df-fun 5261  df-fv 5267  df-riota 5878  df-ov 5926  df-oprab 5927  df-mpo 5928  df-pnf 8065  df-mnf 8066  df-ltxr 8068  df-sub 8201  df-neg 8202  df-reap 8604  df-ap 8611  df-rp 9731
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator