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

Theorem halfleoddlt 12535
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 12514 . . 3  |-  ( N  e.  ZZ  ->  ( -.  2  ||  N  <->  E. n  e.  ZZ  ( ( 2  x.  n )  +  1 )  =  N ) )
2 0xr 8285 . . . . . . . . . . . 12  |-  0  e.  RR*
3 1re 8238 . . . . . . . . . . . . 13  |-  1  e.  RR
43rexri 8296 . . . . . . . . . . . 12  |-  1  e.  RR*
5 halfre 9416 . . . . . . . . . . . . 13  |-  ( 1  /  2 )  e.  RR
65rexri 8296 . . . . . . . . . . . 12  |-  ( 1  /  2 )  e. 
RR*
72, 4, 63pm3.2i 1202 . . . . . . . . . . 11  |-  ( 0  e.  RR*  /\  1  e.  RR*  /\  ( 1  /  2 )  e. 
RR* )
8 halfgt0 9418 . . . . . . . . . . . 12  |-  0  <  ( 1  /  2
)
9 halflt1 9420 . . . . . . . . . . . 12  |-  ( 1  /  2 )  <  1
108, 9pm3.2i 272 . . . . . . . . . . 11  |-  ( 0  <  ( 1  / 
2 )  /\  (
1  /  2 )  <  1 )
11 elioo3g 10206 . . . . . . . . . . 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 951 . . . . . . . . . 10  |-  ( 1  /  2 )  e.  ( 0 (,) 1
)
13 zltaddlt1le 10304 . . . . . . . . . 10  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ  /\  (
1  /  2 )  e.  ( 0 (,) 1 ) )  -> 
( ( n  +  ( 1  /  2
) )  <  M  <->  ( n  +  ( 1  /  2 ) )  <_  M ) )
1412, 13mp3an3 1363 . . . . . . . . 9  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( n  +  ( 1  /  2
) )  <  M  <->  ( n  +  ( 1  /  2 ) )  <_  M ) )
15 zcn 9545 . . . . . . . . . . . 12  |-  ( n  e.  ZZ  ->  n  e.  CC )
1615adantr 276 . . . . . . . . . . 11  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  n  e.  CC )
17 1cnd 8255 . . . . . . . . . . 11  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  1  e.  CC )
18 2cn 9273 . . . . . . . . . . . . 13  |-  2  e.  CC
19 2ap0 9295 . . . . . . . . . . . . 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 8946 . . . . . . . . . . 11  |-  ( ( n  e.  CC  /\  1  e.  CC  /\  (
2  e.  CC  /\  2 #  0 ) )  -> 
( ( ( 2  x.  n )  +  1 )  /  2
)  =  ( n  +  ( 1  / 
2 ) ) )
2316, 17, 21, 22syl3anc 1274 . . . . . . . . . 10  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( ( 2  x.  n )  +  1 )  /  2
)  =  ( n  +  ( 1  / 
2 ) ) )
2423breq1d 4103 . . . . . . . . 9  |-  ( ( n  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( ( ( 2  x.  n )  +  1 )  / 
2 )  <  M  <->  ( n  +  ( 1  /  2 ) )  <  M ) )
2523breq1d 4103 . . . . . . . . 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 6035 . . . . . . . . . 10  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  (
( ( 2  x.  n )  +  1 )  /  2 )  =  ( N  / 
2 ) )
2827breq1d 4103 . . . . . . . . 9  |-  ( ( ( 2  x.  n
)  +  1 )  =  N  ->  (
( ( ( 2  x.  n )  +  1 )  /  2
)  <_  M  <->  ( N  /  2 )  <_  M ) )
2927breq1d 4103 . . . . . . . . 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 2651 . . 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 1220 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 1005    = wceq 1398    e. wcel 2202   E.wrex 2512   class class class wbr 4093  (class class class)co 6028   CCcc 8090   0cc0 8092   1c1 8093    + caddc 8095    x. cmul 8097   RR*cxr 8272    < clt 8273    <_ cle 8274   # cap 8820    / cdiv 8911   2c2 9253   ZZcz 9540   (,)cioo 10184    || cdvds 12428
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-xor 1421  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-id 4396  df-po 4399  df-iso 4400  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-inn 9203  df-2 9261  df-n0 9462  df-z 9541  df-rp 9950  df-ioo 10188  df-dvds 12429
This theorem is referenced by:  gausslemma2dlem1a  15877
  Copyright terms: Public domain W3C validator