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

Theorem pclemdc 13045
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 9990 . . . . . 6  |-  ( x  e.  ZZ  -> DECID  x  e.  NN0 )
21ad2antlr 493 . . . . 5  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  -> DECID  x  e.  NN0 )
3 eluzelz 9910 . . . . . . . 8  |-  ( P  e.  ( ZZ>= `  2
)  ->  P  e.  ZZ )
43ad3antrrr 496 . . . . . . 7  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  ->  P  e.  ZZ )
5 zexpcl 10969 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  x  e.  NN0 )  -> 
( P ^ x
)  e.  ZZ )
64, 5sylancom 424 . . . . . 6  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  ->  ( P ^ x )  e.  ZZ )
7 simprl 535 . . . . . . 7  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  N  e.  ZZ )
87ad2antrr 492 . . . . . 6  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  ->  N  e.  ZZ )
9 zdvdsdc 12557 . . . . . 6  |-  ( ( ( P ^ x
)  e.  ZZ  /\  N  e.  ZZ )  -> DECID  ( P ^ x ) 
||  N )
106, 8, 9syl2anc 415 . . . . 5  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  x  e.  NN0 )  -> DECID  ( P ^ x
)  ||  N )
112, 10dcand 945 . . . 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 6083 . . . . . . 7  |-  ( n  =  x  ->  ( P ^ n )  =  ( P ^ x
) )
1312breq1d 4135 . . . . . 6  |-  ( n  =  x  ->  (
( P ^ n
)  ||  N  <->  ( P ^ x )  ||  N ) )
14 pclem.1 . . . . . 6  |-  A  =  { n  e.  NN0  |  ( P ^ n
)  ||  N }
1513, 14elrab2 2985 . . . . 5  |-  ( x  e.  A  <->  ( x  e.  NN0  /\  ( P ^ x )  ||  N ) )
1615dcbii 852 . . . 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 944 . . . . . 6  |-  ( ( ( ( P  e.  ( ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  /\  -.  x  e.  NN0 )  ->  -.  ( x  e.  NN0  /\  ( P ^ x
)  ||  N )
)
2019olcd 746 . . . . 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 847 . . . . 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 848 . . . . 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 810 . 2  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  x  e.  ZZ )  -> DECID  x  e.  A
)
2827ralrimiva 2623 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 720  DECID wdc 846    = wceq 1402    e. wcel 2209    =/= wne 2420   A.wral 2528   {crab 2532   class class class wbr 4125   ` cfv 5372  (class class class)co 6075   0cc0 8169   2c2 9334   NN0cn0 9542   ZZcz 9623   ZZ>=cuz 9900   ^cexp 10953    || cdvds 12532
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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287  ax-arch 8288
This theorem 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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901  df-q 9999  df-rp 10034  df-fl 10683  df-mod 10738  df-seqfrec 10863  df-exp 10954  df-dvds 12533
This theorem is referenced by:  pcprecl  13046  pcprendvds  13047  pcpremul  13050
  Copyright terms: Public domain W3C validator