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

Theorem lcmledvds 12024
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 12020 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0 ) )  ->  ( M lcm  N
)  = inf ( { n  e.  NN  | 
( M  ||  n  /\  N  ||  n ) } ,  RR ,  <  ) )
213adantl1 1148 . . . 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 274 . . 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 9239 . . . 4  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
1  e.  ZZ )
5 nnuz 9522 . . . . 5  |-  NN  =  ( ZZ>= `  1 )
6 rabeq 2722 . . . . 5  |-  ( NN  =  ( ZZ>= `  1
)  ->  { n  e.  NN  |  ( M 
||  n  /\  N  ||  n ) }  =  { n  e.  ( ZZ>=
`  1 )  |  ( M  ||  n  /\  N  ||  n ) } )
75, 6ax-mp 5 . . . 4  |-  { n  e.  NN  |  ( M 
||  n  /\  N  ||  n ) }  =  { n  e.  ( ZZ>=
`  1 )  |  ( M  ||  n  /\  N  ||  n ) }
8 simpll1 1031 . . . . 5  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  ->  K  e.  NN )
9 simpr 109 . . . . 5  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
( M  ||  K  /\  N  ||  K ) )
10 breq2 3993 . . . . . . 7  |-  ( n  =  K  ->  ( M  ||  n  <->  M  ||  K
) )
11 breq2 3993 . . . . . . 7  |-  ( n  =  K  ->  ( N  ||  n  <->  N  ||  K
) )
1210, 11anbi12d 470 . . . . . 6  |-  ( n  =  K  ->  (
( M  ||  n  /\  N  ||  n )  <-> 
( M  ||  K  /\  N  ||  K ) ) )
1312elrab 2886 . . . . 5  |-  ( K  e.  { n  e.  NN  |  ( M 
||  n  /\  N  ||  n ) }  <->  ( K  e.  NN  /\  ( M 
||  K  /\  N  ||  K ) ) )
148, 9, 13sylanbrc 415 . . . 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 ) } )
15 simpll2 1032 . . . . . . 7  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  ->  M  e.  ZZ )
16 elfzelz 9981 . . . . . . . 8  |-  ( n  e.  ( 1 ... K )  ->  n  e.  ZZ )
1716adantl 275 . . . . . . 7  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  ->  n  e.  ZZ )
18 zdvdsdc 11774 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  n  e.  ZZ )  -> DECID  M 
||  n )
1915, 17, 18syl2anc 409 . . . . . 6  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  -> DECID  M  ||  n )
20 simpll3 1033 . . . . . . 7  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  ->  N  e.  ZZ )
21 zdvdsdc 11774 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  n  e.  ZZ )  -> DECID  N 
||  n )
2220, 17, 21syl2anc 409 . . . . . 6  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  -> DECID  N  ||  n )
23 dcan2 929 . . . . . 6  |-  (DECID  M  ||  n  ->  (DECID  N  ||  n  -> DECID  ( M  ||  n  /\  N  ||  n ) ) )
2419, 22, 23sylc 62 . . . . 5  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  -> DECID  ( M  ||  n  /\  N  ||  n ) )
2524adantlr 474 . . . 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 ) )
264, 7, 14, 25infssuzledc 11905 . . 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
)
273, 26eqbrtrd 4011 . 2  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
( M lcm  N )  <_  K )
2827ex 114 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 103    \/ wo 703  DECID wdc 829    /\ w3a 973    = wceq 1348    e. wcel 2141   {crab 2452   class class class wbr 3989   ` cfv 5198  (class class class)co 5853  infcinf 6960   RRcr 7773   0cc0 7774   1c1 7775    < clt 7954    <_ cle 7955   NNcn 8878   ZZcz 9212   ZZ>=cuz 9487   ...cfz 9965    || cdvds 11749   lcm clcm 12014
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892  ax-arch 7893  ax-caucvg 7894
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-isom 5207  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-frec 6370  df-sup 6961  df-inf 6962  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-reap 8494  df-ap 8501  df-div 8590  df-inn 8879  df-2 8937  df-3 8938  df-4 8939  df-n0 9136  df-z 9213  df-uz 9488  df-q 9579  df-rp 9611  df-fz 9966  df-fzo 10099  df-fl 10226  df-mod 10279  df-seqfrec 10402  df-exp 10476  df-cj 10806  df-re 10807  df-im 10808  df-rsqrt 10962  df-abs 10963  df-dvds 11750  df-lcm 12015
This theorem is referenced by:  lcmneg  12028
  Copyright terms: Public domain W3C validator