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

Theorem halfleoddlt 11918
Description: An integer is greater than half of an odd number iff it is greater than or equal to the half of the odd number. (Contributed by AV, 1-Jul-2021.)
Assertion
Ref Expression
halfleoddlt  |-  ( ( N  e.  ZZ  /\  -.  2  ||  N  /\  M  e.  ZZ )  ->  ( ( N  / 
2 )  <_  M  <->  ( N  /  2 )  <  M ) )

Proof of Theorem halfleoddlt
Dummy variable  n is distinct from all other variables.
StepHypRef Expression
1 odd2np1 11897 . . 3  |-  ( N  e.  ZZ  ->  ( -.  2  ||  N  <->  E. n  e.  ZZ  ( ( 2  x.  n )  +  1 )  =  N ) )
2 0xr 8023 . . . . . . . . . . . 12  |-  0  e.  RR*
3 1re 7975 . . . . . . . . . . . . 13  |-  1  e.  RR
43rexri 8034 . . . . . . . . . . . 12  |-  1  e.  RR*
5 halfre 9151 . . . . . . . . . . . . 13  |-  ( 1  /  2 )  e.  RR
65rexri 8034 . . . . . . . . . . . 12  |-  ( 1  /  2 )  e. 
RR*
72, 4, 63pm3.2i 1177 . . . . . . . . . . 11  |-  ( 0  e.  RR*  /\  1  e.  RR*  /\  ( 1  /  2 )  e. 
RR* )
8 halfgt0 9153 . . . . . . . . . . . 12  |-  0  <  ( 1  /  2
)
9 halflt1 9155 . . . . . . . . . . . 12  |-  ( 1  /  2 )  <  1
108, 9pm3.2i 272 . . . . . . . . . . 11  |-  ( 0  <  ( 1  / 
2 )  /\  (
1  /  2 )  <  1 )
11 elioo3g 9929 . . . . . . . . . . 11  |-  ( ( 1  /  2 )  e.  ( 0 (,) 1 )  <->  ( (
0  e.  RR*  /\  1  e.  RR*  /\  ( 1  /  2 )  e. 
RR* )  /\  (
0  <  ( 1  /  2 )  /\  ( 1  /  2
)  <  1 ) ) )
127, 10, 11mpbir2an 944 . . . . . . . . . 10  |-  ( 1  /  2 )  e.  ( 0 (,) 1
)
13 zltaddlt1le 10026 . . . . . . . . . 10  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ  /\  (
1  /  2 )  e.  ( 0 (,) 1 ) )  -> 
( ( n  +  ( 1  /  2
) )  <  M  <->  ( n  +  ( 1  /  2 ) )  <_  M ) )
1412, 13mp3an3 1337 . . . . . . . . 9  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( n  +  ( 1  /  2
) )  <  M  <->  ( n  +  ( 1  /  2 ) )  <_  M ) )
15 zcn 9277 . . . . . . . . . . . 12  |-  ( n  e.  ZZ  ->  n  e.  CC )
1615adantr 276 . . . . . . . . . . 11  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  n  e.  CC )
17 1cnd 7992 . . . . . . . . . . 11  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  1  e.  CC )
18 2cn 9009 . . . . . . . . . . . . 13  |-  2  e.  CC
19 2ap0 9031 . . . . . . . . . . . . 13  |-  2 #  0
2018, 19pm3.2i 272 . . . . . . . . . . . 12  |-  ( 2  e.  CC  /\  2 #  0 )
2120a1i 9 . . . . . . . . . . 11  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( 2  e.  CC  /\  2 #  0 ) )
22 muldivdirap 8683 . . . . . . . . . . 11  |-  ( ( n  e.  CC  /\  1  e.  CC  /\  (
2  e.  CC  /\  2 #  0 ) )  -> 
( ( ( 2  x.  n )  +  1 )  /  2
)  =  ( n  +  ( 1  / 
2 ) ) )
2316, 17, 21, 22syl3anc 1249 . . . . . . . . . 10  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( ( 2  x.  n )  +  1 )  /  2
)  =  ( n  +  ( 1  / 
2 ) ) )
2423breq1d 4028 . . . . . . . . 9  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( ( ( 2  x.  n )  +  1 )  / 
2 )  <  M  <->  ( n  +  ( 1  /  2 ) )  <  M ) )
2523breq1d 4028 . . . . . . . . 9  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( ( ( 2  x.  n )  +  1 )  / 
2 )  <_  M  <->  ( n  +  ( 1  /  2 ) )  <_  M ) )
2614, 24, 253bitr4rd 221 . . . . . . . 8  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( ( ( 2  x.  n )  +  1 )  / 
2 )  <_  M  <->  ( ( ( 2  x.  n )  +  1 )  /  2 )  <  M ) )
27 oveq1 5898 . . . . . . . . . 10  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  (
( ( 2  x.  n )  +  1 )  /  2 )  =  ( N  / 
2 ) )
2827breq1d 4028 . . . . . . . . 9  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  (
( ( ( 2  x.  n )  +  1 )  /  2
)  <_  M  <->  ( N  /  2 )  <_  M ) )
2927breq1d 4028 . . . . . . . . 9  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  (
( ( ( 2  x.  n )  +  1 )  /  2
)  <  M  <->  ( N  /  2 )  < 
M ) )
3028, 29bibi12d 235 . . . . . . . 8  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  (
( ( ( ( 2  x.  n )  +  1 )  / 
2 )  <_  M  <->  ( ( ( 2  x.  n )  +  1 )  /  2 )  <  M )  <->  ( ( N  /  2 )  <_  M 
<->  ( N  /  2
)  <  M )
) )
3126, 30syl5ibcom 155 . . . . . . 7  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( ( 2  x.  n )  +  1 )  =  N  ->  ( ( N  /  2 )  <_  M 
<->  ( N  /  2
)  <  M )
) )
3231ex 115 . . . . . 6  |-  ( n  e.  ZZ  ->  ( M  e.  ZZ  ->  ( ( ( 2  x.  n )  +  1 )  =  N  -> 
( ( N  / 
2 )  <_  M  <->  ( N  /  2 )  <  M ) ) ) )
3332adantl 277 . . . . 5  |-  ( ( N  e.  ZZ  /\  n  e.  ZZ )  ->  ( M  e.  ZZ  ->  ( ( ( 2  x.  n )  +  1 )  =  N  ->  ( ( N  /  2 )  <_  M 
<->  ( N  /  2
)  <  M )
) ) )
3433com23 78 . . . 4  |-  ( ( N  e.  ZZ  /\  n  e.  ZZ )  ->  ( ( ( 2  x.  n )  +  1 )  =  N  ->  ( M  e.  ZZ  ->  ( ( N  /  2 )  <_  M 
<->  ( N  /  2
)  <  M )
) ) )
3534rexlimdva 2607 . . 3  |-  ( N  e.  ZZ  ->  ( E. n  e.  ZZ  ( ( 2  x.  n )  +  1 )  =  N  -> 
( M  e.  ZZ  ->  ( ( N  / 
2 )  <_  M  <->  ( N  /  2 )  <  M ) ) ) )
361, 35sylbid 150 . 2  |-  ( N  e.  ZZ  ->  ( -.  2  ||  N  -> 
( M  e.  ZZ  ->  ( ( N  / 
2 )  <_  M  <->  ( N  /  2 )  <  M ) ) ) )
37363imp 1195 1  |-  ( ( N  e.  ZZ  /\  -.  2  ||  N  /\  M  e.  ZZ )  ->  ( ( N  / 
2 )  <_  M  <->  ( N  /  2 )  <  M ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2160   E.wrex 2469   class class class wbr 4018  (class class class)co 5891   CCcc 7828   0cc0 7830   1c1 7831    + caddc 7833    x. cmul 7835   RR*cxr 8010    < clt 8011    <_ cle 8012   # cap 8557    / cdiv 8648   2c2 8989   ZZcz 9272   (,)cioo 9907    || cdvds 11813
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551  ax-cnex 7921  ax-resscn 7922  ax-1cn 7923  ax-1re 7924  ax-icn 7925  ax-addcl 7926  ax-addrcl 7927  ax-mulcl 7928  ax-mulrcl 7929  ax-addcom 7930  ax-mulcom 7931  ax-addass 7932  ax-mulass 7933  ax-distr 7934  ax-i2m1 7935  ax-0lt1 7936  ax-1rid 7937  ax-0id 7938  ax-rnegex 7939  ax-precex 7940  ax-cnre 7941  ax-pre-ltirr 7942  ax-pre-ltwlin 7943  ax-pre-lttrn 7944  ax-pre-apti 7945  ax-pre-ltadd 7946  ax-pre-mulgt0 7947  ax-pre-mulext 7948
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-xor 1387  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-br 4019  df-opab 4080  df-id 4308  df-po 4311  df-iso 4312  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-iota 5193  df-fun 5233  df-fv 5239  df-riota 5847  df-ov 5894  df-oprab 5895  df-mpo 5896  df-pnf 8013  df-mnf 8014  df-xr 8015  df-ltxr 8016  df-le 8017  df-sub 8149  df-neg 8150  df-reap 8551  df-ap 8558  df-div 8649  df-inn 8939  df-2 8997  df-n0 9196  df-z 9273  df-rp 9673  df-ioo 9911  df-dvds 11814
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator