Theorem nnmaxpw 12978

Description: The function F that decomposes a number into its "odd" and "even" parts, which is to say the largest power of a base and largest divisor of the number not divisible by that base, is a bijection from pairs of a nonnegative integer and a number not divisible by that base to positive integers. (Contributed by Thierry Arnoux, 15-Aug-2017.) (Revised by Jim Kingdon, 19-Aug-2026.)

Hypotheses

Ref	Expression
nnmaxpw.j	|- J = { z e. NN | -. B || z }
nnmaxpw.f	|- F = ( x e. J , y e. NN0 |-> ( ( B ^ y ) x. x ) )

Assertion

Ref	Expression
nnmaxpw	|- ( B e. ( ZZ>= ` 2 ) -> F : ( J X. NN0 ) -1-1-onto-> NN )

Distinct variable groups:   x, y, z   x, J, y   x, B, y, z

Allowed substitution hints:   F( x, y, z)   J( z)

Proof of Theorem nnmaxpw

Dummy variable a is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nnmaxpw.f	. 2 |- F = ( x e. J , y e. NN0 |-> ( ( B ^ y ) x. x ) )
2		eluz2nn 9982	. . . . . 6 |- ( B e. ( ZZ>= ` 2 ) -> B e. NN )
3	2	adantr 276	. . . . 5 |- ( ( B e. ( ZZ>= ` 2 ) /\ ( x e. J /\ y e. NN0 ) ) -> B e. NN )
4	3	nncnd 9327	. . . 4 |- ( ( B e. ( ZZ>= ` 2 ) /\ ( x e. J /\ y e. NN0 ) ) -> B e. CC )
5		simprr 537	. . . 4 |- ( ( B e. ( ZZ>= ` 2 ) /\ ( x e. J /\ y e. NN0 ) ) -> y e. NN0 )
6	4, 5	expcld 11132	. . 3 |- ( ( B e. ( ZZ>= ` 2 ) /\ ( x e. J /\ y e. NN0 ) ) -> ( B ^ y ) e. CC )
7		breq2 4135	. . . . . . . 8 |- ( z = x -> ( B || z <-> B || x ) )
8	7	notbid 677	. . . . . . 7 |- ( z = x -> ( -. B || z <-> -. B || x ) )
9		nnmaxpw.j	. . . . . . 7 |- J = { z e. NN | -. B || z }
10	8, 9	elrab2 2985	. . . . . 6 |- ( x e. J <-> ( x e. NN /\ -. B || x ) )
11	10	simplbi 274	. . . . 5 |- ( x e. J -> x e. NN )
12	11	ad2antrl 494	. . . 4 |- ( ( B e. ( ZZ>= ` 2 ) /\ ( x e. J /\ y e. NN0 ) ) -> x e. NN )
13	12	nncnd 9327	. . 3 |- ( ( B e. ( ZZ>= ` 2 ) /\ ( x e. J /\ y e. NN0 ) ) -> x e. CC )
14	6, 13	mulcld 8352	. 2 |- ( ( B e. ( ZZ>= ` 2 ) /\ ( x e. J /\ y e. NN0 ) ) -> ( ( B ^ y ) x. x ) e. CC )
15		simpl 109	. . . . . 6 |- ( ( a e. NN /\ B e. ( ZZ>= ` 2 ) ) -> a e. NN )
16	15	nnnn0d 9631	. . . . 5 |- ( ( a e. NN /\ B e. ( ZZ>= ` 2 ) ) -> a e. NN0 )
17	2	adantl 277	. . . . . 6 |- ( ( a e. NN /\ B e. ( ZZ>= ` 2 ) ) -> B e. NN )
18		pwbdvdseu 12972	. . . . . . 7 |- ( ( a e. NN /\ B e. ( ZZ>= ` 2 ) ) -> E! z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) )
19		riotacl 6057	. . . . . . 7 |- ( E! z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) -> ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) e. NN0 )
20	18, 19	syl 14	. . . . . 6 |- ( ( a e. NN /\ B e. ( ZZ>= ` 2 ) ) -> ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) e. NN0 )
21	17, 20	nnexpcld 11154	. . . . 5 |- ( ( a e. NN /\ B e. ( ZZ>= ` 2 ) ) -> ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) e. NN )
22		nn0nndivcl 9640	. . . . 5 |- ( ( a e. NN0 /\ ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) e. NN ) -> ( a / ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) ) e. RR )
23	16, 21, 22	syl2anc 415	. . . 4 |- ( ( a e. NN /\ B e. ( ZZ>= ` 2 ) ) -> ( a / ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) ) e. RR )
24	23, 20	jca 306	. . 3 |- ( ( a e. NN /\ B e. ( ZZ>= ` 2 ) ) -> ( ( a / ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) ) e. RR /\ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) e. NN0 ) )
25	24	ancoms 268	. 2 |- ( ( B e. ( ZZ>= ` 2 ) /\ a e. NN ) -> ( ( a / ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) ) e. RR /\ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) e. NN0 ) )
26	10	anbi1i 462	. . . 4 |- ( ( x e. J /\ y e. NN0 ) <-> ( ( x e. NN /\ -. B || x ) /\ y e. NN0 ) )
27	26	anbi1i 462	. . 3 |- ( ( ( x e. J /\ y e. NN0 ) /\ a = ( ( B ^ y ) x. x ) ) <-> ( ( ( x e. NN /\ -. B || x ) /\ y e. NN0 ) /\ a = ( ( B ^ y ) x. x ) ) )
28		nnmaxpwlemparts 12977	. . 3 |- ( B e. ( ZZ>= ` 2 ) -> ( ( ( ( x e. NN /\ -. B || x ) /\ y e. NN0 ) /\ a = ( ( B ^ y ) x. x ) ) <-> ( a e. NN /\ ( x = ( a / ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) ) /\ y = ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) ) ) )
29	27, 28	bitrid 192	. 2 |- ( B e. ( ZZ>= ` 2 ) -> ( ( ( x e. J /\ y e. NN0 ) /\ a = ( ( B ^ y ) x. x ) ) <-> ( a e. NN /\ ( x = ( a / ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) ) /\ y = ( iota_ z e. NN0 ( ( B ^ z ) || a /\ -. ( B ^ ( z + 1 ) ) || a ) ) ) ) ) )
30	1, 14, 25, 29	f1od2 6475	1 |- ( B e. ( ZZ>= ` 2 ) -> F : ( J X. NN0 ) -1-1-onto-> NN )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   E!wreu 2530   {crab 2532   class class class wbr 4131   X. cxp 4774   -1-1-onto->wf1o 5379   ` cfv 5380   iota_crio 6040  (class class class)co 6088   e. cmpo 6090   CCcc 8183   RRcr 8184   1c1 8186   + caddc 8188   x. cmul 8190   / cdiv 9010   NNcn 9313   2c2 9364   NN0cn0 9574   ZZ>=cuz 9937   ^cexp 10996   || cdvds 12579

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-fz 10429  df-fl 10722  df-mod 10781  df-seqfrec 10906  df-exp 10997  df-dvds 12580

This theorem is used by:  oddpwdc  12979  zprmlogbaplem3  16217