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

Theorem reap0 16598
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 8169 . . . . . 6  |-  0  e.  RR
4 breq1 4089 . . . . . . . 8  |-  ( x  =  z  ->  (
x  <  y  <->  z  <  y ) )
5 equequ1 1758 . . . . . . . 8  |-  ( x  =  z  ->  (
x  =  y  <->  z  =  y ) )
6 breq2 4090 . . . . . . . 8  |-  ( x  =  z  ->  (
y  <  x  <->  y  <  z ) )
74, 5, 63orbi123d 1345 . . . . . . 7  |-  ( x  =  z  ->  (
( x  <  y  \/  x  =  y  \/  y  <  x )  <-> 
( z  <  y  \/  z  =  y  \/  y  <  z ) ) )
8 breq2 4090 . . . . . . . 8  |-  ( y  =  0  ->  (
z  <  y  <->  z  <  0 ) )
9 eqeq2 2239 . . . . . . . 8  |-  ( y  =  0  ->  (
z  =  y  <->  z  = 
0 ) )
10 breq1 4089 . . . . . . . 8  |-  ( y  =  0  ->  (
y  <  z  <->  0  <  z ) )
118, 9, 103orbi123d 1345 . . . . . . 7  |-  ( y  =  0  ->  (
( z  <  y  \/  z  =  y  \/  y  <  z )  <-> 
( z  <  0  \/  z  =  0  \/  0  <  z ) ) )
127, 11rspc2v 2921 . . . . . 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 413 . . . . 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 16569 . . . . 5  |-  ( ( z  e.  RR  /\  0  e.  RR )  ->  ( ( z  <  0  \/  z  =  0  \/  0  < 
z )  <-> DECID  z #  0 ) )
162, 3, 15sylancl 413 . . . 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 2603 . 2  |-  ( A. x  e.  RR  A. y  e.  RR  ( x  < 
y  \/  x  =  y  \/  y  < 
x )  ->  A. z  e.  RR DECID  z #  0 )
19 breq1 4089 . . . . . . 7  |-  ( z  =  ( x  -  y )  ->  (
z #  0  <->  ( x  -  y ) #  0 ) )
2019dcbid 843 . . . . . 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 8433 . . . . . . 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 2913 . . . . 5  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> DECID  (
x  -  y ) #  0 )
25 simprl 529 . . . . . . . 8  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  ->  x  e.  RR )
2625recnd 8198 . . . . . . 7  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  ->  x  e.  CC )
27 simprr 531 . . . . . . . 8  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
y  e.  RR )
2827recnd 8198 . . . . . . 7  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
y  e.  CC )
29 subap0 8813 . . . . . . 7  |-  ( ( x  e.  CC  /\  y  e.  CC )  ->  ( ( x  -  y ) #  0  <->  x #  y
) )
3026, 28, 29syl2anc 411 . . . . . 6  |-  ( ( A. z  e.  RR DECID  z #  0  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( ( x  -  y ) #  0  <->  x #  y
) )
3130dcbid 843 . . . . 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 16569 . . . . 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 2612 . 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 839    \/ w3o 1001    = wceq 1395    e. wcel 2200   A.wral 2508   class class class wbr 4086  (class class class)co 6013   CCcc 8020   RRcr 8021   0cc0 8022    < clt 8204    - cmin 8340   # cap 8751
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-ltxr 8209  df-sub 8342  df-neg 8343  df-reap 8745  df-ap 8752
This theorem is referenced by:  dcapnconstALT  16602
  Copyright terms: Public domain W3C validator