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

Theorem dvdsprime 12812
Description: If  M divides a prime, then  M is either the prime or one. (Contributed by Scott Fenton, 8-Apr-2014.)
Assertion
Ref Expression
dvdsprime  |-  ( ( P  e.  Prime  /\  M  e.  NN )  ->  ( M  ||  P  <->  ( M  =  P  \/  M  =  1 ) ) )

Proof of Theorem dvdsprime
Dummy variable  m is distinct from all other variables.
StepHypRef Expression
1 isprm2 12807 . . 3  |-  ( P  e.  Prime  <->  ( P  e.  ( ZZ>= `  2 )  /\  A. m  e.  NN  ( m  ||  P  -> 
( m  =  1  \/  m  =  P ) ) ) )
2 breq1 4111 . . . . . 6  |-  ( m  =  M  ->  (
m  ||  P  <->  M  ||  P
) )
3 eqeq1 2239 . . . . . . . 8  |-  ( m  =  M  ->  (
m  =  1  <->  M  =  1 ) )
4 eqeq1 2239 . . . . . . . 8  |-  ( m  =  M  ->  (
m  =  P  <->  M  =  P ) )
53, 4orbi12d 801 . . . . . . 7  |-  ( m  =  M  ->  (
( m  =  1  \/  m  =  P )  <->  ( M  =  1  \/  M  =  P ) ) )
6 orcom 736 . . . . . . 7  |-  ( ( M  =  1  \/  M  =  P )  <-> 
( M  =  P  \/  M  =  1 ) )
75, 6bitrdi 196 . . . . . 6  |-  ( m  =  M  ->  (
( m  =  1  \/  m  =  P )  <->  ( M  =  P  \/  M  =  1 ) ) )
82, 7imbi12d 234 . . . . 5  |-  ( m  =  M  ->  (
( m  ||  P  ->  ( m  =  1  \/  m  =  P ) )  <->  ( M  ||  P  ->  ( M  =  P  \/  M  =  1 ) ) ) )
98rspccva 2919 . . . 4  |-  ( ( A. m  e.  NN  ( m  ||  P  -> 
( m  =  1  \/  m  =  P ) )  /\  M  e.  NN )  ->  ( M  ||  P  ->  ( M  =  P  \/  M  =  1 ) ) )
109adantll 476 . . 3  |-  ( ( ( P  e.  (
ZZ>= `  2 )  /\  A. m  e.  NN  (
m  ||  P  ->  ( m  =  1  \/  m  =  P ) ) )  /\  M  e.  NN )  ->  ( M  ||  P  ->  ( M  =  P  \/  M  =  1 ) ) )
111, 10sylanb 284 . 2  |-  ( ( P  e.  Prime  /\  M  e.  NN )  ->  ( M  ||  P  ->  ( M  =  P  \/  M  =  1 ) ) )
12 prmz 12801 . . . . . 6  |-  ( P  e.  Prime  ->  P  e.  ZZ )
13 iddvds 12483 . . . . . 6  |-  ( P  e.  ZZ  ->  P  ||  P )
1412, 13syl 14 . . . . 5  |-  ( P  e.  Prime  ->  P  ||  P )
1514adantr 276 . . . 4  |-  ( ( P  e.  Prime  /\  M  e.  NN )  ->  P  ||  P )
16 breq1 4111 . . . 4  |-  ( M  =  P  ->  ( M  ||  P  <->  P  ||  P
) )
1715, 16syl5ibrcom 157 . . 3  |-  ( ( P  e.  Prime  /\  M  e.  NN )  ->  ( M  =  P  ->  M 
||  P ) )
18 1dvds 12484 . . . . . 6  |-  ( P  e.  ZZ  ->  1  ||  P )
1912, 18syl 14 . . . . 5  |-  ( P  e.  Prime  ->  1  ||  P )
2019adantr 276 . . . 4  |-  ( ( P  e.  Prime  /\  M  e.  NN )  ->  1  ||  P )
21 breq1 4111 . . . 4  |-  ( M  =  1  ->  ( M  ||  P  <->  1  ||  P ) )
2220, 21syl5ibrcom 157 . . 3  |-  ( ( P  e.  Prime  /\  M  e.  NN )  ->  ( M  =  1  ->  M 
||  P ) )
2317, 22jaod 725 . 2  |-  ( ( P  e.  Prime  /\  M  e.  NN )  ->  (
( M  =  P  \/  M  =  1 )  ->  M  ||  P
) )
2411, 23impbid 129 1  |-  ( ( P  e.  Prime  /\  M  e.  NN )  ->  ( M  ||  P  <->  ( M  =  P  \/  M  =  1 ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 716    = wceq 1398    e. wcel 2203   A.wral 2520   class class class wbr 4108   ` cfv 5351   1c1 8124   NNcn 9233   2c2 9284   ZZcz 9573   ZZ>=cuz 9849    || cdvds 12466   Primecprime 12797
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-mulrcl 8222  ax-addcom 8223  ax-mulcom 8224  ax-addass 8225  ax-mulass 8226  ax-distr 8227  ax-i2m1 8228  ax-0lt1 8229  ax-1rid 8230  ax-0id 8231  ax-rnegex 8232  ax-precex 8233  ax-cnre 8234  ax-pre-ltirr 8235  ax-pre-ltwlin 8236  ax-pre-lttrn 8237  ax-pre-apti 8238  ax-pre-ltadd 8239  ax-pre-mulgt0 8240  ax-pre-mulext 8241  ax-arch 8242  ax-caucvg 8243
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 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-id 4413  df-po 4416  df-iso 4417  df-iord 4486  df-on 4488  df-ilim 4489  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-frec 6621  df-1o 6646  df-2o 6647  df-er 6766  df-en 6975  df-pnf 8306  df-mnf 8307  df-xr 8308  df-ltxr 8309  df-le 8310  df-sub 8442  df-neg 8443  df-reap 8845  df-ap 8852  df-div 8943  df-inn 9234  df-2 9292  df-3 9293  df-4 9294  df-n0 9493  df-z 9574  df-uz 9850  df-q 9948  df-rp 9983  df-seqfrec 10806  df-exp 10897  df-cj 11520  df-re 11521  df-im 11522  df-rsqrt 11676  df-abs 11677  df-dvds 12467  df-prm 12798
This theorem is referenced by:  prm2orodd  12816  pythagtriplem4  12959  2lgs  15964
  Copyright terms: Public domain W3C validator