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

Theorem apbtwnz 10524
Description: There is a unique greatest integer less than or equal to a real number which is apart from all integers. (Contributed by Jim Kingdon, 11-May-2022.)
Assertion
Ref Expression
apbtwnz  |-  ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  ->  E! x  e.  ZZ  (
x  <_  A  /\  A  <  ( x  + 
1 ) ) )
Distinct variable group:    A, n, x

Proof of Theorem apbtwnz
Dummy variable  m is distinct from all other variables.
StepHypRef Expression
1 simpl 109 . . 3  |-  ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  ->  A  e.  RR )
2 simpr 110 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  /\  A  <  m
)  ->  A  <  m )
32olcd 739 . . . 4  |-  ( ( ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  /\  A  <  m
)  ->  ( m  <_  A  \/  A  < 
m ) )
4 simpr 110 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\ 
A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  ->  m  e.  ZZ )
54zred 9592 . . . . . . 7  |-  ( ( ( A  e.  RR  /\ 
A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  ->  m  e.  RR )
65adantr 276 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  /\  m  <  A
)  ->  m  e.  RR )
71adantr 276 . . . . . . 7  |-  ( ( ( A  e.  RR  /\ 
A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  ->  A  e.  RR )
87adantr 276 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  /\  m  <  A
)  ->  A  e.  RR )
9 simpr 110 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  /\  m  <  A
)  ->  m  <  A )
106, 8, 9ltled 8288 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  /\  m  <  A
)  ->  m  <_  A )
1110orcd 738 . . . 4  |-  ( ( ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  /\  m  <  A
)  ->  ( m  <_  A  \/  A  < 
m ) )
12 breq2 4090 . . . . . 6  |-  ( n  =  m  ->  ( A #  n  <->  A #  m )
)
13 simplr 528 . . . . . 6  |-  ( ( ( A  e.  RR  /\ 
A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  ->  A. n  e.  ZZ  A #  n )
1412, 13, 4rspcdva 2913 . . . . 5  |-  ( ( ( A  e.  RR  /\ 
A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  ->  A #  m )
15 reaplt 8758 . . . . . 6  |-  ( ( A  e.  RR  /\  m  e.  RR )  ->  ( A #  m  <->  ( A  <  m  \/  m  < 
A ) ) )
167, 5, 15syl2anc 411 . . . . 5  |-  ( ( ( A  e.  RR  /\ 
A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  ->  ( A #  m  <->  ( A  < 
m  \/  m  < 
A ) ) )
1714, 16mpbid 147 . . . 4  |-  ( ( ( A  e.  RR  /\ 
A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  ->  ( A  <  m  \/  m  <  A ) )
183, 11, 17mpjaodan 803 . . 3  |-  ( ( ( A  e.  RR  /\ 
A. n  e.  ZZ  A #  n )  /\  m  e.  ZZ )  ->  (
m  <_  A  \/  A  <  m ) )
191, 18exbtwnzlemex 10499 . 2  |-  ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  ->  E. x  e.  ZZ  ( x  <_  A  /\  A  <  (
x  +  1 ) ) )
2019, 1exbtwnz 10500 1  |-  ( ( A  e.  RR  /\  A. n  e.  ZZ  A #  n )  ->  E! x  e.  ZZ  (
x  <_  A  /\  A  <  ( x  + 
1 ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713    e. wcel 2200   A.wral 2508   E!wreu 2510   class class class wbr 4086  (class class class)co 6013   RRcr 8021   1c1 8023    + caddc 8025    < clt 8204    <_ cle 8205   # cap 8751   ZZcz 9469
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-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139  ax-arch 8141
This theorem depends on definitions:  df-bi 117  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-rmo 2516  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-int 3927  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-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-reap 8745  df-ap 8752  df-inn 9134  df-n0 9393  df-z 9470
This theorem is referenced by:  flapcl  10525
  Copyright terms: Public domain W3C validator