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

Theorem prm23lt5 12786
Description: A prime less than 5 is either 2 or 3. (Contributed by AV, 5-Jul-2021.)
Assertion
Ref Expression
prm23lt5  |-  ( ( P  e.  Prime  /\  P  <  5 )  ->  ( P  =  2  \/  P  =  3 ) )

Proof of Theorem prm23lt5
StepHypRef Expression
1 prmnn 12632 . . . . 5  |-  ( P  e.  Prime  ->  P  e.  NN )
21nnnn0d 9422 . . . 4  |-  ( P  e.  Prime  ->  P  e. 
NN0 )
32adantr 276 . . 3  |-  ( ( P  e.  Prime  /\  P  <  5 )  ->  P  e.  NN0 )
4 4nn0 9388 . . . 4  |-  4  e.  NN0
54a1i 9 . . 3  |-  ( ( P  e.  Prime  /\  P  <  5 )  ->  4  e.  NN0 )
6 df-5 9172 . . . . . 6  |-  5  =  ( 4  +  1 )
76breq2i 4091 . . . . 5  |-  ( P  <  5  <->  P  <  ( 4  +  1 ) )
8 prmz 12633 . . . . . . 7  |-  ( P  e.  Prime  ->  P  e.  ZZ )
9 4z 9476 . . . . . . 7  |-  4  e.  ZZ
10 zleltp1 9502 . . . . . . 7  |-  ( ( P  e.  ZZ  /\  4  e.  ZZ )  ->  ( P  <_  4  <->  P  <  ( 4  +  1 ) ) )
118, 9, 10sylancl 413 . . . . . 6  |-  ( P  e.  Prime  ->  ( P  <_  4  <->  P  <  ( 4  +  1 ) ) )
1211biimprd 158 . . . . 5  |-  ( P  e.  Prime  ->  ( P  <  ( 4  +  1 )  ->  P  <_  4 ) )
137, 12biimtrid 152 . . . 4  |-  ( P  e.  Prime  ->  ( P  <  5  ->  P  <_  4 ) )
1413imp 124 . . 3  |-  ( ( P  e.  Prime  /\  P  <  5 )  ->  P  <_  4 )
15 elfz2nn0 10308 . . 3  |-  ( P  e.  ( 0 ... 4 )  <->  ( P  e.  NN0  /\  4  e. 
NN0  /\  P  <_  4 ) )
163, 5, 14, 15syl3anbrc 1205 . 2  |-  ( ( P  e.  Prime  /\  P  <  5 )  ->  P  e.  ( 0 ... 4
) )
17 fz0to4untppr 10320 . . . 4  |-  ( 0 ... 4 )  =  ( { 0 ,  1 ,  2 }  u.  { 3 ,  4 } )
1817eleq2i 2296 . . 3  |-  ( P  e.  ( 0 ... 4 )  <->  P  e.  ( { 0 ,  1 ,  2 }  u.  { 3 ,  4 } ) )
19 elun 3345 . . . . . 6  |-  ( P  e.  ( { 0 ,  1 ,  2 }  u.  { 3 ,  4 } )  <-> 
( P  e.  {
0 ,  1 ,  2 }  \/  P  e.  { 3 ,  4 } ) )
20 eltpi 3713 . . . . . . . 8  |-  ( P  e.  { 0 ,  1 ,  2 }  ->  ( P  =  0  \/  P  =  1  \/  P  =  2 ) )
21 nnne0 9138 . . . . . . . . . . 11  |-  ( P  e.  NN  ->  P  =/=  0 )
22 eqneqall 2410 . . . . . . . . . . . 12  |-  ( P  =  0  ->  ( P  =/=  0  ->  ( P  =  2  \/  P  =  3 ) ) )
2322com12 30 . . . . . . . . . . 11  |-  ( P  =/=  0  ->  ( P  =  0  ->  ( P  =  2  \/  P  =  3 ) ) )
241, 21, 233syl 17 . . . . . . . . . 10  |-  ( P  e.  Prime  ->  ( P  =  0  ->  ( P  =  2  \/  P  =  3 ) ) )
2524com12 30 . . . . . . . . 9  |-  ( P  =  0  ->  ( P  e.  Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
26 eleq1 2292 . . . . . . . . . 10  |-  ( P  =  1  ->  ( P  e.  Prime  <->  1  e.  Prime ) )
27 1nprm 12636 . . . . . . . . . . 11  |-  -.  1  e.  Prime
2827pm2.21i 649 . . . . . . . . . 10  |-  ( 1  e.  Prime  ->  ( P  =  2  \/  P  =  3 ) )
2926, 28biimtrdi 163 . . . . . . . . 9  |-  ( P  =  1  ->  ( P  e.  Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
30 orc 717 . . . . . . . . . 10  |-  ( P  =  2  ->  ( P  =  2  \/  P  =  3 ) )
3130a1d 22 . . . . . . . . 9  |-  ( P  =  2  ->  ( P  e.  Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
3225, 29, 313jaoi 1337 . . . . . . . 8  |-  ( ( P  =  0  \/  P  =  1  \/  P  =  2 )  ->  ( P  e. 
Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
3320, 32syl 14 . . . . . . 7  |-  ( P  e.  { 0 ,  1 ,  2 }  ->  ( P  e. 
Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
34 elpri 3689 . . . . . . . 8  |-  ( P  e.  { 3 ,  4 }  ->  ( P  =  3  \/  P  =  4 ) )
35 olc 716 . . . . . . . . . 10  |-  ( P  =  3  ->  ( P  =  2  \/  P  =  3 ) )
3635a1d 22 . . . . . . . . 9  |-  ( P  =  3  ->  ( P  e.  Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
37 eleq1 2292 . . . . . . . . . 10  |-  ( P  =  4  ->  ( P  e.  Prime  <->  4  e.  Prime ) )
38 4nprm 12651 . . . . . . . . . . 11  |-  -.  4  e.  Prime
3938pm2.21i 649 . . . . . . . . . 10  |-  ( 4  e.  Prime  ->  ( P  =  2  \/  P  =  3 ) )
4037, 39biimtrdi 163 . . . . . . . . 9  |-  ( P  =  4  ->  ( P  e.  Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
4136, 40jaoi 721 . . . . . . . 8  |-  ( ( P  =  3  \/  P  =  4 )  ->  ( P  e. 
Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
4234, 41syl 14 . . . . . . 7  |-  ( P  e.  { 3 ,  4 }  ->  ( P  e.  Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
4333, 42jaoi 721 . . . . . 6  |-  ( ( P  e.  { 0 ,  1 ,  2 }  \/  P  e. 
{ 3 ,  4 } )  ->  ( P  e.  Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
4419, 43sylbi 121 . . . . 5  |-  ( P  e.  ( { 0 ,  1 ,  2 }  u.  { 3 ,  4 } )  ->  ( P  e. 
Prime  ->  ( P  =  2  \/  P  =  3 ) ) )
4544com12 30 . . . 4  |-  ( P  e.  Prime  ->  ( P  e.  ( { 0 ,  1 ,  2 }  u.  { 3 ,  4 } )  ->  ( P  =  2  \/  P  =  3 ) ) )
4645adantr 276 . . 3  |-  ( ( P  e.  Prime  /\  P  <  5 )  ->  ( P  e.  ( {
0 ,  1 ,  2 }  u.  {
3 ,  4 } )  ->  ( P  =  2  \/  P  =  3 ) ) )
4718, 46biimtrid 152 . 2  |-  ( ( P  e.  Prime  /\  P  <  5 )  ->  ( P  e.  ( 0 ... 4 )  -> 
( P  =  2  \/  P  =  3 ) ) )
4816, 47mpd 13 1  |-  ( ( P  e.  Prime  /\  P  <  5 )  ->  ( P  =  2  \/  P  =  3 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713    \/ w3o 1001    = wceq 1395    e. wcel 2200    =/= wne 2400    u. cun 3195   {cpr 3667   {ctp 3668   class class class wbr 4083  (class class class)co 6001   0cc0 7999   1c1 8000    + caddc 8002    < clt 8181    <_ cle 8182   NNcn 9110   2c2 9161   3c3 9162   4c4 9163   5c5 9164   NN0cn0 9369   ZZcz 9446   ...cfz 10204   Primecprime 12629
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 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-mulrcl 8098  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-precex 8109  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115  ax-pre-mulgt0 8116  ax-pre-mulext 8117  ax-arch 8118  ax-caucvg 8119
This theorem depends on definitions:  df-bi 117  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-tp 3674  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 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-frec 6537  df-1o 6562  df-2o 6563  df-er 6680  df-en 6888  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-reap 8722  df-ap 8729  df-div 8820  df-inn 9111  df-2 9169  df-3 9170  df-4 9171  df-5 9172  df-n0 9370  df-z 9447  df-uz 9723  df-q 9815  df-rp 9850  df-fz 10205  df-seqfrec 10670  df-exp 10761  df-cj 11353  df-re 11354  df-im 11355  df-rsqrt 11509  df-abs 11510  df-dvds 12299  df-prm 12630
This theorem is referenced by:  prm23ge5  12787
  Copyright terms: Public domain W3C validator