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

Theorem 2lgslem3d1 16022
Description: Lemma 4 for 2lgslem3 16023. (Contributed by AV, 15-Jul-2021.)
Hypothesis
Ref Expression
2lgslem2.n  |-  N  =  ( ( ( P  -  1 )  / 
2 )  -  ( |_ `  ( P  / 
4 ) ) )
Assertion
Ref Expression
2lgslem3d1  |-  ( ( P  e.  NN  /\  ( P  mod  8
)  =  7 )  ->  ( N  mod  2 )  =  0 )

Proof of Theorem 2lgslem3d1
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 nnnn0 9508 . . . 4  |-  ( P  e.  NN  ->  P  e.  NN0 )
2 8nn 9410 . . . . 5  |-  8  e.  NN
3 nnq 9971 . . . . 5  |-  ( 8  e.  NN  ->  8  e.  QQ )
42, 3mp1i 10 . . . 4  |-  ( P  e.  NN  ->  8  e.  QQ )
52nngt0i 9272 . . . . 5  |-  0  <  8
65a1i 9 . . . 4  |-  ( P  e.  NN  ->  0  <  8 )
7 modqmuladdnn0 10737 . . . 4  |-  ( ( P  e.  NN0  /\  8  e.  QQ  /\  0  <  8 )  ->  (
( P  mod  8
)  =  7  ->  E. k  e.  NN0  P  =  ( ( k  x.  8 )  +  7 ) ) )
81, 4, 6, 7syl3anc 1274 . . 3  |-  ( P  e.  NN  ->  (
( P  mod  8
)  =  7  ->  E. k  e.  NN0  P  =  ( ( k  x.  8 )  +  7 ) ) )
9 simpr 110 . . . . 5  |-  ( ( P  e.  NN  /\  k  e.  NN0 )  -> 
k  e.  NN0 )
10 nn0cn 9511 . . . . . . . . . . 11  |-  ( k  e.  NN0  ->  k  e.  CC )
11 8cn 9328 . . . . . . . . . . . 12  |-  8  e.  CC
1211a1i 9 . . . . . . . . . . 11  |-  ( k  e.  NN0  ->  8  e.  CC )
1310, 12mulcomd 8300 . . . . . . . . . 10  |-  ( k  e.  NN0  ->  ( k  x.  8 )  =  ( 8  x.  k
) )
1413adantl 277 . . . . . . . . 9  |-  ( ( P  e.  NN  /\  k  e.  NN0 )  -> 
( k  x.  8 )  =  ( 8  x.  k ) )
1514oveq1d 6067 . . . . . . . 8  |-  ( ( P  e.  NN  /\  k  e.  NN0 )  -> 
( ( k  x.  8 )  +  7 )  =  ( ( 8  x.  k )  +  7 ) )
1615eqeq2d 2246 . . . . . . 7  |-  ( ( P  e.  NN  /\  k  e.  NN0 )  -> 
( P  =  ( ( k  x.  8 )  +  7 )  <-> 
P  =  ( ( 8  x.  k )  +  7 ) ) )
1716biimpa 296 . . . . . 6  |-  ( ( ( P  e.  NN  /\  k  e.  NN0 )  /\  P  =  (
( k  x.  8 )  +  7 ) )  ->  P  =  ( ( 8  x.  k )  +  7 ) )
18 2lgslem2.n . . . . . . 7  |-  N  =  ( ( ( P  -  1 )  / 
2 )  -  ( |_ `  ( P  / 
4 ) ) )
19182lgslem3d 16018 . . . . . 6  |-  ( ( k  e.  NN0  /\  P  =  ( (
8  x.  k )  +  7 ) )  ->  N  =  ( ( 2  x.  k
)  +  2 ) )
209, 17, 19syl2an2r 599 . . . . 5  |-  ( ( ( P  e.  NN  /\  k  e.  NN0 )  /\  P  =  (
( k  x.  8 )  +  7 ) )  ->  N  =  ( ( 2  x.  k )  +  2 ) )
21 oveq1 6059 . . . . . 6  |-  ( N  =  ( ( 2  x.  k )  +  2 )  ->  ( N  mod  2 )  =  ( ( ( 2  x.  k )  +  2 )  mod  2
) )
22 2t1e2 9396 . . . . . . . . . . . 12  |-  ( 2  x.  1 )  =  2
2322eqcomi 2238 . . . . . . . . . . 11  |-  2  =  ( 2  x.  1 )
2423a1i 9 . . . . . . . . . 10  |-  ( k  e.  NN0  ->  2  =  ( 2  x.  1 ) )
2524oveq2d 6068 . . . . . . . . 9  |-  ( k  e.  NN0  ->  ( ( 2  x.  k )  +  2 )  =  ( ( 2  x.  k )  +  ( 2  x.  1 ) ) )
26 2cnd 9315 . . . . . . . . . 10  |-  ( k  e.  NN0  ->  2  e.  CC )
27 1cnd 8295 . . . . . . . . . 10  |-  ( k  e.  NN0  ->  1  e.  CC )
28 adddi 8264 . . . . . . . . . . 11  |-  ( ( 2  e.  CC  /\  k  e.  CC  /\  1  e.  CC )  ->  (
2  x.  ( k  +  1 ) )  =  ( ( 2  x.  k )  +  ( 2  x.  1 ) ) )
2928eqcomd 2240 . . . . . . . . . 10  |-  ( ( 2  e.  CC  /\  k  e.  CC  /\  1  e.  CC )  ->  (
( 2  x.  k
)  +  ( 2  x.  1 ) )  =  ( 2  x.  ( k  +  1 ) ) )
3026, 10, 27, 29syl3anc 1274 . . . . . . . . 9  |-  ( k  e.  NN0  ->  ( ( 2  x.  k )  +  ( 2  x.  1 ) )  =  ( 2  x.  (
k  +  1 ) ) )
3110, 27addcld 8298 . . . . . . . . . 10  |-  ( k  e.  NN0  ->  ( k  +  1 )  e.  CC )
3226, 31mulcomd 8300 . . . . . . . . 9  |-  ( k  e.  NN0  ->  ( 2  x.  ( k  +  1 ) )  =  ( ( k  +  1 )  x.  2 ) )
3325, 30, 323eqtrd 2271 . . . . . . . 8  |-  ( k  e.  NN0  ->  ( ( 2  x.  k )  +  2 )  =  ( ( k  +  1 )  x.  2 ) )
3433oveq1d 6067 . . . . . . 7  |-  ( k  e.  NN0  ->  ( ( ( 2  x.  k
)  +  2 )  mod  2 )  =  ( ( ( k  +  1 )  x.  2 )  mod  2
) )
35 peano2nn0 9541 . . . . . . . . 9  |-  ( k  e.  NN0  ->  ( k  +  1 )  e. 
NN0 )
3635nn0zd 9704 . . . . . . . 8  |-  ( k  e.  NN0  ->  ( k  +  1 )  e.  ZZ )
37 2nn 9404 . . . . . . . . 9  |-  2  e.  NN
38 nnq 9971 . . . . . . . . 9  |-  ( 2  e.  NN  ->  2  e.  QQ )
3937, 38mp1i 10 . . . . . . . 8  |-  ( k  e.  NN0  ->  2  e.  QQ )
4037nngt0i 9272 . . . . . . . . 9  |-  0  <  2
4140a1i 9 . . . . . . . 8  |-  ( k  e.  NN0  ->  0  <  2 )
42 mulqmod0 10699 . . . . . . . 8  |-  ( ( ( k  +  1 )  e.  ZZ  /\  2  e.  QQ  /\  0  <  2 )  ->  (
( ( k  +  1 )  x.  2 )  mod  2 )  =  0 )
4336, 39, 41, 42syl3anc 1274 . . . . . . 7  |-  ( k  e.  NN0  ->  ( ( ( k  +  1 )  x.  2 )  mod  2 )  =  0 )
4434, 43eqtrd 2267 . . . . . 6  |-  ( k  e.  NN0  ->  ( ( ( 2  x.  k
)  +  2 )  mod  2 )  =  0 )
4521, 44sylan9eqr 2289 . . . . 5  |-  ( ( k  e.  NN0  /\  N  =  ( (
2  x.  k )  +  2 ) )  ->  ( N  mod  2 )  =  0 )
469, 20, 45syl2an2r 599 . . . 4  |-  ( ( ( P  e.  NN  /\  k  e.  NN0 )  /\  P  =  (
( k  x.  8 )  +  7 ) )  ->  ( N  mod  2 )  =  0 )
4746rexlimdva2 2665 . . 3  |-  ( P  e.  NN  ->  ( E. k  e.  NN0  P  =  ( ( k  x.  8 )  +  7 )  ->  ( N  mod  2 )  =  0 ) )
488, 47syld 45 . 2  |-  ( P  e.  NN  ->  (
( P  mod  8
)  =  7  -> 
( N  mod  2
)  =  0 ) )
4948imp 124 1  |-  ( ( P  e.  NN  /\  ( P  mod  8
)  =  7 )  ->  ( N  mod  2 )  =  0 )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2205   E.wrex 2523   class class class wbr 4111   ` cfv 5354  (class class class)co 6052   CCcc 8130   0cc0 8132   1c1 8133    + caddc 8135    x. cmul 8137    < clt 8313    - cmin 8449    / cdiv 8951   NNcn 9242   2c2 9293   4c4 9295   7c7 9298   8c8 9299   NN0cn0 9501   ZZcz 9582   QQcq 9957   |_cfl 10635    mod cmo 10691
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8223  ax-resscn 8224  ax-1cn 8225  ax-1re 8226  ax-icn 8227  ax-addcl 8228  ax-addrcl 8229  ax-mulcl 8230  ax-mulrcl 8231  ax-addcom 8232  ax-mulcom 8233  ax-addass 8234  ax-mulass 8235  ax-distr 8236  ax-i2m1 8237  ax-0lt1 8238  ax-1rid 8239  ax-0id 8240  ax-rnegex 8241  ax-precex 8242  ax-cnre 8243  ax-pre-ltirr 8244  ax-pre-ltwlin 8245  ax-pre-lttrn 8246  ax-pre-apti 8247  ax-pre-ltadd 8248  ax-pre-mulgt0 8249  ax-pre-mulext 8250  ax-arch 8251
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-po 4419  df-iso 4420  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-pnf 8315  df-mnf 8316  df-xr 8317  df-ltxr 8318  df-le 8319  df-sub 8451  df-neg 8452  df-reap 8854  df-ap 8861  df-div 8952  df-inn 9243  df-2 9301  df-3 9302  df-4 9303  df-5 9304  df-6 9305  df-7 9306  df-8 9307  df-n0 9502  df-z 9583  df-q 9958  df-rp 9993  df-ico 10233  df-fl 10637  df-mod 10692
This theorem is referenced by:  2lgslem3  16023
  Copyright terms: Public domain W3C validator