MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  infpn2 Structured version   Unicode version

Theorem infpn2 13995
Description: There exist infinitely many prime numbers: the set of all primes  S is unbounded by infpn 13994, so by unben 13991 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 variables  j 
k are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 infpn2.1 . . 3  |-  S  =  { n  e.  NN  |  ( 1  < 
n  /\  A. m  e.  NN  ( ( n  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  n ) ) ) }
2 ssrab2 3458 . . 3  |-  { n  e.  NN  |  ( 1  <  n  /\  A. m  e.  NN  (
( n  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  n ) ) ) }  C_  NN
31, 2eqsstri 3407 . 2  |-  S  C_  NN
4 infpn 13994 . . . . 5  |-  ( j  e.  NN  ->  E. k  e.  NN  ( j  < 
k  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) )
5 nnge1 10369 . . . . . . . . . . 11  |-  ( j  e.  NN  ->  1  <_  j )
65adantr 465 . . . . . . . . . 10  |-  ( ( j  e.  NN  /\  k  e.  NN )  ->  1  <_  j )
7 nnre 10350 . . . . . . . . . . 11  |-  ( j  e.  NN  ->  j  e.  RR )
8 nnre 10350 . . . . . . . . . . 11  |-  ( k  e.  NN  ->  k  e.  RR )
9 1re 9406 . . . . . . . . . . . 12  |-  1  e.  RR
10 lelttr 9486 . . . . . . . . . . . 12  |-  ( ( 1  e.  RR  /\  j  e.  RR  /\  k  e.  RR )  ->  (
( 1  <_  j  /\  j  <  k )  ->  1  <  k
) )
119, 10mp3an1 1301 . . . . . . . . . . 11  |-  ( ( j  e.  RR  /\  k  e.  RR )  ->  ( ( 1  <_ 
j  /\  j  <  k )  ->  1  <  k ) )
127, 8, 11syl2an 477 . . . . . . . . . 10  |-  ( ( j  e.  NN  /\  k  e.  NN )  ->  ( ( 1  <_ 
j  /\  j  <  k )  ->  1  <  k ) )
136, 12mpand 675 . . . . . . . . 9  |-  ( ( j  e.  NN  /\  k  e.  NN )  ->  ( j  <  k  ->  1  <  k ) )
1413ancld 553 . . . . . . . 8  |-  ( ( j  e.  NN  /\  k  e.  NN )  ->  ( j  <  k  ->  ( j  <  k  /\  1  <  k ) ) )
1514anim1d 564 . . . . . . 7  |-  ( ( j  e.  NN  /\  k  e.  NN )  ->  ( ( j  < 
k  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) )  ->  ( (
j  <  k  /\  1  <  k )  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) )
16 anass 649 . . . . . . 7  |-  ( ( ( j  <  k  /\  1  <  k )  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) )  <->  ( j  < 
k  /\  ( 1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) )
1715, 16syl6ib 226 . . . . . 6  |-  ( ( j  e.  NN  /\  k  e.  NN )  ->  ( ( j  < 
k  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) )  ->  ( j  <  k  /\  ( 1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) ) )
1817reximdva 2849 . . . . 5  |-  ( j  e.  NN  ->  ( E. k  e.  NN  ( j  <  k  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) )  ->  E. k  e.  NN  ( j  <  k  /\  ( 1  <  k  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) ) )
194, 18mpd 15 . . . 4  |-  ( j  e.  NN  ->  E. k  e.  NN  ( j  < 
k  /\  ( 1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) )
20 breq2 4317 . . . . . . . . 9  |-  ( n  =  k  ->  (
1  <  n  <->  1  <  k ) )
21 oveq1 6119 . . . . . . . . . . . 12  |-  ( n  =  k  ->  (
n  /  m )  =  ( k  /  m ) )
2221eleq1d 2509 . . . . . . . . . . 11  |-  ( n  =  k  ->  (
( n  /  m
)  e.  NN  <->  ( k  /  m )  e.  NN ) )
23 equequ2 1737 . . . . . . . . . . . 12  |-  ( n  =  k  ->  (
m  =  n  <->  m  =  k ) )
2423orbi2d 701 . . . . . . . . . . 11  |-  ( n  =  k  ->  (
( m  =  1  \/  m  =  n )  <->  ( m  =  1  \/  m  =  k ) ) )
2522, 24imbi12d 320 . . . . . . . . . 10  |-  ( n  =  k  ->  (
( ( n  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  n ) )  <->  ( (
k  /  m )  e.  NN  ->  (
m  =  1  \/  m  =  k ) ) ) )
2625ralbidv 2756 . . . . . . . . 9  |-  ( n  =  k  ->  ( A. m  e.  NN  ( ( n  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  n ) )  <->  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) )
2720, 26anbi12d 710 . . . . . . . 8  |-  ( n  =  k  ->  (
( 1  <  n  /\  A. m  e.  NN  ( ( n  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  n ) ) )  <->  ( 1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) )
2827, 1elrab2 3140 . . . . . . 7  |-  ( k  e.  S  <->  ( k  e.  NN  /\  ( 1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) )
2928anbi1i 695 . . . . . 6  |-  ( ( k  e.  S  /\  j  <  k )  <->  ( (
k  e.  NN  /\  ( 1  <  k  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) )  /\  j  <  k
) )
30 anass 649 . . . . . 6  |-  ( ( ( k  e.  NN  /\  ( 1  <  k  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) )  /\  j  <  k
)  <->  ( k  e.  NN  /\  ( ( 1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) )  /\  j  <  k ) ) )
31 ancom 450 . . . . . . 7  |-  ( ( ( 1  <  k  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) )  /\  j  <  k )  <->  ( j  <  k  /\  ( 1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) )
3231anbi2i 694 . . . . . 6  |-  ( ( k  e.  NN  /\  ( ( 1  < 
k  /\  A. m  e.  NN  ( ( k  /  m )  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) )  /\  j  < 
k ) )  <->  ( k  e.  NN  /\  ( j  <  k  /\  (
1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) ) )
3329, 30, 323bitri 271 . . . . 5  |-  ( ( k  e.  S  /\  j  <  k )  <->  ( k  e.  NN  /\  ( j  <  k  /\  (
1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) ) )
3433rexbii2 2765 . . . 4  |-  ( E. k  e.  S  j  <  k  <->  E. k  e.  NN  ( j  < 
k  /\  ( 1  <  k  /\  A. m  e.  NN  (
( k  /  m
)  e.  NN  ->  ( m  =  1  \/  m  =  k ) ) ) ) )
3519, 34sylibr 212 . . 3  |-  ( j  e.  NN  ->  E. k  e.  S  j  <  k )
3635rgen 2802 . 2  |-  A. j  e.  NN  E. k  e.  S  j  <  k
37 unben 13991 . 2  |-  ( ( S  C_  NN  /\  A. j  e.  NN  E. k  e.  S  j  <  k )  ->  S  ~~  NN )
383, 36, 37mp2an 672 1  |-  S  ~~  NN
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    \/ wo 368    /\ wa 369    = wceq 1369    e. wcel 1756   A.wral 2736   E.wrex 2737   {crab 2740    C_ wss 3349   class class class wbr 4313  (class class class)co 6112    ~~ cen 7328   RRcr 9302   1c1 9304    < clt 9439    <_ cle 9440    / cdiv 10014   NNcn 10343
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-rep 4424  ax-sep 4434  ax-nul 4442  ax-pow 4491  ax-pr 4552  ax-un 6393  ax-inf2 7868  ax-cnex 9359  ax-resscn 9360  ax-1cn 9361  ax-icn 9362  ax-addcl 9363  ax-addrcl 9364  ax-mulcl 9365  ax-mulrcl 9366  ax-mulcom 9367  ax-addass 9368  ax-mulass 9369  ax-distr 9370  ax-i2m1 9371  ax-1ne0 9372  ax-1rid 9373  ax-rnegex 9374  ax-rrecex 9375  ax-cnre 9376  ax-pre-lttri 9377  ax-pre-lttrn 9378  ax-pre-ltadd 9379  ax-pre-mulgt0 9380
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2577  df-ne 2622  df-nel 2623  df-ral 2741  df-rex 2742  df-reu 2743  df-rmo 2744  df-rab 2745  df-v 2995  df-sbc 3208  df-csb 3310  df-dif 3352  df-un 3354  df-in 3356  df-ss 3363  df-pss 3365  df-nul 3659  df-if 3813  df-pw 3883  df-sn 3899  df-pr 3901  df-tp 3903  df-op 3905  df-uni 4113  df-int 4150  df-iun 4194  df-br 4314  df-opab 4372  df-mpt 4373  df-tr 4407  df-eprel 4653  df-id 4657  df-po 4662  df-so 4663  df-fr 4700  df-we 4702  df-ord 4743  df-on 4744  df-lim 4745  df-suc 4746  df-xp 4867  df-rel 4868  df-cnv 4869  df-co 4870  df-dm 4871  df-rn 4872  df-res 4873  df-ima 4874  df-iota 5402  df-fun 5441  df-fn 5442  df-f 5443  df-f1 5444  df-fo 5445  df-f1o 5446  df-fv 5447  df-riota 6073  df-ov 6115  df-oprab 6116  df-mpt2 6117  df-om 6498  df-2nd 6599  df-recs 6853  df-rdg 6887  df-er 7122  df-en 7332  df-dom 7333  df-sdom 7334  df-pnf 9441  df-mnf 9442  df-xr 9443  df-ltxr 9444  df-le 9445  df-sub 9618  df-neg 9619  df-div 10015  df-nn 10344  df-n0 10601  df-z 10668  df-uz 10883  df-seq 11828  df-fac 12073
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator