Theorem pw2dvdseu 12739

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 12737	. 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 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 ) ) ) -> m e. NN0 )
4		simplrr 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 ) ) ) -> x e. NN0 )
5		simprll 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 ^ m ) || N )
6		simprrr 542	. . . . . . 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 12738	. . . . . 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 541	. . . . . . 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 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 ^ ( m + 1 ) ) || N )
10	2, 4, 3, 8, 9	pw2dvdseulemle 12738	. . . . . 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 9455	. . . . . . 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 9455	. . . . . . 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 8294	. . . . . 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 952	. . . . 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 2614	. . 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 6025	. . . . . 6 |- ( m = x -> ( 2 ^ m ) = ( 2 ^ x ) )
18	17	breq1d 4098	. . . . 5 |- ( m = x -> ( ( 2 ^ m ) || N <-> ( 2 ^ x ) || N ) )
19		oveq1 6024	. . . . . . . 8 |- ( m = x -> ( m + 1 ) = ( x + 1 ) )
20	19	oveq2d 6033	. . . . . . 7 |- ( m = x -> ( 2 ^ ( m + 1 ) ) = ( 2 ^ ( x + 1 ) ) )
21	20	breq1d 4098	. . . . . 6 |- ( m = x -> ( ( 2 ^ ( m + 1 ) ) || N <-> ( 2 ^ ( x + 1 ) ) || N ) )
22	21	notbid 673	. . . . 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 2999	. . 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 2751	. 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 2202   A.wral 2510   E.wrex 2511   E!wreu 2512   E*wrmo 2513   class class class wbr 4088  (class class class)co 6017   1c1 8032   + caddc 8034   <_ cle 8214   NNcn 9142   2c2 9193   NN0cn0 9401   ^cexp 10799   || cdvds 12347

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149  ax-arch 8150

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-2 9201  df-n0 9402  df-z 9479  df-uz 9755  df-q 9853  df-rp 9888  df-fz 10243  df-fl 10529  df-mod 10584  df-seqfrec 10709  df-exp 10800  df-dvds 12348

This theorem is referenced by:  oddpwdclemxy  12740  oddpwdclemdvds  12741  oddpwdclemndvds  12742  oddpwdclemodd  12743  oddpwdclemdc  12744  oddpwdc  12745