Theorem nnmaxpwlemxy 12973

Description: Lemma for nnmaxpw 12978. Another way of stating that decomposing a natural number into a power of a base and a number not divisible by that base is unique. (Contributed by Jim Kingdon, 16-Nov-2021.) (Revised by Jim Kingdon, 18-Aug-2026.)

Hypotheses

Ref	Expression
nnmaxpwlemxy.x	|- ( ph -> X e. NN )
nnmaxpwlemxy.b	|- ( ph -> B e. ( ZZ>= ` 2 ) )
nnmaxpwlemxy.bx	|- ( ph -> -. B || X )
nnmaxpwlemxy.y	|- ( ph -> Y e. NN0 )
nnmaxpwlemxy.ayx	|- ( ph -> A = ( ( B ^ Y ) x. X ) )

Assertion

Ref	Expression
nnmaxpwlemxy	|- ( ph -> ( 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 ) ) ) )

Distinct variable groups:   z, A   z, B   z, Y

Allowed substitution hints:   ph( z)   X( z)

Proof of Theorem nnmaxpwlemxy

Step	Hyp	Ref	Expression
1		nnmaxpwlemxy.b	. . . . . 6 |- ( ph -> B e. ( ZZ>= ` 2 ) )
2		eluz2nn 9982	. . . . . 6 |- ( B e. ( ZZ>= ` 2 ) -> B e. NN )
3	1, 2	syl 14	. . . . 5 |- ( ph -> B e. NN )
4		nnmaxpwlemxy.x	. . . . . . . . 9 |- ( ph -> X e. NN )
5	4	nnzd 9778	. . . . . . . 8 |- ( ph -> X e. ZZ )
6		nnmaxpwlemxy.y	. . . . . . . . . 10 |- ( ph -> Y e. NN0 )
7	3, 6	nnexpcld 11154	. . . . . . . . 9 |- ( ph -> ( B ^ Y ) e. NN )
8	7	nnzd 9778	. . . . . . . 8 |- ( ph -> ( B ^ Y ) e. ZZ )
9		nnmaxpwlemxy.ayx	. . . . . . . . . 10 |- ( ph -> A = ( ( B ^ Y ) x. X ) )
10	7, 4	nnmulcld 9362	. . . . . . . . . 10 |- ( ph -> ( ( B ^ Y ) x. X ) e. NN )
11	9, 10	eqeltrd 2315	. . . . . . . . 9 |- ( ph -> A e. NN )
12	11	nnzd 9778	. . . . . . . 8 |- ( ph -> A e. ZZ )
13	7	nncnd 9327	. . . . . . . . . 10 |- ( ph -> ( B ^ Y ) e. CC )
14	4	nncnd 9327	. . . . . . . . . 10 |- ( ph -> X e. CC )
15	13, 14	mulcomd 8353	. . . . . . . . 9 |- ( ph -> ( ( B ^ Y ) x. X ) = ( X x. ( B ^ Y ) ) )
16	9, 15	eqtr2d 2272	. . . . . . . 8 |- ( ph -> ( X x. ( B ^ Y ) ) = A )
17		dvds0lem 12593	. . . . . . . 8 |- ( ( ( X e. ZZ /\ ( B ^ Y ) e. ZZ /\ A e. ZZ ) /\ ( X x. ( B ^ Y ) ) = A ) -> ( B ^ Y ) || A )
18	5, 8, 12, 16, 17	syl31anc 1281	. . . . . . 7 |- ( ph -> ( B ^ Y ) || A )
19		nnmaxpwlemxy.bx	. . . . . . . . 9 |- ( ph -> -. B || X )
20	9	breq2d 4143	. . . . . . . . . 10 |- ( ph -> ( ( ( B ^ Y ) x. B ) || A <-> ( ( B ^ Y ) x. B ) || ( ( B ^ Y ) x. X ) ) )
21	3	nnzd 9778	. . . . . . . . . . 11 |- ( ph -> B e. ZZ )
22	7	nnne0d 9358	. . . . . . . . . . 11 |- ( ph -> ( B ^ Y ) =/= 0 )
23		dvdscmulr 12612	. . . . . . . . . . 11 |- ( ( B e. ZZ /\ X e. ZZ /\ ( ( B ^ Y ) e. ZZ /\ ( B ^ Y ) =/= 0 ) ) -> ( ( ( B ^ Y ) x. B ) || ( ( B ^ Y ) x. X ) <-> B || X ) )
24	21, 5, 8, 22, 23	syl112anc 1282	. . . . . . . . . 10 |- ( ph -> ( ( ( B ^ Y ) x. B ) || ( ( B ^ Y ) x. X ) <-> B || X ) )
25	20, 24	bitrd 188	. . . . . . . . 9 |- ( ph -> ( ( ( B ^ Y ) x. B ) || A <-> B || X ) )
26	19, 25	mtbird 684	. . . . . . . 8 |- ( ph -> -. ( ( B ^ Y ) x. B ) || A )
27	3	nncnd 9327	. . . . . . . . . 10 |- ( ph -> B e. CC )
28	27, 6	expp1d 11133	. . . . . . . . 9 |- ( ph -> ( B ^ ( Y + 1 ) ) = ( ( B ^ Y ) x. B ) )
29	28	breq1d 4141	. . . . . . . 8 |- ( ph -> ( ( B ^ ( Y + 1 ) ) || A <-> ( ( B ^ Y ) x. B ) || A ) )
30	26, 29	mtbird 684	. . . . . . 7 |- ( ph -> -. ( B ^ ( Y + 1 ) ) || A )
31		pwbdvdseu 12972	. . . . . . . . 9 |- ( ( A e. NN /\ B e. ( ZZ>= ` 2 ) ) -> E! z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) )
32	11, 1, 31	syl2anc 415	. . . . . . . 8 |- ( ph -> E! z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) )
33		oveq2 6096	. . . . . . . . . . 11 |- ( z = Y -> ( B ^ z ) = ( B ^ Y ) )
34	33	breq1d 4141	. . . . . . . . . 10 |- ( z = Y -> ( ( B ^ z ) || A <-> ( B ^ Y ) || A ) )
35		oveq1 6095	. . . . . . . . . . . . 13 |- ( z = Y -> ( z + 1 ) = ( Y + 1 ) )
36	35	oveq2d 6104	. . . . . . . . . . . 12 |- ( z = Y -> ( B ^ ( z + 1 ) ) = ( B ^ ( Y + 1 ) ) )
37	36	breq1d 4141	. . . . . . . . . . 11 |- ( z = Y -> ( ( B ^ ( z + 1 ) ) || A <-> ( B ^ ( Y + 1 ) ) || A ) )
38	37	notbid 677	. . . . . . . . . 10 |- ( z = Y -> ( -. ( B ^ ( z + 1 ) ) || A <-> -. ( B ^ ( Y + 1 ) ) || A ) )
39	34, 38	anbi12d 477	. . . . . . . . 9 |- ( z = Y -> ( ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) <-> ( ( B ^ Y ) || A /\ -. ( B ^ ( Y + 1 ) ) || A ) ) )
40	39	riota2 6065	. . . . . . . 8 |- ( ( Y e. NN0 /\ E! z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) -> ( ( ( B ^ Y ) || A /\ -. ( B ^ ( Y + 1 ) ) || A ) <-> ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) = Y ) )
41	6, 32, 40	syl2anc 415	. . . . . . 7 |- ( ph -> ( ( ( B ^ Y ) || A /\ -. ( B ^ ( Y + 1 ) ) || A ) <-> ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) = Y ) )
42	18, 30, 41	mpbi2and 956	. . . . . 6 |- ( ph -> ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) = Y )
43	42, 6	eqeltrd 2315	. . . . 5 |- ( ph -> ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) e. NN0 )
44	3, 43	nnexpcld 11154	. . . 4 |- ( ph -> ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) ) e. NN )
45	44	nncnd 9327	. . 3 |- ( ph -> ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) ) e. CC )
46	44	nnap0d 9359	. . 3 |- ( ph -> ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) ) # 0 )
47	42	eqcomd 2244	. . . . . 6 |- ( ph -> Y = ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) )
48	47	oveq2d 6104	. . . . 5 |- ( ph -> ( B ^ Y ) = ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) ) )
49	48	oveq1d 6103	. . . 4 |- ( ph -> ( ( B ^ Y ) x. X ) = ( ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) ) x. X ) )
50	9, 49	eqtr2d 2272	. . 3 |- ( ph -> ( ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) ) x. X ) = A )
51	45, 14, 46, 50	mvllmulapd 9180	. 2 |- ( ph -> X = ( A / ( B ^ ( iota_ z e. NN0 ( ( B ^ z ) || A /\ -. ( B ^ ( z + 1 ) ) || A ) ) ) ) )
52	51, 47	jca 306	1 |- ( ph -> ( 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 ) ) ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   =/= wne 2420   E!wreu 2530   class class class wbr 4131   ` cfv 5380   iota_crio 6040  (class class class)co 6088   0cc0 8185   1c1 8186   + caddc 8188   x. cmul 8190   / cdiv 9010   NNcn 9313   2c2 9364   NN0cn0 9574   ZZcz 9655   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:  nnmaxpwlemparts  12977