Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  reap0 Unicode version

Theorem reap0 17108
Description: Real number trichotomy is equivalent to decidability of apartness from zero. (Contributed by Jim Kingdon, 27-Jul-2024.)
Assertion
Ref Expression
reap0  |-  ( A. x  e.  RR  A. y  e.  RR  ( x  < 
y  \/  x  =  y  \/  y  < 
x )  <->  A. z  e.  RR DECID  z #  0 )
Distinct variable group:    x, y, z

Proof of Theorem reap0
StepHypRef Expression
1 simpl 109 . . . . 5  |-  ( ( A. x  e.  RR  A. y  e.  RR  (
x  <  y  \/  x  =  y  \/  y  <  x )  /\  z  e.  RR )  ->  A. x  e.  RR  A. y  e.  RR  (
x  <  y  \/  x  =  y  \/  y  <  x ) )
2 simpr 110 . . . . . 6  |-  ( ( A. x  e.  RR  A. y  e.  RR  (
x  <  y  \/  x  =  y  \/  y  <  x )  /\  z  e.  RR )  ->  z  e.  RR )
3 0re 8326 . . . . . 6  |-  0  e.  RR
4 breq1 4133 . . . . . . . 8  |-  ( x  =  z  ->  (
x  <  y  <->  z  <  y ) )
5 equequ1 1764 . . . . . . . 8  |-  ( x  =  z  ->  (
x  =  y  <->  z  =  y ) )
6 breq2 4134 . . . . . . . 8  |-  ( x  =  z  ->  (
y  <  x  <->  y  <  z ) )
74, 5, 63orbi123d 1352 . . . . . . 7  |-  ( x  =  z  ->  (
( x  <  y  \/  x  =  y  \/  y  <  x )  <-> 
( z  <  y  \/  z  =  y  \/  y  <  z ) ) )
8 breq2 4134 . . . . . . . 8  |-  ( y  =  0  ->  (
z  <  y  <->  z  <  0 ) )
9 eqeq2 2248 . . . . . . . 8  |-  ( y  =  0  ->  (
z  =  y  <->  z  = 
0 ) )
10 breq1 4133 . . . . . . . 8  |-  ( y  =  0  ->  (
y  <  z  <->  0  <  z ) )
118, 9, 103orbi123d 1352 . . . . . . 7  |-  ( y  =  0  ->  (
( z  <  y  \/  z  =  y  \/  y  <  z )  <-> 
( z  <  0  \/  z  =  0  \/  0  <  z ) ) )
127, 11rspc2v 2943 . . . . . 6  |-  ( ( z  e.  RR  /\  0  e.  RR )  ->  ( A. x  e.  RR  A. y  e.  RR  ( x  < 
y  \/  x  =  y  \/  y  < 
x )  ->  (
z  <  0  \/  z  =  0  \/  0  <  z ) ) )
132, 3, 12sylancl 417 . . . . 5  |-  ( ( A. x  e.  RR  A. y  e.  RR  (
x  <  y  \/  x  =  y  \/  y  <  x )  /\  z  e.  RR )  ->  ( A. x  e.  RR  A. y  e.  RR  ( x  < 
y  \/  x  =  y  \/  y  < 
x )  ->  (
z  <  0  \/  z  =  0  \/  0  <  z ) ) )
141, 13mpd 13 . . . 4  |-  ( ( A. x  e.  RR  A. y  e.  RR  (
x  <  y  \/  x  =  y  \/  y  <  x )  /\  z  e.  RR )  ->  ( z  <  0  \/  z  =  0  \/  0  <  z ) )
15 triap 17078 . . . . 5  |-  ( ( z  e.  RR  /\  0  e.  RR )  ->  ( ( z  <  0  \/  z  =  0  \/  0  < 
z )  <-> DECID  z #  0 ) )
162, 3, 15sylancl 417 . . . 4  |-  ( ( A. x  e.  RR  A. y  e.  RR  (
x  <  y  \/  x  =  y  \/  y  <  x )  /\  z  e.  RR )  ->  ( ( z  <  0  \/  z  =  0  \/  0  < 
z )  <-> DECID  z #  0 ) )
1714, 16mpbid 147 . . 3  |-  ( ( A. x  e.  RR  A. y  e.  RR  (
x  <  y  \/  x  =  y  \/  y  <  x )  /\  z  e.  RR )  -> DECID  z #  0 )
1817ralrimiva 2623 . 2  |-  ( A. x  e.  RR  A. y  e.  RR  ( x  < 
y  \/  x  =  y  \/  y  < 
x )  ->  A. z  e.  RR DECID  z #  0 )
19 breq1 4133 . . . . . . 7  |-  ( z  =  ( x  -  y )  ->  (
z #  0  <->  ( x  -  y ) #  0 ) )
2019dcbid 850 . . . . . 6  |-  ( z  =  ( x  -  y )  ->  (DECID  z #  0 
<-> DECID  ( x  -  y ) #  0 ) )
21 simpl 109 . . . . . 6  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  ->  A. z  e.  RR DECID  z #  0 )
22 resubcl 8590 . . . . . . 7  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( x  -  y
)  e.  RR )
2322adantl 277 . . . . . 6  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( x  -  y
)  e.  RR )
2420, 21, 23rspcdva 2934 . . . . 5  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> DECID  (
x  -  y ) #  0 )
25 simprl 535 . . . . . . . 8  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  ->  x  e.  RR )
2625recnd 8354 . . . . . . 7  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  ->  x  e.  CC )
27 simprr 537 . . . . . . . 8  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
y  e.  RR )
2827recnd 8354 . . . . . . 7  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
y  e.  CC )
29 subap0 8971 . . . . . . 7  |-  ( ( x  e.  CC  /\  y  e.  CC )  ->  ( ( x  -  y ) #  0  <->  x #  y
) )
3026, 28, 29syl2anc 415 . . . . . 6  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( ( x  -  y ) #  0  <->  x #  y
) )
3130dcbid 850 . . . . 5  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
(DECID  ( x  -  y
) #  0  <-> DECID  x #  y )
)
3224, 31mpbid 147 . . . 4  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> DECID  x #  y )
33 triap 17078 . . . . 5  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( ( x  < 
y  \/  x  =  y  \/  y  < 
x )  <-> DECID  x #  y )
)
3433adantl 277 . . . 4  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( ( x  < 
y  \/  x  =  y  \/  y  < 
x )  <-> DECID  x #  y )
)
3532, 34mpbird 167 . . 3  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( x  <  y  \/  x  =  y  \/  y  <  x ) )
3635ralrimivva 2632 . 2  |-  ( A. z  e.  RR DECID  z #  0  ->  A. x  e.  RR  A. y  e.  RR  (
x  <  y  \/  x  =  y  \/  y  <  x ) )
3718, 36impbii 126 1  |-  ( A. x  e.  RR  A. y  e.  RR  ( x  < 
y  \/  x  =  y  \/  y  < 
x )  <->  A. z  e.  RR DECID  z #  0 )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 846    \/ w3o 1008    = wceq 1402    e. wcel 2209   A.wral 2528   class class class wbr 4130  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179    < clt 8360    - cmin 8497   # cap 8909
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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296
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-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910
This theorem is used by:  dcapnconstALT  17112
  Copyright terms: Public domain W3C validator