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

Theorem bpos1lem 16309
Description: Lemma for bpos1 . (Contributed by Mario Carneiro, 12-Mar-2014.)
Hypotheses
Ref Expression
bpos1.1  |-  ( E. p  e.  Prime  ( N  <  p  /\  p  <_  ( 2  x.  N
) )  ->  ph )
bpos1.2  |-  ( N  e.  ( ZZ>= `  P
)  ->  ph )
bpos1.3  |-  P  e. 
Prime
bpos1.4  |-  A  e. 
NN0
bpos1.5  |-  ( A  x.  2 )  =  B
bpos1.6  |-  A  < 
P
bpos1.7  |-  ( P  <  B  \/  P  =  B )
Assertion
Ref Expression
bpos1lem  |-  ( N  e.  ( ZZ>= `  A
)  ->  ph )
Distinct variable groups:    N, p    P, p
Allowed substitution hints:    ph( p)    A( p)    B( p)

Proof of Theorem bpos1lem
StepHypRef Expression
1 bpos1.3 . . . . . 6  |-  P  e. 
Prime
2 prmnn 12913 . . . . . 6  |-  ( P  e.  Prime  ->  P  e.  NN )
31, 2ax-mp 5 . . . . 5  |-  P  e.  NN
43nnzi 9676 . . . 4  |-  P  e.  ZZ
5 eluzelz 9947 . . . 4  |-  ( N  e.  ( ZZ>= `  A
)  ->  N  e.  ZZ )
6 eluz 9951 . . . 4  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  e.  (
ZZ>= `  P )  <->  P  <_  N ) )
74, 5, 6sylancr 418 . . 3  |-  ( N  e.  ( ZZ>= `  A
)  ->  ( N  e.  ( ZZ>= `  P )  <->  P  <_  N ) )
8 bpos1.2 . . 3  |-  ( N  e.  ( ZZ>= `  P
)  ->  ph )
97, 8biimtrrdi 164 . 2  |-  ( N  e.  ( ZZ>= `  A
)  ->  ( P  <_  N  ->  ph ) )
103nnrei 9322 . . . . . . . 8  |-  P  e.  RR
1110a1i 9 . . . . . . 7  |-  ( N  e.  ( ZZ>= `  A
)  ->  P  e.  RR )
12 bpos1.5 . . . . . . . . 9  |-  ( A  x.  2 )  =  B
13 bpos1.4 . . . . . . . . . . 11  |-  A  e. 
NN0
1413nn0rei 9585 . . . . . . . . . 10  |-  A  e.  RR
15 2re 9383 . . . . . . . . . 10  |-  2  e.  RR
1614, 15remulcli 8346 . . . . . . . . 9  |-  ( A  x.  2 )  e.  RR
1712, 16eqeltrri 2312 . . . . . . . 8  |-  B  e.  RR
1817a1i 9 . . . . . . 7  |-  ( N  e.  ( ZZ>= `  A
)  ->  B  e.  RR )
19 eluzelre 9948 . . . . . . . 8  |-  ( N  e.  ( ZZ>= `  A
)  ->  N  e.  RR )
20 remulcl 8313 . . . . . . . 8  |-  ( ( 2  e.  RR  /\  N  e.  RR )  ->  ( 2  x.  N
)  e.  RR )
2115, 19, 20sylancr 418 . . . . . . 7  |-  ( N  e.  ( ZZ>= `  A
)  ->  ( 2  x.  N )  e.  RR )
22 bpos1.7 . . . . . . . . 9  |-  ( P  <  B  \/  P  =  B )
23 2nn0 9591 . . . . . . . . . . . . 13  |-  2  e.  NN0
2413, 23nn0mulcli 9612 . . . . . . . . . . . 12  |-  ( A  x.  2 )  e. 
NN0
2512, 24eqeltrri 2312 . . . . . . . . . . 11  |-  B  e. 
NN0
2625nn0zi 9677 . . . . . . . . . 10  |-  B  e.  ZZ
27 zleloe 9702 . . . . . . . . . 10  |-  ( ( P  e.  ZZ  /\  B  e.  ZZ )  ->  ( P  <_  B  <->  ( P  <  B  \/  P  =  B )
) )
284, 26, 27mp2an 430 . . . . . . . . 9  |-  ( P  <_  B  <->  ( P  <  B  \/  P  =  B ) )
2922, 28mpbir 146 . . . . . . . 8  |-  P  <_  B
3029a1i 9 . . . . . . 7  |-  ( N  e.  ( ZZ>= `  A
)  ->  P  <_  B )
3113nn0cni 9586 . . . . . . . . 9  |-  A  e.  CC
32 2cn 9384 . . . . . . . . 9  |-  2  e.  CC
3331, 32, 12mulcomli 8339 . . . . . . . 8  |-  ( 2  x.  A )  =  B
34 eluzle 9950 . . . . . . . . 9  |-  ( N  e.  ( ZZ>= `  A
)  ->  A  <_  N )
35 2pos 9404 . . . . . . . . . . . 12  |-  0  <  2
3615, 35pm3.2i 272 . . . . . . . . . . 11  |-  ( 2  e.  RR  /\  0  <  2 )
37 lemul2 9195 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  N  e.  RR  /\  (
2  e.  RR  /\  0  <  2 ) )  ->  ( A  <_  N 
<->  ( 2  x.  A
)  <_  ( 2  x.  N ) ) )
3814, 36, 37mp3an13 1369 . . . . . . . . . 10  |-  ( N  e.  RR  ->  ( A  <_  N  <->  ( 2  x.  A )  <_ 
( 2  x.  N
) ) )
3919, 38syl 14 . . . . . . . . 9  |-  ( N  e.  ( ZZ>= `  A
)  ->  ( A  <_  N  <->  ( 2  x.  A )  <_  (
2  x.  N ) ) )
4034, 39mpbid 147 . . . . . . . 8  |-  ( N  e.  ( ZZ>= `  A
)  ->  ( 2  x.  A )  <_ 
( 2  x.  N
) )
4133, 40eqbrtrrid 4167 . . . . . . 7  |-  ( N  e.  ( ZZ>= `  A
)  ->  B  <_  ( 2  x.  N ) )
4211, 18, 21, 30, 41letrd 8457 . . . . . 6  |-  ( N  e.  ( ZZ>= `  A
)  ->  P  <_  ( 2  x.  N ) )
4342anim2i 342 . . . . 5  |-  ( ( N  <  P  /\  N  e.  ( ZZ>= `  A ) )  -> 
( N  <  P  /\  P  <_  ( 2  x.  N ) ) )
44 breq2 4135 . . . . . . 7  |-  ( p  =  P  ->  ( N  <  p  <->  N  <  P ) )
45 breq1 4134 . . . . . . 7  |-  ( p  =  P  ->  (
p  <_  ( 2  x.  N )  <->  P  <_  ( 2  x.  N ) ) )
4644, 45anbi12d 477 . . . . . 6  |-  ( p  =  P  ->  (
( N  <  p  /\  p  <_  ( 2  x.  N ) )  <-> 
( N  <  P  /\  P  <_  ( 2  x.  N ) ) ) )
4746rspcev 2929 . . . . 5  |-  ( ( P  e.  Prime  /\  ( N  <  P  /\  P  <_  ( 2  x.  N
) ) )  ->  E. p  e.  Prime  ( N  <  p  /\  p  <_  ( 2  x.  N ) ) )
481, 43, 47sylancr 418 . . . 4  |-  ( ( N  <  P  /\  N  e.  ( ZZ>= `  A ) )  ->  E. p  e.  Prime  ( N  <  p  /\  p  <_  ( 2  x.  N ) ) )
49 bpos1.1 . . . 4  |-  ( E. p  e.  Prime  ( N  <  p  /\  p  <_  ( 2  x.  N
) )  ->  ph )
5048, 49syl 14 . . 3  |-  ( ( N  <  P  /\  N  e.  ( ZZ>= `  A ) )  ->  ph )
5150expcom 116 . 2  |-  ( N  e.  ( ZZ>= `  A
)  ->  ( N  <  P  ->  ph ) )
52 zlelttric 9700 . . 3  |-  ( ( P  e.  ZZ  /\  N  e.  ZZ )  ->  ( P  <_  N  \/  N  <  P ) )
534, 5, 52sylancr 418 . 2  |-  ( N  e.  ( ZZ>= `  A
)  ->  ( P  <_  N  \/  N  < 
P ) )
549, 51, 53mpjaod 730 1  |-  ( N  e.  ( ZZ>= `  A
)  ->  ph )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209   E.wrex 2529   class class class wbr 4131   ` cfv 5380  (class class class)co 6088   RRcr 8184   0cc0 8185    x. cmul 8190    < clt 8366    <_ cle 8367   NNcn 9313   2c2 9364   NN0cn0 9574   ZZcz 9655   ZZ>=cuz 9937   Primecprime 12910
This proof depends on 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-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-ltadd 8301  ax-pre-mulgt0 8302
This proof depends on definitions:  df-bi 117  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-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-2 9372  df-n0 9575  df-z 9656  df-uz 9938  df-prm 12911
This theorem is used by:  bpos1  16310
  Copyright terms: Public domain W3C validator