Theorem pw2dvdseu 12685

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.

Step	Hyp	Ref	Expression
1		pw2dvds 12683	. 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 )
7	2, 3, 4, 5, 6	pw2dvdseulemle 12684	. . . . . 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 )
10	2, 4, 3, 8, 9	pw2dvdseulemle 12684	. . . . . 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 )
11	3	nn0red 9419	. . . . . . 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 )
12	4	nn0red 9419	. . . . . . 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 )
13	11, 12	letri3d 8258	. . . . . 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 ) ) )
14	7, 10, 13	mpbir2and 950	. . . . 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 )
15	14	ex 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 ) )
16	15	ralrimivva 2612	. . 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 6008	. . . . . 6 |- ( m = x -> ( 2 ^ m ) = ( 2 ^ x ) )
18	17	breq1d 4092	. . . . 5 |- ( m = x -> ( ( 2 ^ m ) || N <-> ( 2 ^ x ) || N ) )
19		oveq1 6007	. . . . . . . 8 |- ( m = x -> ( m + 1 ) = ( x + 1 ) )
20	19	oveq2d 6016	. . . . . . 7 |- ( m = x -> ( 2 ^ ( m + 1 ) ) = ( 2 ^ ( x + 1 ) ) )
21	20	breq1d 4092	. . . . . 6 |- ( m = x -> ( ( 2 ^ ( m + 1 ) ) || N <-> ( 2 ^ ( x + 1 ) ) || N ) )
22	21	notbid 671	. . . . 5 |- ( m = x -> ( -. ( 2 ^ ( m + 1 ) ) || N <-> -. ( 2 ^ ( x + 1 ) ) || N ) )
23	18, 22	anbi12d 473	. . . 4 |- ( m = x -> ( ( ( 2 ^ m ) || N /\ -. ( 2 ^ ( m + 1 ) ) || N ) <-> ( ( 2 ^ x ) || N /\ -. ( 2 ^ ( x + 1 ) ) || N ) ) )
24	23	rmo4 2996	. . 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 ) )
25	16, 24	sylibr 134	. 2 |- ( N e. NN -> E* m e. NN0 ( ( 2 ^ m ) || N /\ -. ( 2 ^ ( m + 1 ) ) || N ) )
26		reu5 2749	. 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 ) ) )
27	1, 25, 26	sylanbrc 417	1 |- ( N e. NN -> E! m e. NN0 ( ( 2 ^ m ) || N /\ -. ( 2 ^ ( m + 1 ) ) || N ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   e. wcel 2200   A.wral 2508   E.wrex 2509   E!wreu 2510   E*wrmo 2511   class class class wbr 4082  (class class class)co 6000   1c1 7996   + caddc 7998   <_ cle 8178   NNcn 9106   2c2 9157   NN0cn0 9365   ^cexp 10755   || cdvds 12293

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-coll 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-mulrcl 8094  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-precex 8105  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111  ax-pre-mulgt0 8112  ax-pre-mulext 8113  ax-arch 8114

This theorem depends on definitions:  df-bi 117  df-dc 840  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 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-po 4386  df-iso 4387  df-iord 4456  df-on 4458  df-ilim 4459  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-frec 6535  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-reap 8718  df-ap 8725  df-div 8816  df-inn 9107  df-2 9165  df-n0 9366  df-z 9443  df-uz 9719  df-q 9811  df-rp 9846  df-fz 10201  df-fl 10485  df-mod 10540  df-seqfrec 10665  df-exp 10756  df-dvds 12294

This theorem is referenced by:  oddpwdclemxy  12686  oddpwdclemdvds  12687  oddpwdclemndvds  12688  oddpwdclemodd  12689  oddpwdclemdc  12690  oddpwdc  12691