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

Theorem pcprendvds 12943
Description: Non-divisibility property of the prime power pre-function. (Contributed by Mario Carneiro, 23-Feb-2014.)
Hypotheses
Ref Expression
pclem.1  |-  A  =  { n  e.  NN0  |  ( P ^ n
)  ||  N }
pclem.2  |-  S  =  sup ( A ,  RR ,  <  )
Assertion
Ref Expression
pcprendvds  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  -.  ( P ^ ( S  +  1 ) )  ||  N )
Distinct variable groups:    n, N    P, n
Allowed substitution hints:    A( n)    S( n)

Proof of Theorem pcprendvds
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pclem.1 . . . . . . 7  |-  A  =  { n  e.  NN0  |  ( P ^ n
)  ||  N }
2 pclem.2 . . . . . . 7  |-  S  =  sup ( A ,  RR ,  <  )
31, 2pcprecl 12942 . . . . . 6  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  -> 
( S  e.  NN0  /\  ( P ^ S
)  ||  N )
)
43simpld 112 . . . . 5  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  S  e.  NN0 )
54nn0red 9517 . . . 4  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  S  e.  RR )
65ltp1d 9169 . . 3  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  S  <  ( S  + 
1 ) )
74nn0zd 9661 . . . 4  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  S  e.  ZZ )
87peano2zd 9666 . . . 4  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  -> 
( S  +  1 )  e.  ZZ )
9 zltnle 9586 . . . 4  |-  ( ( S  e.  ZZ  /\  ( S  +  1
)  e.  ZZ )  ->  ( S  < 
( S  +  1 )  <->  -.  ( S  +  1 )  <_  S ) )
107, 8, 9syl2anc 411 . . 3  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  -> 
( S  <  ( S  +  1 )  <->  -.  ( S  +  1 )  <_  S )
)
116, 10mpbid 147 . 2  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  -.  ( S  +  1 )  <_  S )
12 peano2nn0 9501 . . . 4  |-  ( S  e.  NN0  ->  ( S  +  1 )  e. 
NN0 )
13 oveq2 6036 . . . . . . 7  |-  ( x  =  ( S  + 
1 )  ->  ( P ^ x )  =  ( P ^ ( S  +  1 ) ) )
1413breq1d 4103 . . . . . 6  |-  ( x  =  ( S  + 
1 )  ->  (
( P ^ x
)  ||  N  <->  ( P ^ ( S  + 
1 ) )  ||  N ) )
15 oveq2 6036 . . . . . . . . 9  |-  ( n  =  x  ->  ( P ^ n )  =  ( P ^ x
) )
1615breq1d 4103 . . . . . . . 8  |-  ( n  =  x  ->  (
( P ^ n
)  ||  N  <->  ( P ^ x )  ||  N ) )
1716cbvrabv 2802 . . . . . . 7  |-  { n  e.  NN0  |  ( P ^ n )  ||  N }  =  {
x  e.  NN0  | 
( P ^ x
)  ||  N }
181, 17eqtri 2252 . . . . . 6  |-  A  =  { x  e.  NN0  |  ( P ^ x
)  ||  N }
1914, 18elrab2 2966 . . . . 5  |-  ( ( S  +  1 )  e.  A  <->  ( ( S  +  1 )  e.  NN0  /\  ( P ^ ( S  + 
1 ) )  ||  N ) )
2019simplbi2 385 . . . 4  |-  ( ( S  +  1 )  e.  NN0  ->  ( ( P ^ ( S  +  1 ) ) 
||  N  ->  ( S  +  1 )  e.  A ) )
214, 12, 203syl 17 . . 3  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  -> 
( ( P ^
( S  +  1 ) )  ||  N  ->  ( S  +  1 )  e.  A ) )
221ssrab3 3314 . . . . . . . 8  |-  A  C_  NN0
23 nn0ssz 9558 . . . . . . . 8  |-  NN0  C_  ZZ
2422, 23sstri 3237 . . . . . . 7  |-  A  C_  ZZ
2524a1i 9 . . . . . 6  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  ( S  +  1 )  e.  A )  ->  A  C_  ZZ )
261pclemdc 12941 . . . . . . 7  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  A. x  e.  ZZ DECID  x  e.  A )
2726adantr 276 . . . . . 6  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  ( S  +  1 )  e.  A )  ->  A. x  e.  ZZ DECID  x  e.  A )
281pclemub 12940 . . . . . . 7  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  E. x  e.  ZZ  A. y  e.  A  y  <_  x )
2928adantr 276 . . . . . 6  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  ( S  +  1 )  e.  A )  ->  E. x  e.  ZZ  A. y  e.  A  y  <_  x
)
30 simpr 110 . . . . . 6  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  ( S  +  1 )  e.  A )  ->  ( S  +  1 )  e.  A )
3125, 27, 29, 30suprzubdc 10559 . . . . 5  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  ( S  +  1 )  e.  A )  ->  ( S  +  1 )  <_  sup ( A ,  RR ,  <  ) )
3231, 2breqtrrdi 4135 . . . 4  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  /\  ( S  +  1 )  e.  A )  ->  ( S  +  1 )  <_  S )
3332ex 115 . . 3  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  -> 
( ( S  + 
1 )  e.  A  ->  ( S  +  1 )  <_  S )
)
3421, 33syld 45 . 2  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  -> 
( ( P ^
( S  +  1 ) )  ||  N  ->  ( S  +  1 )  <_  S )
)
3511, 34mtod 669 1  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  ( N  e.  ZZ  /\  N  =/=  0 ) )  ->  -.  ( P ^ ( S  +  1 ) )  ||  N )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 842    = wceq 1398    e. wcel 2202    =/= wne 2403   A.wral 2511   E.wrex 2512   {crab 2515    C_ wss 3201   class class class wbr 4093   ` cfv 5333  (class class class)co 6028   supcsup 7241   RRcr 8091   0cc0 8092   1c1 8093    + caddc 8095    < clt 8273    <_ cle 8274   2c2 9253   NN0cn0 9461   ZZcz 9540   ZZ>=cuz 9816   ^cexp 10863    || cdvds 12428
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210  ax-arch 8211  ax-caucvg 8212
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-isom 5342  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-sup 7243  df-inf 7244  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-n0 9462  df-z 9541  df-uz 9817  df-q 9915  df-rp 9950  df-fz 10306  df-fzo 10440  df-fl 10593  df-mod 10648  df-seqfrec 10773  df-exp 10864  df-cj 11482  df-re 11483  df-im 11484  df-rsqrt 11638  df-abs 11639  df-dvds 12429
This theorem is referenced by:  pcprendvds2  12944  pczndvds  12969
  Copyright terms: Public domain W3C validator