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

Theorem div4p1lem1div2 9559
Description: An integer greater than 5, divided by 4 and increased by 1, is less than or equal to the half of the integer minus 1. (Contributed by AV, 8-Jul-2021.)
Assertion
Ref Expression
div4p1lem1div2  |-  ( ( N  e.  RR  /\  6  <_  N )  -> 
( ( N  / 
4 )  +  1 )  <_  ( ( N  -  1 )  /  2 ) )

Proof of Theorem div4p1lem1div2
StepHypRef Expression
1 6re 9385 . . . . . . 7  |-  6  e.  RR
21a1i 9 . . . . . 6  |-  ( N  e.  RR  ->  6  e.  RR )
3 id 19 . . . . . 6  |-  ( N  e.  RR  ->  N  e.  RR )
42, 3, 3leadd2d 8868 . . . . 5  |-  ( N  e.  RR  ->  (
6  <_  N  <->  ( N  +  6 )  <_ 
( N  +  N
) ) )
54biimpa 296 . . . 4  |-  ( ( N  e.  RR  /\  6  <_  N )  -> 
( N  +  6 )  <_  ( N  +  N ) )
6 recn 8312 . . . . . 6  |-  ( N  e.  RR  ->  N  e.  CC )
76times2d 9549 . . . . 5  |-  ( N  e.  RR  ->  ( N  x.  2 )  =  ( N  +  N ) )
87adantr 276 . . . 4  |-  ( ( N  e.  RR  /\  6  <_  N )  -> 
( N  x.  2 )  =  ( N  +  N ) )
95, 8breqtrrd 4158 . . 3  |-  ( ( N  e.  RR  /\  6  <_  N )  -> 
( N  +  6 )  <_  ( N  x.  2 ) )
10 4cn 9382 . . . . . . . 8  |-  4  e.  CC
1110a1i 9 . . . . . . 7  |-  ( N  e.  RR  ->  4  e.  CC )
12 2cn 9375 . . . . . . . 8  |-  2  e.  CC
1312a1i 9 . . . . . . 7  |-  ( N  e.  RR  ->  2  e.  CC )
146, 11, 13addassd 8348 . . . . . 6  |-  ( N  e.  RR  ->  (
( N  +  4 )  +  2 )  =  ( N  +  ( 4  +  2 ) ) )
15 4p2e6 9448 . . . . . . 7  |-  ( 4  +  2 )  =  6
1615oveq2i 6096 . . . . . 6  |-  ( N  +  ( 4  +  2 ) )  =  ( N  +  6 )
1714, 16eqtrdi 2287 . . . . 5  |-  ( N  e.  RR  ->  (
( N  +  4 )  +  2 )  =  ( N  + 
6 ) )
1817breq1d 4140 . . . 4  |-  ( N  e.  RR  ->  (
( ( N  + 
4 )  +  2 )  <_  ( N  x.  2 )  <->  ( N  +  6 )  <_ 
( N  x.  2 ) ) )
1918adantr 276 . . 3  |-  ( ( N  e.  RR  /\  6  <_  N )  -> 
( ( ( N  +  4 )  +  2 )  <_  ( N  x.  2 )  <-> 
( N  +  6 )  <_  ( N  x.  2 ) ) )
209, 19mpbird 167 . 2  |-  ( ( N  e.  RR  /\  6  <_  N )  -> 
( ( N  + 
4 )  +  2 )  <_  ( N  x.  2 ) )
21 4re 9381 . . . . . . . 8  |-  4  e.  RR
2221a1i 9 . . . . . . 7  |-  ( N  e.  RR  ->  4  e.  RR )
23 4ap0 9403 . . . . . . . 8  |-  4 #  0
2423a1i 9 . . . . . . 7  |-  ( N  e.  RR  ->  4 #  0 )
253, 22, 24redivclapd 9165 . . . . . 6  |-  ( N  e.  RR  ->  ( N  /  4 )  e.  RR )
26 peano2re 8462 . . . . . 6  |-  ( ( N  /  4 )  e.  RR  ->  (
( N  /  4
)  +  1 )  e.  RR )
2725, 26syl 14 . . . . 5  |-  ( N  e.  RR  ->  (
( N  /  4
)  +  1 )  e.  RR )
28 peano2rem 8593 . . . . . 6  |-  ( N  e.  RR  ->  ( N  -  1 )  e.  RR )
2928rehalfcld 9552 . . . . 5  |-  ( N  e.  RR  ->  (
( N  -  1 )  /  2 )  e.  RR )
30 4pos 9401 . . . . . . 7  |-  0  <  4
3121, 30pm3.2i 272 . . . . . 6  |-  ( 4  e.  RR  /\  0  <  4 )
3231a1i 9 . . . . 5  |-  ( N  e.  RR  ->  (
4  e.  RR  /\  0  <  4 ) )
33 lemul1 8921 . . . . 5  |-  ( ( ( ( N  / 
4 )  +  1 )  e.  RR  /\  ( ( N  - 
1 )  /  2
)  e.  RR  /\  ( 4  e.  RR  /\  0  <  4 ) )  ->  ( (
( N  /  4
)  +  1 )  <_  ( ( N  -  1 )  / 
2 )  <->  ( (
( N  /  4
)  +  1 )  x.  4 )  <_ 
( ( ( N  -  1 )  / 
2 )  x.  4 ) ) )
3427, 29, 32, 33syl3anc 1278 . . . 4  |-  ( N  e.  RR  ->  (
( ( N  / 
4 )  +  1 )  <_  ( ( N  -  1 )  /  2 )  <->  ( (
( N  /  4
)  +  1 )  x.  4 )  <_ 
( ( ( N  -  1 )  / 
2 )  x.  4 ) ) )
3525recnd 8354 . . . . . 6  |-  ( N  e.  RR  ->  ( N  /  4 )  e.  CC )
36 1cnd 8342 . . . . . 6  |-  ( N  e.  RR  ->  1  e.  CC )
376, 11, 24divcanap1d 9121 . . . . . . 7  |-  ( N  e.  RR  ->  (
( N  /  4
)  x.  4 )  =  N )
3810mullidi 8329 . . . . . . . 8  |-  ( 1  x.  4 )  =  4
3938a1i 9 . . . . . . 7  |-  ( N  e.  RR  ->  (
1  x.  4 )  =  4 )
4037, 39oveq12d 6103 . . . . . 6  |-  ( N  e.  RR  ->  (
( ( N  / 
4 )  x.  4 )  +  ( 1  x.  4 ) )  =  ( N  + 
4 ) )
4135, 11, 36, 40joinlmuladdmuld 8353 . . . . 5  |-  ( N  e.  RR  ->  (
( ( N  / 
4 )  +  1 )  x.  4 )  =  ( N  + 
4 ) )
42 2t2e4 9459 . . . . . . . . 9  |-  ( 2  x.  2 )  =  4
4342eqcomi 2242 . . . . . . . 8  |-  4  =  ( 2  x.  2 )
4443a1i 9 . . . . . . 7  |-  ( N  e.  RR  ->  4  =  ( 2  x.  2 ) )
4544oveq2d 6101 . . . . . 6  |-  ( N  e.  RR  ->  (
( ( N  - 
1 )  /  2
)  x.  4 )  =  ( ( ( N  -  1 )  /  2 )  x.  ( 2  x.  2 ) ) )
4629recnd 8354 . . . . . . 7  |-  ( N  e.  RR  ->  (
( N  -  1 )  /  2 )  e.  CC )
47 mulass 8310 . . . . . . . 8  |-  ( ( ( ( N  - 
1 )  /  2
)  e.  CC  /\  2  e.  CC  /\  2  e.  CC )  ->  (
( ( ( N  -  1 )  / 
2 )  x.  2 )  x.  2 )  =  ( ( ( N  -  1 )  /  2 )  x.  ( 2  x.  2 ) ) )
4847eqcomd 2244 . . . . . . 7  |-  ( ( ( ( N  - 
1 )  /  2
)  e.  CC  /\  2  e.  CC  /\  2  e.  CC )  ->  (
( ( N  - 
1 )  /  2
)  x.  ( 2  x.  2 ) )  =  ( ( ( ( N  -  1 )  /  2 )  x.  2 )  x.  2 ) )
4946, 13, 13, 48syl3anc 1278 . . . . . 6  |-  ( N  e.  RR  ->  (
( ( N  - 
1 )  /  2
)  x.  ( 2  x.  2 ) )  =  ( ( ( ( N  -  1 )  /  2 )  x.  2 )  x.  2 ) )
5028recnd 8354 . . . . . . . . 9  |-  ( N  e.  RR  ->  ( N  -  1 )  e.  CC )
51 2ap0 9397 . . . . . . . . . 10  |-  2 #  0
5251a1i 9 . . . . . . . . 9  |-  ( N  e.  RR  ->  2 #  0 )
5350, 13, 52divcanap1d 9121 . . . . . . . 8  |-  ( N  e.  RR  ->  (
( ( N  - 
1 )  /  2
)  x.  2 )  =  ( N  - 
1 ) )
5453oveq1d 6100 . . . . . . 7  |-  ( N  e.  RR  ->  (
( ( ( N  -  1 )  / 
2 )  x.  2 )  x.  2 )  =  ( ( N  -  1 )  x.  2 ) )
556, 36, 13subdird 8742 . . . . . . 7  |-  ( N  e.  RR  ->  (
( N  -  1 )  x.  2 )  =  ( ( N  x.  2 )  -  ( 1  x.  2 ) ) )
5612mullidi 8329 . . . . . . . . 9  |-  ( 1  x.  2 )  =  2
5756a1i 9 . . . . . . . 8  |-  ( N  e.  RR  ->  (
1  x.  2 )  =  2 )
5857oveq2d 6101 . . . . . . 7  |-  ( N  e.  RR  ->  (
( N  x.  2 )  -  ( 1  x.  2 ) )  =  ( ( N  x.  2 )  - 
2 ) )
5954, 55, 583eqtrd 2275 . . . . . 6  |-  ( N  e.  RR  ->  (
( ( ( N  -  1 )  / 
2 )  x.  2 )  x.  2 )  =  ( ( N  x.  2 )  - 
2 ) )
6045, 49, 593eqtrd 2275 . . . . 5  |-  ( N  e.  RR  ->  (
( ( N  - 
1 )  /  2
)  x.  4 )  =  ( ( N  x.  2 )  - 
2 ) )
6141, 60breq12d 4143 . . . 4  |-  ( N  e.  RR  ->  (
( ( ( N  /  4 )  +  1 )  x.  4 )  <_  ( (
( N  -  1 )  /  2 )  x.  4 )  <->  ( N  +  4 )  <_ 
( ( N  x.  2 )  -  2 ) ) )
623, 22readdcld 8355 . . . . 5  |-  ( N  e.  RR  ->  ( N  +  4 )  e.  RR )
63 2re 9374 . . . . . 6  |-  2  e.  RR
6463a1i 9 . . . . 5  |-  ( N  e.  RR  ->  2  e.  RR )
653, 64remulcld 8356 . . . . 5  |-  ( N  e.  RR  ->  ( N  x.  2 )  e.  RR )
66 leaddsub 8766 . . . . . 6  |-  ( ( ( N  +  4 )  e.  RR  /\  2  e.  RR  /\  ( N  x.  2 )  e.  RR )  -> 
( ( ( N  +  4 )  +  2 )  <_  ( N  x.  2 )  <-> 
( N  +  4 )  <_  ( ( N  x.  2 )  -  2 ) ) )
6766bicomd 141 . . . . 5  |-  ( ( ( N  +  4 )  e.  RR  /\  2  e.  RR  /\  ( N  x.  2 )  e.  RR )  -> 
( ( N  + 
4 )  <_  (
( N  x.  2 )  -  2 )  <-> 
( ( N  + 
4 )  +  2 )  <_  ( N  x.  2 ) ) )
6862, 64, 65, 67syl3anc 1278 . . . 4  |-  ( N  e.  RR  ->  (
( N  +  4 )  <_  ( ( N  x.  2 )  -  2 )  <->  ( ( N  +  4 )  +  2 )  <_ 
( N  x.  2 ) ) )
6934, 61, 683bitrd 214 . . 3  |-  ( N  e.  RR  ->  (
( ( N  / 
4 )  +  1 )  <_  ( ( N  -  1 )  /  2 )  <->  ( ( N  +  4 )  +  2 )  <_ 
( N  x.  2 ) ) )
7069adantr 276 . 2  |-  ( ( N  e.  RR  /\  6  <_  N )  -> 
( ( ( N  /  4 )  +  1 )  <_  (
( N  -  1 )  /  2 )  <-> 
( ( N  + 
4 )  +  2 )  <_  ( N  x.  2 ) ) )
7120, 70mpbird 167 1  |-  ( ( N  e.  RR  /\  6  <_  N )  -> 
( ( N  / 
4 )  +  1 )  <_  ( ( N  -  1 )  /  2 ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   class class class wbr 4130  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179   1c1 8180    + caddc 8182    x. cmul 8184    < clt 8360    <_ cle 8361    - cmin 8497   # cap 8909    / cdiv 9002   2c2 9355   4c4 9357   6c6 9359
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367
This theorem is used by:  fldiv4p1lem1div2  10740
  Copyright terms: Public domain W3C validator