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

Theorem pw2dvdseu 12309
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 12307 . 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 12308 . . . . . 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 12308 . . . . . 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 9297 . . . . . . 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 9297 . . . . . . 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 8137 . . . . . 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 946 . . . . 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 2576 . . 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 5927 . . . . . 6  |-  ( m  =  x  ->  (
2 ^ m )  =  ( 2 ^ x ) )
1817breq1d 4040 . . . . 5  |-  ( m  =  x  ->  (
( 2 ^ m
)  ||  N  <->  ( 2 ^ x )  ||  N ) )
19 oveq1 5926 . . . . . . . 8  |-  ( m  =  x  ->  (
m  +  1 )  =  ( x  + 
1 ) )
2019oveq2d 5935 . . . . . . 7  |-  ( m  =  x  ->  (
2 ^ ( m  +  1 ) )  =  ( 2 ^ ( x  +  1 ) ) )
2120breq1d 4040 . . . . . 6  |-  ( m  =  x  ->  (
( 2 ^ (
m  +  1 ) )  ||  N  <->  ( 2 ^ ( x  + 
1 ) )  ||  N ) )
2221notbid 668 . . . . 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 2954 . . 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 2711 . 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 2164   A.wral 2472   E.wrex 2473   E!wreu 2474   E*wrmo 2475   class class class wbr 4030  (class class class)co 5919   1c1 7875    + caddc 7877    <_ cle 8057   NNcn 8984   2c2 9035   NN0cn0 9243   ^cexp 10612    || cdvds 11933
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-mulrcl 7973  ax-addcom 7974  ax-mulcom 7975  ax-addass 7976  ax-mulass 7977  ax-distr 7978  ax-i2m1 7979  ax-0lt1 7980  ax-1rid 7981  ax-0id 7982  ax-rnegex 7983  ax-precex 7984  ax-cnre 7985  ax-pre-ltirr 7986  ax-pre-ltwlin 7987  ax-pre-lttrn 7988  ax-pre-apti 7989  ax-pre-ltadd 7990  ax-pre-mulgt0 7991  ax-pre-mulext 7992  ax-arch 7993
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-po 4328  df-iso 4329  df-iord 4398  df-on 4400  df-ilim 4401  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-frec 6446  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062  df-sub 8194  df-neg 8195  df-reap 8596  df-ap 8603  df-div 8694  df-inn 8985  df-2 9043  df-n0 9244  df-z 9321  df-uz 9596  df-q 9688  df-rp 9723  df-fz 10078  df-fl 10342  df-mod 10397  df-seqfrec 10522  df-exp 10613  df-dvds 11934
This theorem is referenced by:  oddpwdclemxy  12310  oddpwdclemdvds  12311  oddpwdclemndvds  12312  oddpwdclemodd  12313  oddpwdclemdc  12314  oddpwdc  12315
  Copyright terms: Public domain W3C validator