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

Theorem 2lgslem3d1 15822
Description: Lemma 4 for 2lgslem3 15823. (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 9402 . . . 4  |-  ( P  e.  NN  ->  P  e.  NN0 )
2 8nn 9304 . . . . 5  |-  8  e.  NN
3 nnq 9860 . . . . 5  |-  ( 8  e.  NN  ->  8  e.  QQ )
42, 3mp1i 10 . . . 4  |-  ( P  e.  NN  ->  8  e.  QQ )
52nngt0i 9166 . . . . 5  |-  0  <  8
65a1i 9 . . . 4  |-  ( P  e.  NN  ->  0  <  8 )
7 modqmuladdnn0 10623 . . . 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 1271 . . 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 9405 . . . . . . . . . . 11  |-  ( k  e.  NN0  ->  k  e.  CC )
11 8cn 9222 . . . . . . . . . . . 12  |-  8  e.  CC
1211a1i 9 . . . . . . . . . . 11  |-  ( k  e.  NN0  ->  8  e.  CC )
1310, 12mulcomd 8194 . . . . . . . . . 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 6028 . . . . . . . 8  |-  ( ( P  e.  NN  /\  k  e.  NN0 )  -> 
( ( k  x.  8 )  +  7 )  =  ( ( 8  x.  k )  +  7 ) )
1615eqeq2d 2241 . . . . . . 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 15818 . . . . . 6  |-  ( ( k  e.  NN0  /\  P  =  ( (
8  x.  k )  +  7 ) )  ->  N  =  ( ( 2  x.  k
)  +  2 ) )
209, 17, 19syl2an2r 597 . . . . 5  |-  ( ( ( P  e.  NN  /\  k  e.  NN0 )  /\  P  =  (
( k  x.  8 )  +  7 ) )  ->  N  =  ( ( 2  x.  k )  +  2 ) )
21 oveq1 6020 . . . . . 6  |-  ( N  =  ( ( 2  x.  k )  +  2 )  ->  ( N  mod  2 )  =  ( ( ( 2  x.  k )  +  2 )  mod  2
) )
22 2t1e2 9290 . . . . . . . . . . . 12  |-  ( 2  x.  1 )  =  2
2322eqcomi 2233 . . . . . . . . . . 11  |-  2  =  ( 2  x.  1 )
2423a1i 9 . . . . . . . . . 10  |-  ( k  e.  NN0  ->  2  =  ( 2  x.  1 ) )
2524oveq2d 6029 . . . . . . . . 9  |-  ( k  e.  NN0  ->  ( ( 2  x.  k )  +  2 )  =  ( ( 2  x.  k )  +  ( 2  x.  1 ) ) )
26 2cnd 9209 . . . . . . . . . 10  |-  ( k  e.  NN0  ->  2  e.  CC )
27 1cnd 8188 . . . . . . . . . 10  |-  ( k  e.  NN0  ->  1  e.  CC )
28 adddi 8157 . . . . . . . . . . 11  |-  ( ( 2  e.  CC  /\  k  e.  CC  /\  1  e.  CC )  ->  (
2  x.  ( k  +  1 ) )  =  ( ( 2  x.  k )  +  ( 2  x.  1 ) ) )
2928eqcomd 2235 . . . . . . . . . 10  |-  ( ( 2  e.  CC  /\  k  e.  CC  /\  1  e.  CC )  ->  (
( 2  x.  k
)  +  ( 2  x.  1 ) )  =  ( 2  x.  ( k  +  1 ) ) )
3026, 10, 27, 29syl3anc 1271 . . . . . . . . 9  |-  ( k  e.  NN0  ->  ( ( 2  x.  k )  +  ( 2  x.  1 ) )  =  ( 2  x.  (
k  +  1 ) ) )
3110, 27addcld 8192 . . . . . . . . . 10  |-  ( k  e.  NN0  ->  ( k  +  1 )  e.  CC )
3226, 31mulcomd 8194 . . . . . . . . 9  |-  ( k  e.  NN0  ->  ( 2  x.  ( k  +  1 ) )  =  ( ( k  +  1 )  x.  2 ) )
3325, 30, 323eqtrd 2266 . . . . . . . 8  |-  ( k  e.  NN0  ->  ( ( 2  x.  k )  +  2 )  =  ( ( k  +  1 )  x.  2 ) )
3433oveq1d 6028 . . . . . . 7  |-  ( k  e.  NN0  ->  ( ( ( 2  x.  k
)  +  2 )  mod  2 )  =  ( ( ( k  +  1 )  x.  2 )  mod  2
) )
35 peano2nn0 9435 . . . . . . . . 9  |-  ( k  e.  NN0  ->  ( k  +  1 )  e. 
NN0 )
3635nn0zd 9593 . . . . . . . 8  |-  ( k  e.  NN0  ->  ( k  +  1 )  e.  ZZ )
37 2nn 9298 . . . . . . . . 9  |-  2  e.  NN
38 nnq 9860 . . . . . . . . 9  |-  ( 2  e.  NN  ->  2  e.  QQ )
3937, 38mp1i 10 . . . . . . . 8  |-  ( k  e.  NN0  ->  2  e.  QQ )
4037nngt0i 9166 . . . . . . . . 9  |-  0  <  2
4140a1i 9 . . . . . . . 8  |-  ( k  e.  NN0  ->  0  <  2 )
42 mulqmod0 10585 . . . . . . . 8  |-  ( ( ( k  +  1 )  e.  ZZ  /\  2  e.  QQ  /\  0  <  2 )  ->  (
( ( k  +  1 )  x.  2 )  mod  2 )  =  0 )
4336, 39, 41, 42syl3anc 1271 . . . . . . 7  |-  ( k  e.  NN0  ->  ( ( ( k  +  1 )  x.  2 )  mod  2 )  =  0 )
4434, 43eqtrd 2262 . . . . . 6  |-  ( k  e.  NN0  ->  ( ( ( 2  x.  k
)  +  2 )  mod  2 )  =  0 )
4521, 44sylan9eqr 2284 . . . . 5  |-  ( ( k  e.  NN0  /\  N  =  ( (
2  x.  k )  +  2 ) )  ->  ( N  mod  2 )  =  0 )
469, 20, 45syl2an2r 597 . . . 4  |-  ( ( ( P  e.  NN  /\  k  e.  NN0 )  /\  P  =  (
( k  x.  8 )  +  7 ) )  ->  ( N  mod  2 )  =  0 )
4746rexlimdva2 2651 . . 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 1002    = wceq 1395    e. wcel 2200   E.wrex 2509   class class class wbr 4086   ` cfv 5324  (class class class)co 6013   CCcc 8023   0cc0 8025   1c1 8026    + caddc 8028    x. cmul 8030    < clt 8207    - cmin 8343    / cdiv 8845   NNcn 9136   2c2 9187   4c4 9189   7c7 9192   8c8 9193   NN0cn0 9395   ZZcz 9472   QQcq 9846   |_cfl 10521    mod cmo 10577
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-mulrcl 8124  ax-addcom 8125  ax-mulcom 8126  ax-addass 8127  ax-mulass 8128  ax-distr 8129  ax-i2m1 8130  ax-0lt1 8131  ax-1rid 8132  ax-0id 8133  ax-rnegex 8134  ax-precex 8135  ax-cnre 8136  ax-pre-ltirr 8137  ax-pre-ltwlin 8138  ax-pre-lttrn 8139  ax-pre-apti 8140  ax-pre-ltadd 8141  ax-pre-mulgt0 8142  ax-pre-mulext 8143  ax-arch 8144
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-po 4391  df-iso 4392  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-pnf 8209  df-mnf 8210  df-xr 8211  df-ltxr 8212  df-le 8213  df-sub 8345  df-neg 8346  df-reap 8748  df-ap 8755  df-div 8846  df-inn 9137  df-2 9195  df-3 9196  df-4 9197  df-5 9198  df-6 9199  df-7 9200  df-8 9201  df-n0 9396  df-z 9473  df-q 9847  df-rp 9882  df-ico 10122  df-fl 10523  df-mod 10578
This theorem is referenced by:  2lgslem3  15823
  Copyright terms: Public domain W3C validator