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

Theorem pw2dvdseu 12490
Description: A natural number has a unique highest power of two which divides it. (Contributed by Jim Kingdon, 16-Nov-2021.)
Assertion
Ref Expression
pw2dvdseu  |-  ( N  e.  NN  ->  E! m  e.  NN0  ( ( 2 ^ m ) 
||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N ) )
Distinct variable group:    m, N

Proof of Theorem pw2dvdseu
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 pw2dvds 12488 . 2  |-  ( N  e.  NN  ->  E. m  e.  NN0  ( ( 2 ^ m )  ||  N  /\  -.  ( 2 ^ ( m  + 
1 ) )  ||  N ) )
2 simpll 527 . . . . . . 7  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  N  e.  NN )
3 simplrl 535 . . . . . . 7  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  m  e.  NN0 )
4 simplrr 536 . . . . . . 7  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  x  e.  NN0 )
5 simprll 537 . . . . . . 7  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  ( 2 ^ m )  ||  N
)
6 simprrr 540 . . . . . . 7  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  -.  ( 2 ^ ( x  + 
1 ) )  ||  N )
72, 3, 4, 5, 6pw2dvdseulemle 12489 . . . . . 6  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  m  <_  x
)
8 simprrl 539 . . . . . . 7  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  ( 2 ^ x )  ||  N
)
9 simprlr 538 . . . . . . 7  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  -.  ( 2 ^ ( m  + 
1 ) )  ||  N )
102, 4, 3, 8, 9pw2dvdseulemle 12489 . . . . . 6  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  x  <_  m
)
113nn0red 9349 . . . . . . 7  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  m  e.  RR )
124nn0red 9349 . . . . . . 7  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  x  e.  RR )
1311, 12letri3d 8188 . . . . . 6  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  ( m  =  x  <->  ( m  <_  x  /\  x  <_  m
) ) )
147, 10, 13mpbir2and 947 . . . . 5  |-  ( ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  /\  ( (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )  ->  m  =  x )
1514ex 115 . . . 4  |-  ( ( N  e.  NN  /\  ( m  e.  NN0  /\  x  e.  NN0 )
)  ->  ( (
( ( 2 ^ m )  ||  N  /\  -.  ( 2 ^ ( m  +  1 ) )  ||  N
)  /\  ( (
2 ^ x ) 
||  N  /\  -.  ( 2 ^ (
x  +  1 ) )  ||  N ) )  ->  m  =  x ) )
1615ralrimivva 2588 . . 3  |-  ( N  e.  NN  ->  A. m  e.  NN0  A. x  e. 
NN0  ( ( ( ( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  /\  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) )  ->  m  =  x )
)
17 oveq2 5952 . . . . . 6  |-  ( m  =  x  ->  (
2 ^ m )  =  ( 2 ^ x ) )
1817breq1d 4054 . . . . 5  |-  ( m  =  x  ->  (
( 2 ^ m
)  ||  N  <->  ( 2 ^ x )  ||  N ) )
19 oveq1 5951 . . . . . . . 8  |-  ( m  =  x  ->  (
m  +  1 )  =  ( x  + 
1 ) )
2019oveq2d 5960 . . . . . . 7  |-  ( m  =  x  ->  (
2 ^ ( m  +  1 ) )  =  ( 2 ^ ( x  +  1 ) ) )
2120breq1d 4054 . . . . . 6  |-  ( m  =  x  ->  (
( 2 ^ (
m  +  1 ) )  ||  N  <->  ( 2 ^ ( x  + 
1 ) )  ||  N ) )
2221notbid 669 . . . . 5  |-  ( m  =  x  ->  ( -.  ( 2 ^ (
m  +  1 ) )  ||  N  <->  -.  (
2 ^ ( x  +  1 ) ) 
||  N ) )
2318, 22anbi12d 473 . . . 4  |-  ( m  =  x  ->  (
( ( 2 ^ m )  ||  N  /\  -.  ( 2 ^ ( m  +  1 ) )  ||  N
)  <->  ( ( 2 ^ x )  ||  N  /\  -.  ( 2 ^ ( x  + 
1 ) )  ||  N ) ) )
2423rmo4 2966 . . 3  |-  ( E* m  e.  NN0  (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  <->  A. m  e.  NN0  A. x  e.  NN0  (
( ( ( 2 ^ m )  ||  N  /\  -.  ( 2 ^ ( m  + 
1 ) )  ||  N )  /\  (
( 2 ^ x
)  ||  N  /\  -.  ( 2 ^ (
x  +  1 ) )  ||  N ) )  ->  m  =  x ) )
2516, 24sylibr 134 . 2  |-  ( N  e.  NN  ->  E* m  e.  NN0  ( ( 2 ^ m ) 
||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N ) )
26 reu5 2723 . 2  |-  ( E! m  e.  NN0  (
( 2 ^ m
)  ||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N )  <-> 
( E. m  e. 
NN0  ( ( 2 ^ m )  ||  N  /\  -.  ( 2 ^ ( m  + 
1 ) )  ||  N )  /\  E* m  e.  NN0  ( ( 2 ^ m ) 
||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N ) ) )
271, 25, 26sylanbrc 417 1  |-  ( N  e.  NN  ->  E! m  e.  NN0  ( ( 2 ^ m ) 
||  N  /\  -.  ( 2 ^ (
m  +  1 ) )  ||  N ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    e. wcel 2176   A.wral 2484   E.wrex 2485   E!wreu 2486   E*wrmo 2487   class class class wbr 4044  (class class class)co 5944   1c1 7926    + caddc 7928    <_ cle 8108   NNcn 9036   2c2 9087   NN0cn0 9295   ^cexp 10683    || cdvds 12098
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 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-mulrcl 8024  ax-addcom 8025  ax-mulcom 8026  ax-addass 8027  ax-mulass 8028  ax-distr 8029  ax-i2m1 8030  ax-0lt1 8031  ax-1rid 8032  ax-0id 8033  ax-rnegex 8034  ax-precex 8035  ax-cnre 8036  ax-pre-ltirr 8037  ax-pre-ltwlin 8038  ax-pre-lttrn 8039  ax-pre-apti 8040  ax-pre-ltadd 8041  ax-pre-mulgt0 8042  ax-pre-mulext 8043  ax-arch 8044
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-if 3572  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-id 4340  df-po 4343  df-iso 4344  df-iord 4413  df-on 4415  df-ilim 4416  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-frec 6477  df-pnf 8109  df-mnf 8110  df-xr 8111  df-ltxr 8112  df-le 8113  df-sub 8245  df-neg 8246  df-reap 8648  df-ap 8655  df-div 8746  df-inn 9037  df-2 9095  df-n0 9296  df-z 9373  df-uz 9649  df-q 9741  df-rp 9776  df-fz 10131  df-fl 10413  df-mod 10468  df-seqfrec 10593  df-exp 10684  df-dvds 12099
This theorem is referenced by:  oddpwdclemxy  12491  oddpwdclemdvds  12492  oddpwdclemndvds  12493  oddpwdclemodd  12494  oddpwdclemdc  12495  oddpwdc  12496
  Copyright terms: Public domain W3C validator