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

Theorem infpn2 13048
Description: There exist infinitely many prime numbers: the set of all primes  S is unbounded by infpn 12905, so by unbendc 13046 it is infinite. This is Metamath 100 proof #11. (Contributed by NM, 5-May-2005.)
Hypothesis
Ref Expression
infpn2.1  |-  S  =  { n  e.  NN  |  ( 1  < 
n  /\  A. m  e.  NN  ( ( n  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  n ) ) ) }
Assertion
Ref Expression
infpn2  |-  S  ~~  NN
Distinct variable group:    m, n
Allowed substitution hints:    S( m, n)

Proof of Theorem infpn2
Dummy variable  r is distinct from all other variables.
StepHypRef Expression
1 eluz2nn 9778 . . . . . . 7  |-  ( r  e.  ( ZZ>= `  2
)  ->  r  e.  NN )
21adantr 276 . . . . . 6  |-  ( ( r  e.  ( ZZ>= ` 
2 )  /\  A. m  e.  NN  (
m  ||  r  ->  ( m  =  1  \/  m  =  r ) ) )  ->  r  e.  NN )
3 simpll 527 . . . . . 6  |-  ( ( ( r  e.  NN  /\  1  <  r )  /\  A. m  e.  NN  ( ( r  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) )  ->  r  e.  NN )
4 eluz2b2 9815 . . . . . . . 8  |-  ( r  e.  ( ZZ>= `  2
)  <->  ( r  e.  NN  /\  1  < 
r ) )
54a1i 9 . . . . . . 7  |-  ( r  e.  NN  ->  (
r  e.  ( ZZ>= ` 
2 )  <->  ( r  e.  NN  /\  1  < 
r ) ) )
6 nndivdvds 12328 . . . . . . . . 9  |-  ( ( r  e.  NN  /\  m  e.  NN )  ->  ( m  ||  r  <->  ( r  /  m )  e.  NN ) )
76imbi1d 231 . . . . . . . 8  |-  ( ( r  e.  NN  /\  m  e.  NN )  ->  ( ( m  ||  r  ->  ( m  =  1  \/  m  =  r ) )  <->  ( (
r  /  m )  e.  NN  ->  (
m  =  1  \/  m  =  r ) ) ) )
87ralbidva 2526 . . . . . . 7  |-  ( r  e.  NN  ->  ( A. m  e.  NN  ( m  ||  r  -> 
( m  =  1  \/  m  =  r ) )  <->  A. m  e.  NN  ( ( r  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) ) )
95, 8anbi12d 473 . . . . . 6  |-  ( r  e.  NN  ->  (
( r  e.  (
ZZ>= `  2 )  /\  A. m  e.  NN  (
m  ||  r  ->  ( m  =  1  \/  m  =  r ) ) )  <->  ( (
r  e.  NN  /\  1  <  r )  /\  A. m  e.  NN  (
( r  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) ) ) )
102, 3, 9pm5.21nii 709 . . . . 5  |-  ( ( r  e.  ( ZZ>= ` 
2 )  /\  A. m  e.  NN  (
m  ||  r  ->  ( m  =  1  \/  m  =  r ) ) )  <->  ( (
r  e.  NN  /\  1  <  r )  /\  A. m  e.  NN  (
( r  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) ) )
11 anass 401 . . . . 5  |-  ( ( ( r  e.  NN  /\  1  <  r )  /\  A. m  e.  NN  ( ( r  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) )  <->  ( r  e.  NN  /\  ( 1  <  r  /\  A. m  e.  NN  (
( r  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) ) ) )
1210, 11bitri 184 . . . 4  |-  ( ( r  e.  ( ZZ>= ` 
2 )  /\  A. m  e.  NN  (
m  ||  r  ->  ( m  =  1  \/  m  =  r ) ) )  <->  ( r  e.  NN  /\  ( 1  <  r  /\  A. m  e.  NN  (
( r  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) ) ) )
13 isprm2 12660 . . . 4  |-  ( r  e.  Prime  <->  ( r  e.  ( ZZ>= `  2 )  /\  A. m  e.  NN  ( m  ||  r  -> 
( m  =  1  \/  m  =  r ) ) ) )
14 breq2 4087 . . . . . 6  |-  ( n  =  r  ->  (
1  <  n  <->  1  <  r ) )
15 oveq1 6017 . . . . . . . . 9  |-  ( n  =  r  ->  (
n  /  m )  =  ( r  /  m ) )
1615eleq1d 2298 . . . . . . . 8  |-  ( n  =  r  ->  (
( n  /  m
)  e.  NN  <->  ( r  /  m )  e.  NN ) )
17 equequ2 1759 . . . . . . . . 9  |-  ( n  =  r  ->  (
m  =  n  <->  m  =  r ) )
1817orbi2d 795 . . . . . . . 8  |-  ( n  =  r  ->  (
( m  =  1  \/  m  =  n )  <->  ( m  =  1  \/  m  =  r ) ) )
1916, 18imbi12d 234 . . . . . . 7  |-  ( n  =  r  ->  (
( ( n  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  n ) )  <->  ( (
r  /  m )  e.  NN  ->  (
m  =  1  \/  m  =  r ) ) ) )
2019ralbidv 2530 . . . . . 6  |-  ( n  =  r  ->  ( A. m  e.  NN  ( ( n  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  n ) )  <->  A. m  e.  NN  ( ( r  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) ) )
2114, 20anbi12d 473 . . . . 5  |-  ( n  =  r  ->  (
( 1  <  n  /\  A. m  e.  NN  ( ( n  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  n ) ) )  <->  ( 1  <  r  /\  A. m  e.  NN  (
( r  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) ) ) )
22 infpn2.1 . . . . 5  |-  S  =  { n  e.  NN  |  ( 1  < 
n  /\  A. m  e.  NN  ( ( n  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  n ) ) ) }
2321, 22elrab2 2962 . . . 4  |-  ( r  e.  S  <->  ( r  e.  NN  /\  ( 1  <  r  /\  A. m  e.  NN  (
( r  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  r ) ) ) ) )
2412, 13, 233bitr4i 212 . . 3  |-  ( r  e.  Prime  <->  r  e.  S
)
2524eqriv 2226 . 2  |-  Prime  =  S
26 prminf 13047 . 2  |-  Prime  ~~  NN
2725, 26eqbrtrri 4106 1  |-  S  ~~  NN
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713    = wceq 1395    e. wcel 2200   A.wral 2508   {crab 2512   class class class wbr 4083   ` cfv 5321  (class class class)co 6010    ~~ cen 6898   1c1 8016    < clt 8197    / cdiv 8835   NNcn 9126   2c2 9177   ZZ>=cuz 9738    || cdvds 12319   Primecprime 12650
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-iinf 4681  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-mulrcl 8114  ax-addcom 8115  ax-mulcom 8116  ax-addass 8117  ax-mulass 8118  ax-distr 8119  ax-i2m1 8120  ax-0lt1 8121  ax-1rid 8122  ax-0id 8123  ax-rnegex 8124  ax-precex 8125  ax-cnre 8126  ax-pre-ltirr 8127  ax-pre-ltwlin 8128  ax-pre-lttrn 8129  ax-pre-apti 8130  ax-pre-ltadd 8131  ax-pre-mulgt0 8132  ax-pre-mulext 8133  ax-arch 8134  ax-caucvg 8135
This theorem depends on definitions:  df-bi 117  df-stab 836  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4385  df-po 4388  df-iso 4389  df-iord 4458  df-on 4460  df-ilim 4461  df-suc 4463  df-iom 4684  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-isom 5330  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-recs 6462  df-frec 6548  df-1o 6573  df-2o 6574  df-er 6693  df-pm 6811  df-en 6901  df-dom 6902  df-fin 6903  df-sup 7167  df-inf 7168  df-dju 7221  df-inl 7230  df-inr 7231  df-case 7267  df-pnf 8199  df-mnf 8200  df-xr 8201  df-ltxr 8202  df-le 8203  df-sub 8335  df-neg 8336  df-reap 8738  df-ap 8745  df-div 8836  df-inn 9127  df-2 9185  df-3 9186  df-4 9187  df-n0 9386  df-z 9463  df-uz 9739  df-q 9832  df-rp 9867  df-fz 10222  df-fzo 10356  df-fl 10507  df-mod 10562  df-seqfrec 10687  df-exp 10778  df-fac 10965  df-cj 11374  df-re 11375  df-im 11376  df-rsqrt 11530  df-abs 11531  df-dvds 12320  df-prm 12651
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator