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

Theorem exprmfct 11807
Description: Every integer greater than or equal to 2 has a prime factor. (Contributed by Paul Chapman, 26-Oct-2012.) (Proof shortened by Mario Carneiro, 20-Jun-2015.)
Assertion
Ref Expression
exprmfct  |-  ( N  e.  ( ZZ>= `  2
)  ->  E. p  e.  Prime  p  ||  N
)
Distinct variable group:    N, p

Proof of Theorem exprmfct
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eluz2nn 9357 . 2  |-  ( N  e.  ( ZZ>= `  2
)  ->  N  e.  NN )
2 eleq1 2200 . . . 4  |-  ( x  =  1  ->  (
x  e.  ( ZZ>= ` 
2 )  <->  1  e.  ( ZZ>= `  2 )
) )
32imbi1d 230 . . 3  |-  ( x  =  1  ->  (
( x  e.  (
ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  x )  <->  ( 1  e.  ( ZZ>= `  2
)  ->  E. p  e.  Prime  p  ||  x
) ) )
4 eleq1 2200 . . . 4  |-  ( x  =  y  ->  (
x  e.  ( ZZ>= ` 
2 )  <->  y  e.  ( ZZ>= `  2 )
) )
5 breq2 3928 . . . . 5  |-  ( x  =  y  ->  (
p  ||  x  <->  p  ||  y
) )
65rexbidv 2436 . . . 4  |-  ( x  =  y  ->  ( E. p  e.  Prime  p 
||  x  <->  E. p  e.  Prime  p  ||  y
) )
74, 6imbi12d 233 . . 3  |-  ( x  =  y  ->  (
( x  e.  (
ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  x )  <->  ( y  e.  ( ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  y ) ) )
8 eleq1 2200 . . . 4  |-  ( x  =  z  ->  (
x  e.  ( ZZ>= ` 
2 )  <->  z  e.  ( ZZ>= `  2 )
) )
9 breq2 3928 . . . . 5  |-  ( x  =  z  ->  (
p  ||  x  <->  p  ||  z
) )
109rexbidv 2436 . . . 4  |-  ( x  =  z  ->  ( E. p  e.  Prime  p 
||  x  <->  E. p  e.  Prime  p  ||  z
) )
118, 10imbi12d 233 . . 3  |-  ( x  =  z  ->  (
( x  e.  (
ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  x )  <->  ( z  e.  ( ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  z ) ) )
12 eleq1 2200 . . . 4  |-  ( x  =  ( y  x.  z )  ->  (
x  e.  ( ZZ>= ` 
2 )  <->  ( y  x.  z )  e.  (
ZZ>= `  2 ) ) )
13 breq2 3928 . . . . 5  |-  ( x  =  ( y  x.  z )  ->  (
p  ||  x  <->  p  ||  (
y  x.  z ) ) )
1413rexbidv 2436 . . . 4  |-  ( x  =  ( y  x.  z )  ->  ( E. p  e.  Prime  p 
||  x  <->  E. p  e.  Prime  p  ||  (
y  x.  z ) ) )
1512, 14imbi12d 233 . . 3  |-  ( x  =  ( y  x.  z )  ->  (
( x  e.  (
ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  x )  <->  ( (
y  x.  z )  e.  ( ZZ>= `  2
)  ->  E. p  e.  Prime  p  ||  (
y  x.  z ) ) ) )
16 eleq1 2200 . . . 4  |-  ( x  =  N  ->  (
x  e.  ( ZZ>= ` 
2 )  <->  N  e.  ( ZZ>= `  2 )
) )
17 breq2 3928 . . . . 5  |-  ( x  =  N  ->  (
p  ||  x  <->  p  ||  N
) )
1817rexbidv 2436 . . . 4  |-  ( x  =  N  ->  ( E. p  e.  Prime  p 
||  x  <->  E. p  e.  Prime  p  ||  N
) )
1916, 18imbi12d 233 . . 3  |-  ( x  =  N  ->  (
( x  e.  (
ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  x )  <->  ( N  e.  ( ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  N ) ) )
20 1m1e0 8782 . . . . 5  |-  ( 1  -  1 )  =  0
21 uz2m1nn 9392 . . . . 5  |-  ( 1  e.  ( ZZ>= `  2
)  ->  ( 1  -  1 )  e.  NN )
2220, 21eqeltrrid 2225 . . . 4  |-  ( 1  e.  ( ZZ>= `  2
)  ->  0  e.  NN )
23 0nnn 8740 . . . . 5  |-  -.  0  e.  NN
2423pm2.21i 635 . . . 4  |-  ( 0  e.  NN  ->  E. p  e.  Prime  p  ||  x
)
2522, 24syl 14 . . 3  |-  ( 1  e.  ( ZZ>= `  2
)  ->  E. p  e.  Prime  p  ||  x
)
26 prmz 11781 . . . . . 6  |-  ( x  e.  Prime  ->  x  e.  ZZ )
27 iddvds 11495 . . . . . 6  |-  ( x  e.  ZZ  ->  x  ||  x )
2826, 27syl 14 . . . . 5  |-  ( x  e.  Prime  ->  x  ||  x )
29 breq1 3927 . . . . . 6  |-  ( p  =  x  ->  (
p  ||  x  <->  x  ||  x
) )
3029rspcev 2784 . . . . 5  |-  ( ( x  e.  Prime  /\  x  ||  x )  ->  E. p  e.  Prime  p  ||  x
)
3128, 30mpdan 417 . . . 4  |-  ( x  e.  Prime  ->  E. p  e.  Prime  p  ||  x
)
3231a1d 22 . . 3  |-  ( x  e.  Prime  ->  ( x  e.  ( ZZ>= `  2
)  ->  E. p  e.  Prime  p  ||  x
) )
33 simpl 108 . . . . . 6  |-  ( ( y  e.  ( ZZ>= ` 
2 )  /\  z  e.  ( ZZ>= `  2 )
)  ->  y  e.  ( ZZ>= `  2 )
)
34 eluzelz 9328 . . . . . . . . . 10  |-  ( y  e.  ( ZZ>= `  2
)  ->  y  e.  ZZ )
3534ad2antrr 479 . . . . . . . . 9  |-  ( ( ( y  e.  (
ZZ>= `  2 )  /\  z  e.  ( ZZ>= ` 
2 ) )  /\  p  e.  Prime )  -> 
y  e.  ZZ )
36 eluzelz 9328 . . . . . . . . . 10  |-  ( z  e.  ( ZZ>= `  2
)  ->  z  e.  ZZ )
3736ad2antlr 480 . . . . . . . . 9  |-  ( ( ( y  e.  (
ZZ>= `  2 )  /\  z  e.  ( ZZ>= ` 
2 ) )  /\  p  e.  Prime )  -> 
z  e.  ZZ )
38 dvdsmul1 11504 . . . . . . . . 9  |-  ( ( y  e.  ZZ  /\  z  e.  ZZ )  ->  y  ||  ( y  x.  z ) )
3935, 37, 38syl2anc 408 . . . . . . . 8  |-  ( ( ( y  e.  (
ZZ>= `  2 )  /\  z  e.  ( ZZ>= ` 
2 ) )  /\  p  e.  Prime )  -> 
y  ||  ( y  x.  z ) )
40 prmz 11781 . . . . . . . . . 10  |-  ( p  e.  Prime  ->  p  e.  ZZ )
4140adantl 275 . . . . . . . . 9  |-  ( ( ( y  e.  (
ZZ>= `  2 )  /\  z  e.  ( ZZ>= ` 
2 ) )  /\  p  e.  Prime )  ->  p  e.  ZZ )
4235, 37zmulcld 9172 . . . . . . . . 9  |-  ( ( ( y  e.  (
ZZ>= `  2 )  /\  z  e.  ( ZZ>= ` 
2 ) )  /\  p  e.  Prime )  -> 
( y  x.  z
)  e.  ZZ )
43 dvdstr 11519 . . . . . . . . 9  |-  ( ( p  e.  ZZ  /\  y  e.  ZZ  /\  (
y  x.  z )  e.  ZZ )  -> 
( ( p  ||  y  /\  y  ||  (
y  x.  z ) )  ->  p  ||  (
y  x.  z ) ) )
4441, 35, 42, 43syl3anc 1216 . . . . . . . 8  |-  ( ( ( y  e.  (
ZZ>= `  2 )  /\  z  e.  ( ZZ>= ` 
2 ) )  /\  p  e.  Prime )  -> 
( ( p  ||  y  /\  y  ||  (
y  x.  z ) )  ->  p  ||  (
y  x.  z ) ) )
4539, 44mpan2d 424 . . . . . . 7  |-  ( ( ( y  e.  (
ZZ>= `  2 )  /\  z  e.  ( ZZ>= ` 
2 ) )  /\  p  e.  Prime )  -> 
( p  ||  y  ->  p  ||  ( y  x.  z ) ) )
4645reximdva 2532 . . . . . 6  |-  ( ( y  e.  ( ZZ>= ` 
2 )  /\  z  e.  ( ZZ>= `  2 )
)  ->  ( E. p  e.  Prime  p  ||  y  ->  E. p  e.  Prime  p 
||  ( y  x.  z ) ) )
4733, 46embantd 56 . . . . 5  |-  ( ( y  e.  ( ZZ>= ` 
2 )  /\  z  e.  ( ZZ>= `  2 )
)  ->  ( (
y  e.  ( ZZ>= ` 
2 )  ->  E. p  e.  Prime  p  ||  y
)  ->  E. p  e.  Prime  p  ||  (
y  x.  z ) ) )
4847a1dd 48 . . . 4  |-  ( ( y  e.  ( ZZ>= ` 
2 )  /\  z  e.  ( ZZ>= `  2 )
)  ->  ( (
y  e.  ( ZZ>= ` 
2 )  ->  E. p  e.  Prime  p  ||  y
)  ->  ( (
y  x.  z )  e.  ( ZZ>= `  2
)  ->  E. p  e.  Prime  p  ||  (
y  x.  z ) ) ) )
4948adantrd 277 . . 3  |-  ( ( y  e.  ( ZZ>= ` 
2 )  /\  z  e.  ( ZZ>= `  2 )
)  ->  ( (
( y  e.  (
ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  y )  /\  ( z  e.  (
ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  z ) )  ->  ( ( y  x.  z )  e.  ( ZZ>= `  2 )  ->  E. p  e.  Prime  p 
||  ( y  x.  z ) ) ) )
503, 7, 11, 15, 19, 25, 32, 49prmind 11791 . 2  |-  ( N  e.  NN  ->  ( N  e.  ( ZZ>= ` 
2 )  ->  E. p  e.  Prime  p  ||  N
) )
511, 50mpcom 36 1  |-  ( N  e.  ( ZZ>= `  2
)  ->  E. p  e.  Prime  p  ||  N
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1331    e. wcel 1480   E.wrex 2415   class class class wbr 3924   ` cfv 5118  (class class class)co 5767   0cc0 7613   1c1 7614    x. cmul 7618    - cmin 7926   NNcn 8713   2c2 8764   ZZcz 9047   ZZ>=cuz 9319    || cdvds 11482   Primecprime 11777
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497  ax-cnex 7704  ax-resscn 7705  ax-1cn 7706  ax-1re 7707  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-mulrcl 7712  ax-addcom 7713  ax-mulcom 7714  ax-addass 7715  ax-mulass 7716  ax-distr 7717  ax-i2m1 7718  ax-0lt1 7719  ax-1rid 7720  ax-0id 7721  ax-rnegex 7722  ax-precex 7723  ax-cnre 7724  ax-pre-ltirr 7725  ax-pre-ltwlin 7726  ax-pre-lttrn 7727  ax-pre-apti 7728  ax-pre-ltadd 7729  ax-pre-mulgt0 7730  ax-pre-mulext 7731  ax-arch 7732  ax-caucvg 7733
This theorem depends on definitions:  df-bi 116  df-stab 816  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-reu 2421  df-rmo 2422  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-if 3470  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-id 4210  df-po 4213  df-iso 4214  df-iord 4283  df-on 4285  df-ilim 4286  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-riota 5723  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-frec 6281  df-1o 6306  df-2o 6307  df-er 6422  df-en 6628  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799  df-sub 7928  df-neg 7929  df-reap 8330  df-ap 8337  df-div 8426  df-inn 8714  df-2 8772  df-3 8773  df-4 8774  df-n0 8971  df-z 9048  df-uz 9320  df-q 9405  df-rp 9435  df-fz 9784  df-fzo 9913  df-fl 10036  df-mod 10089  df-seqfrec 10212  df-exp 10286  df-cj 10607  df-re 10608  df-im 10609  df-rsqrt 10763  df-abs 10764  df-dvds 11483  df-prm 11778
This theorem is referenced by:  prmdvdsfz  11808  rpexp  11820
  Copyright terms: Public domain W3C validator