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

Theorem prime 9623
Description: Two ways to express " A is a prime number (or 1)". (Contributed by NM, 4-May-2005.)
Assertion
Ref Expression
prime  |-  ( A  e.  NN  ->  ( A. x  e.  NN  ( ( A  /  x )  e.  NN  ->  ( x  =  1  \/  x  =  A ) )  <->  A. x  e.  NN  ( ( 1  <  x  /\  x  <_  A  /\  ( A  /  x )  e.  NN )  ->  x  =  A ) ) )
Distinct variable group:    x, A

Proof of Theorem prime
StepHypRef Expression
1 nnz 9542 . . . . . . 7  |-  ( x  e.  NN  ->  x  e.  ZZ )
2 1z 9549 . . . . . . . 8  |-  1  e.  ZZ
3 zdceq 9599 . . . . . . . 8  |-  ( ( x  e.  ZZ  /\  1  e.  ZZ )  -> DECID  x  =  1 )
42, 3mpan2 425 . . . . . . 7  |-  ( x  e.  ZZ  -> DECID  x  =  1
)
5 dfordc 900 . . . . . . . 8  |-  (DECID  x  =  1  ->  ( (
x  =  1  \/  x  =  A )  <-> 
( -.  x  =  1  ->  x  =  A ) ) )
6 df-ne 2404 . . . . . . . . 9  |-  ( x  =/=  1  <->  -.  x  =  1 )
76imbi1i 238 . . . . . . . 8  |-  ( ( x  =/=  1  ->  x  =  A )  <->  ( -.  x  =  1  ->  x  =  A ) )
85, 7bitr4di 198 . . . . . . 7  |-  (DECID  x  =  1  ->  ( (
x  =  1  \/  x  =  A )  <-> 
( x  =/=  1  ->  x  =  A ) ) )
91, 4, 83syl 17 . . . . . 6  |-  ( x  e.  NN  ->  (
( x  =  1  \/  x  =  A )  <->  ( x  =/=  1  ->  x  =  A ) ) )
109imbi2d 230 . . . . 5  |-  ( x  e.  NN  ->  (
( ( A  /  x )  e.  NN  ->  ( x  =  1  \/  x  =  A ) )  <->  ( ( A  /  x )  e.  NN  ->  ( x  =/=  1  ->  x  =  A ) ) ) )
11 impexp 263 . . . . . 6  |-  ( ( ( x  =/=  1  /\  ( A  /  x
)  e.  NN )  ->  x  =  A )  <->  ( x  =/=  1  ->  ( ( A  /  x )  e.  NN  ->  x  =  A ) ) )
12 bi2.04 248 . . . . . 6  |-  ( ( x  =/=  1  -> 
( ( A  /  x )  e.  NN  ->  x  =  A ) )  <->  ( ( A  /  x )  e.  NN  ->  ( x  =/=  1  ->  x  =  A ) ) )
1311, 12bitri 184 . . . . 5  |-  ( ( ( x  =/=  1  /\  ( A  /  x
)  e.  NN )  ->  x  =  A )  <->  ( ( A  /  x )  e.  NN  ->  ( x  =/=  1  ->  x  =  A ) ) )
1410, 13bitr4di 198 . . . 4  |-  ( x  e.  NN  ->  (
( ( A  /  x )  e.  NN  ->  ( x  =  1  \/  x  =  A ) )  <->  ( (
x  =/=  1  /\  ( A  /  x
)  e.  NN )  ->  x  =  A ) ) )
1514adantl 277 . . 3  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( ( A  /  x )  e.  NN  ->  ( x  =  1  \/  x  =  A ) )  <->  ( (
x  =/=  1  /\  ( A  /  x
)  e.  NN )  ->  x  =  A ) ) )
16 nngt1ne1 9220 . . . . . . 7  |-  ( x  e.  NN  ->  (
1  <  x  <->  x  =/=  1 ) )
1716adantl 277 . . . . . 6  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( 1  <  x  <->  x  =/=  1 ) )
1817anbi1d 465 . . . . 5  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( 1  < 
x  /\  ( A  /  x )  e.  NN ) 
<->  ( x  =/=  1  /\  ( A  /  x
)  e.  NN ) ) )
19 nnz 9542 . . . . . . . . 9  |-  ( ( A  /  x )  e.  NN  ->  ( A  /  x )  e.  ZZ )
20 nnre 9192 . . . . . . . . . . . . 13  |-  ( x  e.  NN  ->  x  e.  RR )
21 gtndiv 9619 . . . . . . . . . . . . . 14  |-  ( ( x  e.  RR  /\  A  e.  NN  /\  A  <  x )  ->  -.  ( A  /  x
)  e.  ZZ )
22213expia 1232 . . . . . . . . . . . . 13  |-  ( ( x  e.  RR  /\  A  e.  NN )  ->  ( A  <  x  ->  -.  ( A  /  x )  e.  ZZ ) )
2320, 22sylan 283 . . . . . . . . . . . 12  |-  ( ( x  e.  NN  /\  A  e.  NN )  ->  ( A  <  x  ->  -.  ( A  /  x )  e.  ZZ ) )
2423con2d 629 . . . . . . . . . . 11  |-  ( ( x  e.  NN  /\  A  e.  NN )  ->  ( ( A  /  x )  e.  ZZ  ->  -.  A  <  x
) )
25 nnre 9192 . . . . . . . . . . . 12  |-  ( A  e.  NN  ->  A  e.  RR )
26 lenlt 8297 . . . . . . . . . . . 12  |-  ( ( x  e.  RR  /\  A  e.  RR )  ->  ( x  <_  A  <->  -.  A  <  x ) )
2720, 25, 26syl2an 289 . . . . . . . . . . 11  |-  ( ( x  e.  NN  /\  A  e.  NN )  ->  ( x  <_  A  <->  -.  A  <  x ) )
2824, 27sylibrd 169 . . . . . . . . . 10  |-  ( ( x  e.  NN  /\  A  e.  NN )  ->  ( ( A  /  x )  e.  ZZ  ->  x  <_  A )
)
2928ancoms 268 . . . . . . . . 9  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( A  /  x )  e.  ZZ  ->  x  <_  A )
)
3019, 29syl5 32 . . . . . . . 8  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( A  /  x )  e.  NN  ->  x  <_  A )
)
3130pm4.71rd 394 . . . . . . 7  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( A  /  x )  e.  NN  <->  ( x  <_  A  /\  ( A  /  x
)  e.  NN ) ) )
3231anbi2d 464 . . . . . 6  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( 1  < 
x  /\  ( A  /  x )  e.  NN ) 
<->  ( 1  <  x  /\  ( x  <_  A  /\  ( A  /  x
)  e.  NN ) ) ) )
33 3anass 1009 . . . . . 6  |-  ( ( 1  <  x  /\  x  <_  A  /\  ( A  /  x )  e.  NN )  <->  ( 1  <  x  /\  (
x  <_  A  /\  ( A  /  x
)  e.  NN ) ) )
3432, 33bitr4di 198 . . . . 5  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( 1  < 
x  /\  ( A  /  x )  e.  NN ) 
<->  ( 1  <  x  /\  x  <_  A  /\  ( A  /  x
)  e.  NN ) ) )
3518, 34bitr3d 190 . . . 4  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( x  =/=  1  /\  ( A  /  x )  e.  NN )  <->  ( 1  <  x  /\  x  <_  A  /\  ( A  /  x )  e.  NN ) ) )
3635imbi1d 231 . . 3  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( ( x  =/=  1  /\  ( A  /  x )  e.  NN )  ->  x  =  A )  <->  ( (
1  <  x  /\  x  <_  A  /\  ( A  /  x )  e.  NN )  ->  x  =  A ) ) )
3715, 36bitrd 188 . 2  |-  ( ( A  e.  NN  /\  x  e.  NN )  ->  ( ( ( A  /  x )  e.  NN  ->  ( x  =  1  \/  x  =  A ) )  <->  ( (
1  <  x  /\  x  <_  A  /\  ( A  /  x )  e.  NN )  ->  x  =  A ) ) )
3837ralbidva 2529 1  |-  ( A  e.  NN  ->  ( A. x  e.  NN  ( ( A  /  x )  e.  NN  ->  ( x  =  1  \/  x  =  A ) )  <->  A. x  e.  NN  ( ( 1  <  x  /\  x  <_  A  /\  ( A  /  x )  e.  NN )  ->  x  =  A ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 716  DECID wdc 842    /\ w3a 1005    = wceq 1398    e. wcel 2202    =/= wne 2403   A.wral 2511   class class class wbr 4093  (class class class)co 6028   RRcr 8074   1c1 8076    < clt 8256    <_ cle 8257    / cdiv 8894   NNcn 9185   ZZcz 9523
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-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192  ax-pre-mulext 8193
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-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-id 4396  df-po 4399  df-iso 4400  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-reap 8797  df-ap 8804  df-div 8895  df-inn 9186  df-n0 9445  df-z 9524
This theorem is referenced by:  infpnlem1  12995
  Copyright terms: Public domain W3C validator