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

Theorem zprmlogbaplem3 16136
Description: Lemma for zprmlogbap 16137. Decomposing a natural number into a power of a prime base and a factor not divisible by that prime. (Contributed by Jim Kingdon, 20-Aug-2026.)
Hypotheses
Ref Expression
zprmlogbaplem3.j  |-  J  =  { z  e.  NN  |  -.  B  ||  z }
zprmlogbaplem3.f  |-  F  =  ( x  e.  J ,  y  e.  NN0  |->  ( ( B ^
y )  x.  x
) )
Assertion
Ref Expression
zprmlogbaplem3  |-  ( ( X  e.  NN  /\  B  e.  Prime )  ->  E. m  e.  NN  E. a  e.  NN0  ( -.  B  ||  m  /\  X  =  ( ( B ^ a )  x.  m ) ) )
Distinct variable groups:    B, a, m   
x, B, y, z    F, a, m    x, F, y, z    x, J, y    X, a, m    x, X, y, z
Allowed substitution hints:    J( z,  m,  a)

Proof of Theorem zprmlogbaplem3
StepHypRef Expression
1 prmuz2 12926 . . . . . . . . 9  |-  ( B  e.  Prime  ->  B  e.  ( ZZ>= `  2 )
)
2 zprmlogbaplem3.j . . . . . . . . . 10  |-  J  =  { z  e.  NN  |  -.  B  ||  z }
3 zprmlogbaplem3.f . . . . . . . . . 10  |-  F  =  ( x  e.  J ,  y  e.  NN0  |->  ( ( B ^
y )  x.  x
) )
42, 3nnmaxpw 12969 . . . . . . . . 9  |-  ( B  e.  ( ZZ>= `  2
)  ->  F :
( J  X.  NN0 )
-1-1-onto-> NN )
51, 4syl 14 . . . . . . . 8  |-  ( B  e.  Prime  ->  F :
( J  X.  NN0 )
-1-1-onto-> NN )
6 simpl 109 . . . . . . . 8  |-  ( ( X  e.  NN  /\  B  e.  Prime )  ->  X  e.  NN )
7 f1ocnvdm 5987 . . . . . . . 8  |-  ( ( F : ( J  X.  NN0 ) -1-1-onto-> NN  /\  X  e.  NN )  ->  ( `' F `  X )  e.  ( J  X.  NN0 )
)
85, 6, 7syl2an2 602 . . . . . . 7  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( `' F `  X )  e.  ( J  X.  NN0 )
)
9 elxp6 6403 . . . . . . 7  |-  ( ( `' F `  X )  e.  ( J  X.  NN0 )  <->  ( ( `' F `  X )  =  <. ( 1st `  ( `' F `  X ) ) ,  ( 2nd `  ( `' F `  X ) ) >.  /\  ( ( 1st `  ( `' F `  X ) )  e.  J  /\  ( 2nd `  ( `' F `  X ) )  e.  NN0 )
) )
108, 9sylib 122 . . . . . 6  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( ( `' F `  X )  =  <. ( 1st `  ( `' F `  X ) ) ,  ( 2nd `  ( `' F `  X ) ) >.  /\  ( ( 1st `  ( `' F `  X ) )  e.  J  /\  ( 2nd `  ( `' F `  X ) )  e.  NN0 )
) )
1110simprd 114 . . . . 5  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( ( 1st `  ( `' F `  X ) )  e.  J  /\  ( 2nd `  ( `' F `  X ) )  e.  NN0 )
)
1211simpld 112 . . . 4  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( 1st `  ( `' F `  X ) )  e.  J )
13 breq2 4134 . . . . . 6  |-  ( z  =  ( 1st `  ( `' F `  X ) )  ->  ( B  ||  z  <->  B  ||  ( 1st `  ( `' F `  X ) ) ) )
1413notbid 677 . . . . 5  |-  ( z  =  ( 1st `  ( `' F `  X ) )  ->  ( -.  B  ||  z  <->  -.  B  ||  ( 1st `  ( `' F `  X ) ) ) )
1514, 2elrab2 2985 . . . 4  |-  ( ( 1st `  ( `' F `  X ) )  e.  J  <->  ( ( 1st `  ( `' F `  X ) )  e.  NN  /\  -.  B  ||  ( 1st `  ( `' F `  X ) ) ) )
1612, 15sylib 122 . . 3  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( ( 1st `  ( `' F `  X ) )  e.  NN  /\  -.  B  ||  ( 1st `  ( `' F `  X ) ) ) )
1716simpld 112 . 2  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( 1st `  ( `' F `  X ) )  e.  NN )
1811simprd 114 . 2  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( 2nd `  ( `' F `  X ) )  e.  NN0 )
1916simprd 114 . 2  |-  ( ( X  e.  NN  /\  B  e.  Prime )  ->  -.  B  ||  ( 1st `  ( `' F `  X ) ) )
2010simpld 112 . . . . 5  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( `' F `  X )  =  <. ( 1st `  ( `' F `  X ) ) ,  ( 2nd `  ( `' F `  X ) ) >.
)
2120fveq2d 5699 . . . 4  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( F `  ( `' F `  X ) )  =  ( F `
 <. ( 1st `  ( `' F `  X ) ) ,  ( 2nd `  ( `' F `  X ) ) >.
) )
22 df-ov 6088 . . . 4  |-  ( ( 1st `  ( `' F `  X ) ) F ( 2nd `  ( `' F `  X ) ) )  =  ( F `  <. ( 1st `  ( `' F `  X ) ) ,  ( 2nd `  ( `' F `  X ) ) >.
)
2321, 22eqtr4di 2289 . . 3  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( F `  ( `' F `  X ) )  =  ( ( 1st `  ( `' F `  X ) ) F ( 2nd `  ( `' F `  X ) ) ) )
24 f1ocnvfv2 5984 . . . 4  |-  ( ( F : ( J  X.  NN0 ) -1-1-onto-> NN  /\  X  e.  NN )  ->  ( F `  ( `' F `  X ) )  =  X )
255, 6, 24syl2an2 602 . . 3  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( F `  ( `' F `  X ) )  =  X )
26 prmnn 12904 . . . . . 6  |-  ( B  e.  Prime  ->  B  e.  NN )
27 nnexpcl 11002 . . . . . 6  |-  ( ( B  e.  NN  /\  ( 2nd `  ( `' F `  X ) )  e.  NN0 )  ->  ( B ^ ( 2nd `  ( `' F `  X ) ) )  e.  NN )
2826, 18, 27syl2an2 602 . . . . 5  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( B ^ ( 2nd `  ( `' F `  X ) ) )  e.  NN )
2928, 17nnmulcld 9355 . . . 4  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( ( B ^
( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) )  e.  NN )
30 oveq2 6093 . . . . 5  |-  ( x  =  ( 1st `  ( `' F `  X ) )  ->  ( ( B ^ y )  x.  x )  =  ( ( B ^ y
)  x.  ( 1st `  ( `' F `  X ) ) ) )
31 oveq2 6093 . . . . . 6  |-  ( y  =  ( 2nd `  ( `' F `  X ) )  ->  ( B ^ y )  =  ( B ^ ( 2nd `  ( `' F `  X ) ) ) )
3231oveq1d 6100 . . . . 5  |-  ( y  =  ( 2nd `  ( `' F `  X ) )  ->  ( ( B ^ y )  x.  ( 1st `  ( `' F `  X ) ) )  =  ( ( B ^ ( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) ) )
3330, 32, 3ovmpog 6223 . . . 4  |-  ( ( ( 1st `  ( `' F `  X ) )  e.  J  /\  ( 2nd `  ( `' F `  X ) )  e.  NN0  /\  ( ( B ^
( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) )  e.  NN )  -> 
( ( 1st `  ( `' F `  X ) ) F ( 2nd `  ( `' F `  X ) ) )  =  ( ( B ^ ( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) ) )
3412, 18, 29, 33syl3anc 1278 . . 3  |-  ( ( X  e.  NN  /\  B  e.  Prime )  -> 
( ( 1st `  ( `' F `  X ) ) F ( 2nd `  ( `' F `  X ) ) )  =  ( ( B ^ ( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) ) )
3523, 25, 343eqtr3d 2279 . 2  |-  ( ( X  e.  NN  /\  B  e.  Prime )  ->  X  =  ( ( B ^ ( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) ) )
36 breq2 4134 . . . . 5  |-  ( m  =  ( 1st `  ( `' F `  X ) )  ->  ( B  ||  m  <->  B  ||  ( 1st `  ( `' F `  X ) ) ) )
3736notbid 677 . . . 4  |-  ( m  =  ( 1st `  ( `' F `  X ) )  ->  ( -.  B  ||  m  <->  -.  B  ||  ( 1st `  ( `' F `  X ) ) ) )
38 oveq2 6093 . . . . 5  |-  ( m  =  ( 1st `  ( `' F `  X ) )  ->  ( ( B ^ a )  x.  m )  =  ( ( B ^ a
)  x.  ( 1st `  ( `' F `  X ) ) ) )
3938eqeq2d 2250 . . . 4  |-  ( m  =  ( 1st `  ( `' F `  X ) )  ->  ( X  =  ( ( B ^ a )  x.  m )  <->  X  =  ( ( B ^
a )  x.  ( 1st `  ( `' F `  X ) ) ) ) )
4037, 39anbi12d 477 . . 3  |-  ( m  =  ( 1st `  ( `' F `  X ) )  ->  ( ( -.  B  ||  m  /\  X  =  ( ( B ^ a )  x.  m ) )  <->  ( -.  B  ||  ( 1st `  ( `' F `  X ) )  /\  X  =  ( ( B ^
a )  x.  ( 1st `  ( `' F `  X ) ) ) ) ) )
41 oveq2 6093 . . . . . 6  |-  ( a  =  ( 2nd `  ( `' F `  X ) )  ->  ( B ^ a )  =  ( B ^ ( 2nd `  ( `' F `  X ) ) ) )
4241oveq1d 6100 . . . . 5  |-  ( a  =  ( 2nd `  ( `' F `  X ) )  ->  ( ( B ^ a )  x.  ( 1st `  ( `' F `  X ) ) )  =  ( ( B ^ ( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) ) )
4342eqeq2d 2250 . . . 4  |-  ( a  =  ( 2nd `  ( `' F `  X ) )  ->  ( X  =  ( ( B ^ a )  x.  ( 1st `  ( `' F `  X ) ) )  <->  X  =  ( ( B ^
( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) ) ) )
4443anbi2d 468 . . 3  |-  ( a  =  ( 2nd `  ( `' F `  X ) )  ->  ( ( -.  B  ||  ( 1st `  ( `' F `  X ) )  /\  X  =  ( ( B ^ a )  x.  ( 1st `  ( `' F `  X ) ) ) )  <->  ( -.  B  ||  ( 1st `  ( `' F `  X ) )  /\  X  =  ( ( B ^
( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) ) ) ) )
4540, 44rspc2ev 2945 . 2  |-  ( ( ( 1st `  ( `' F `  X ) )  e.  NN  /\  ( 2nd `  ( `' F `  X ) )  e.  NN0  /\  ( -.  B  ||  ( 1st `  ( `' F `  X ) )  /\  X  =  ( ( B ^ ( 2nd `  ( `' F `  X ) ) )  x.  ( 1st `  ( `' F `  X ) ) ) ) )  ->  E. m  e.  NN  E. a  e. 
NN0  ( -.  B  ||  m  /\  X  =  ( ( B ^
a )  x.  m
) ) )
4617, 18, 19, 35, 45syl112anc 1282 1  |-  ( ( X  e.  NN  /\  B  e.  Prime )  ->  E. m  e.  NN  E. a  e.  NN0  ( -.  B  ||  m  /\  X  =  ( ( B ^ a )  x.  m ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   E.wrex 2529   {crab 2532   <.cop 3712   class class class wbr 4130    X. cxp 4772   `'ccnv 4773   -1-1-onto->wf1o 5376   ` cfv 5377  (class class class)co 6085    e. cmpo 6087   1stc1st 6372   2ndc2nd 6373    x. cmul 8184   NNcn 9306   2c2 9357   NN0cn0 9567   ZZ>=cuz 9930   ^cexp 10988    || cdvds 12570   Primecprime 12901
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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299
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 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-2o 6688  df-er 6807  df-en 7023  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8500  df-neg 8501  df-reap 8905  df-ap 8912  df-div 9005  df-inn 9307  df-2 9365  df-3 9366  df-4 9367  df-n0 9568  df-z 9649  df-uz 9931  df-q 10029  df-rp 10065  df-fz 10422  df-fl 10715  df-mod 10773  df-seqfrec 10898  df-exp 10989  df-cj 11621  df-re 11622  df-im 11623  df-rsqrt 11778  df-abs 11779  df-dvds 12571  df-prm 12902
This theorem is used by:  zprmlogbap  16137
  Copyright terms: Public domain W3C validator