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

Theorem halfleoddlt 12320
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 12299 . . 3  |-  ( N  e.  ZZ  ->  ( -.  2  ||  N  <->  E. n  e.  ZZ  ( ( 2  x.  n )  +  1 )  =  N ) )
2 0xr 8154 . . . . . . . . . . . 12  |-  0  e.  RR*
3 1re 8106 . . . . . . . . . . . . 13  |-  1  e.  RR
43rexri 8165 . . . . . . . . . . . 12  |-  1  e.  RR*
5 halfre 9285 . . . . . . . . . . . . 13  |-  ( 1  /  2 )  e.  RR
65rexri 8165 . . . . . . . . . . . 12  |-  ( 1  /  2 )  e. 
RR*
72, 4, 63pm3.2i 1178 . . . . . . . . . . 11  |-  ( 0  e.  RR*  /\  1  e.  RR*  /\  ( 1  /  2 )  e. 
RR* )
8 halfgt0 9287 . . . . . . . . . . . 12  |-  0  <  ( 1  /  2
)
9 halflt1 9289 . . . . . . . . . . . 12  |-  ( 1  /  2 )  <  1
108, 9pm3.2i 272 . . . . . . . . . . 11  |-  ( 0  <  ( 1  / 
2 )  /\  (
1  /  2 )  <  1 )
11 elioo3g 10067 . . . . . . . . . . 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 945 . . . . . . . . . 10  |-  ( 1  /  2 )  e.  ( 0 (,) 1
)
13 zltaddlt1le 10164 . . . . . . . . . 10  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ  /\  (
1  /  2 )  e.  ( 0 (,) 1 ) )  -> 
( ( n  +  ( 1  /  2
) )  <  M  <->  ( n  +  ( 1  /  2 ) )  <_  M ) )
1412, 13mp3an3 1339 . . . . . . . . 9  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( n  +  ( 1  /  2
) )  <  M  <->  ( n  +  ( 1  /  2 ) )  <_  M ) )
15 zcn 9412 . . . . . . . . . . . 12  |-  ( n  e.  ZZ  ->  n  e.  CC )
1615adantr 276 . . . . . . . . . . 11  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  n  e.  CC )
17 1cnd 8123 . . . . . . . . . . 11  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  1  e.  CC )
18 2cn 9142 . . . . . . . . . . . . 13  |-  2  e.  CC
19 2ap0 9164 . . . . . . . . . . . . 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 8815 . . . . . . . . . . 11  |-  ( ( n  e.  CC  /\  1  e.  CC  /\  (
2  e.  CC  /\  2 #  0 ) )  -> 
( ( ( 2  x.  n )  +  1 )  /  2
)  =  ( n  +  ( 1  / 
2 ) ) )
2316, 17, 21, 22syl3anc 1250 . . . . . . . . . 10  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( ( 2  x.  n )  +  1 )  /  2
)  =  ( n  +  ( 1  / 
2 ) ) )
2423breq1d 4069 . . . . . . . . 9  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( ( ( 2  x.  n )  +  1 )  / 
2 )  <  M  <->  ( n  +  ( 1  /  2 ) )  <  M ) )
2523breq1d 4069 . . . . . . . . 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 5974 . . . . . . . . . 10  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  (
( ( 2  x.  n )  +  1 )  /  2 )  =  ( N  / 
2 ) )
2827breq1d 4069 . . . . . . . . 9  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  (
( ( ( 2  x.  n )  +  1 )  /  2
)  <_  M  <->  ( N  /  2 )  <_  M ) )
2927breq1d 4069 . . . . . . . . 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 2625 . . 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 1196 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 981    = wceq 1373    e. wcel 2178   E.wrex 2487   class class class wbr 4059  (class class class)co 5967   CCcc 7958   0cc0 7960   1c1 7961    + caddc 7963    x. cmul 7965   RR*cxr 8141    < clt 8142    <_ cle 8143   # cap 8689    / cdiv 8780   2c2 9122   ZZcz 9407   (,)cioo 10045    || cdvds 12213
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-mulrcl 8059  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-precex 8070  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076  ax-pre-mulgt0 8077  ax-pre-mulext 8078
This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-xor 1396  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-br 4060  df-opab 4122  df-id 4358  df-po 4361  df-iso 4362  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-iota 5251  df-fun 5292  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-reap 8683  df-ap 8690  df-div 8781  df-inn 9072  df-2 9130  df-n0 9331  df-z 9408  df-rp 9811  df-ioo 10049  df-dvds 12214
This theorem is referenced by:  gausslemma2dlem1a  15650
  Copyright terms: Public domain W3C validator