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

Theorem pclemdc 12457
Description: Lemma for the prime power pre-function's properties. (Contributed by Jim Kingdon, 8-Oct-2024.)
Hypothesis
Ref Expression
pclem.1  |-  A  =  { n  e.  NN0  |  ( P ^ n
)  ||  N }
Assertion
Ref Expression
pclemdc  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  A. x  e.  ZZ DECID  x  e.  A )
Distinct variable groups:    n, N, x    P, n, x
Allowed substitution hints:    A( x, n)

Proof of Theorem pclemdc
StepHypRef Expression
1 elnn0dc 9685 . . . . . 6  |-  ( x  e.  ZZ  -> DECID  x  e.  NN0 )
21ad2antlr 489 . . . . 5  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  -> DECID  x  e.  NN0 )
3 eluzelz 9610 . . . . . . . 8  |-  ( P  e.  ( ZZ>= `  2
)  ->  P  e.  ZZ )
43ad3antrrr 492 . . . . . . 7  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  ->  P  e.  ZZ )
5 zexpcl 10646 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  x  e.  NN0 )  -> 
( P ^ x
)  e.  ZZ )
64, 5sylancom 420 . . . . . 6  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  ->  ( P ^ x )  e.  ZZ )
7 simprl 529 . . . . . . 7  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  N  e.  ZZ )
87ad2antrr 488 . . . . . 6  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  ->  N  e.  ZZ )
9 zdvdsdc 11977 . . . . . 6  |-  ( ( ( P ^ x
)  e.  ZZ  /\  N  e.  ZZ )  -> DECID  ( P ^ x ) 
||  N )
106, 8, 9syl2anc 411 . . . . 5  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  -> DECID  ( P ^ x
)  ||  N )
112, 10dcand 934 . . . 4  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  -> DECID  ( x  e.  NN0  /\  ( P ^ x
)  ||  N )
)
12 oveq2 5930 . . . . . . 7  |-  ( n  =  x  ->  ( P ^ n )  =  ( P ^ x
) )
1312breq1d 4043 . . . . . 6  |-  ( n  =  x  ->  (
( P ^ n
)  ||  N  <->  ( P ^ x )  ||  N ) )
14 pclem.1 . . . . . 6  |-  A  =  { n  e.  NN0  |  ( P ^ n
)  ||  N }
1513, 14elrab2 2923 . . . . 5  |-  ( x  e.  A  <->  ( x  e.  NN0  /\  ( P ^ x )  ||  N ) )
1615dcbii 841 . . . 4  |-  (DECID  x  e.  A  <-> DECID  ( x  e.  NN0  /\  ( P ^ x
)  ||  N )
)
1711, 16sylibr 134 . . 3  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  -> DECID  x  e.  A
)
18 simpr 110 . . . . . . 7  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  -.  x  e.  NN0 )  ->  -.  x  e.  NN0 )
1918intnanrd 933 . . . . . 6  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  -.  x  e.  NN0 )  ->  -.  ( x  e.  NN0  /\  ( P ^ x
)  ||  N )
)
2019olcd 735 . . . . 5  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  -.  x  e.  NN0 )  -> 
( ( x  e. 
NN0  /\  ( P ^ x )  ||  N )  \/  -.  ( x  e.  NN0  /\  ( P ^ x
)  ||  N )
) )
21 df-dc 836 . . . . 5  |-  (DECID  ( x  e.  NN0  /\  ( P ^ x )  ||  N )  <->  ( (
x  e.  NN0  /\  ( P ^ x ) 
||  N )  \/ 
-.  ( x  e. 
NN0  /\  ( P ^ x )  ||  N ) ) )
2220, 21sylibr 134 . . . 4  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  -.  x  e.  NN0 )  -> DECID  (
x  e.  NN0  /\  ( P ^ x ) 
||  N ) )
2322, 16sylibr 134 . . 3  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  -.  x  e.  NN0 )  -> DECID  x  e.  A )
24 exmiddc 837 . . . . 5  |-  (DECID  x  e. 
NN0  ->  ( x  e. 
NN0  \/  -.  x  e.  NN0 ) )
251, 24syl 14 . . . 4  |-  ( x  e.  ZZ  ->  (
x  e.  NN0  \/  -.  x  e.  NN0 ) )
2625adantl 277 . . 3  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  ->  (
x  e.  NN0  \/  -.  x  e.  NN0 ) )
2717, 23, 26mpjaodan 799 . 2  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  -> DECID  x  e.  A
)
2827ralrimiva 2570 1  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  A. x  e.  ZZ DECID  x  e.  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 709  DECID wdc 835    = wceq 1364    e. wcel 2167    =/= wne 2367   A.wral 2475   {crab 2479   class class class wbr 4033   ` cfv 5258  (class class class)co 5922   0cc0 7879   2c2 9041   NN0cn0 9249   ZZcz 9326   ZZ>=cuz 9601   ^cexp 10630    || cdvds 11952
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997  ax-arch 7998
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-if 3562  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-po 4331  df-iso 4332  df-iord 4401  df-on 4403  df-ilim 4404  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-frec 6449  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700  df-inn 8991  df-n0 9250  df-z 9327  df-uz 9602  df-q 9694  df-rp 9729  df-fl 10360  df-mod 10415  df-seqfrec 10540  df-exp 10631  df-dvds 11953
This theorem is referenced by:  pcprecl  12458  pcprendvds  12459  pcpremul  12462
  Copyright terms: Public domain W3C validator