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

Theorem lcmledvds 12792
Description: A positive integer which both operands of the lcm operator divide bounds it. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 16-Sep-2020.)
Assertion
Ref Expression
lcmledvds  |-  ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0 ) )  -> 
( ( M  ||  K  /\  N  ||  K
)  ->  ( M lcm  N )  <_  K )
)

Proof of Theorem lcmledvds
Dummy variable  n is distinct from all other variables.
StepHypRef Expression
1 lcmn0val 12788 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0 ) )  ->  ( M lcm  N
)  = inf ( { n  e.  NN  | 
( M  ||  n  /\  N  ||  n ) } ,  RR ,  <  ) )
213adantl1 1180 . . . 4  |-  ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0 ) )  -> 
( M lcm  N )  = inf ( { n  e.  NN  |  ( M 
||  n  /\  N  ||  n ) } ,  RR ,  <  ) )
32adantr 276 . . 3  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
( M lcm  N )  = inf ( { n  e.  NN  |  ( M 
||  n  /\  N  ||  n ) } ,  RR ,  <  ) )
4 1zzd 9621 . . . 4  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
1  e.  ZZ )
5 nnuz 9908 . . . . 5  |-  NN  =  ( ZZ>= `  1 )
65rabeqi 2808 . . . 4  |-  { n  e.  NN  |  ( M 
||  n  /\  N  ||  n ) }  =  { n  e.  ( ZZ>=
`  1 )  |  ( M  ||  n  /\  N  ||  n ) }
7 breq2 4118 . . . . . 6  |-  ( n  =  K  ->  ( M  ||  n  <->  M  ||  K
) )
8 breq2 4118 . . . . . 6  |-  ( n  =  K  ->  ( N  ||  n  <->  N  ||  K
) )
97, 8anbi12d 473 . . . . 5  |-  ( n  =  K  ->  (
( M  ||  n  /\  N  ||  n )  <-> 
( M  ||  K  /\  N  ||  K ) ) )
10 simpll1 1063 . . . . 5  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  ->  K  e.  NN )
11 simpr 110 . . . . 5  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
( M  ||  K  /\  N  ||  K ) )
129, 10, 11elrabd 2978 . . . 4  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  ->  K  e.  { n  e.  NN  |  ( M 
||  n  /\  N  ||  n ) } )
13 simpll2 1064 . . . . . . 7  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  ->  M  e.  ZZ )
14 elfzelz 10378 . . . . . . . 8  |-  ( n  e.  ( 1 ... K )  ->  n  e.  ZZ )
1514adantl 277 . . . . . . 7  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  ->  n  e.  ZZ )
16 zdvdsdc 12523 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  n  e.  ZZ )  -> DECID  M 
||  n )
1713, 15, 16syl2anc 411 . . . . . 6  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  -> DECID  M  ||  n )
18 simpll3 1065 . . . . . . 7  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  ->  N  e.  ZZ )
19 zdvdsdc 12523 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  n  e.  ZZ )  -> DECID  N 
||  n )
2018, 15, 19syl2anc 411 . . . . . 6  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  -> DECID  N  ||  n )
2117, 20dcand 941 . . . . 5  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  -> DECID  ( M  ||  n  /\  N  ||  n ) )
2221adantlr 477 . . . 4  |-  ( ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  /\  n  e.  ( 1 ... K ) )  -> DECID 
( M  ||  n  /\  N  ||  n ) )
234, 6, 12, 22infssuzledc 10616 . . 3  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> inf ( { n  e.  NN  |  ( M  ||  n  /\  N  ||  n
) } ,  RR ,  <  )  <_  K
)
243, 23eqbrtrd 4136 . 2  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
( M lcm  N )  <_  K )
2524ex 115 1  |-  ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0 ) )  -> 
( ( M  ||  K  /\  N  ||  K
)  ->  ( M lcm  N )  <_  K )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 716  DECID wdc 842    /\ w3a 1005    = wceq 1398    e. wcel 2205   {crab 2526   class class class wbr 4114   ` cfv 5357  (class class class)co 6058  infcinf 7287   RRcr 8142   0cc0 8143   1c1 8144    < clt 8324    <_ cle 8325   NNcn 9254   ZZcz 9594   ZZ>=cuz 9871   ...cfz 10361    || cdvds 12498   lcm clcm 12782
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262  ax-caucvg 8263
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-isom 5366  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-sup 7288  df-inf 7289  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-n0 9514  df-z 9595  df-uz 9872  df-q 9970  df-rp 10005  df-fz 10362  df-fzo 10499  df-fl 10654  df-mod 10709  df-seqfrec 10834  df-exp 10925  df-cj 11552  df-re 11553  df-im 11554  df-rsqrt 11708  df-abs 11709  df-dvds 12499  df-lcm 12783
This theorem is referenced by:  lcmneg  12796
  Copyright terms: Public domain W3C validator