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

Theorem lcmledvds 12053
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 12049 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0 ) )  ->  ( M lcm  N
)  = inf ( { n  e.  NN  | 
( M  ||  n  /\  N  ||  n ) } ,  RR ,  <  ) )
213adantl1 1153 . . . 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 9269 . . . 4  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
1  e.  ZZ )
5 nnuz 9552 . . . . 5  |-  NN  =  ( ZZ>= `  1 )
6 rabeq 2729 . . . . 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 1036 . . . . 5  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  ->  K  e.  NN )
9 simpr 110 . . . . 5  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
( M  ||  K  /\  N  ||  K ) )
10 breq2 4004 . . . . . . 7  |-  ( n  =  K  ->  ( M  ||  n  <->  M  ||  K
) )
11 breq2 4004 . . . . . . 7  |-  ( n  =  K  ->  ( N  ||  n  <->  N  ||  K
) )
1210, 11anbi12d 473 . . . . . 6  |-  ( n  =  K  ->  (
( M  ||  n  /\  N  ||  n )  <-> 
( M  ||  K  /\  N  ||  K ) ) )
1312elrab 2893 . . . . 5  |-  ( K  e.  { n  e.  NN  |  ( M 
||  n  /\  N  ||  n ) }  <->  ( K  e.  NN  /\  ( M 
||  K  /\  N  ||  K ) ) )
148, 9, 13sylanbrc 417 . . . 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 1037 . . . . . . 7  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  ->  M  e.  ZZ )
16 elfzelz 10011 . . . . . . . 8  |-  ( n  e.  ( 1 ... K )  ->  n  e.  ZZ )
1716adantl 277 . . . . . . 7  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  ->  n  e.  ZZ )
18 zdvdsdc 11803 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  n  e.  ZZ )  -> DECID  M 
||  n )
1915, 17, 18syl2anc 411 . . . . . 6  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  -> DECID  M  ||  n )
20 simpll3 1038 . . . . . . 7  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  ->  N  e.  ZZ )
21 zdvdsdc 11803 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  n  e.  ZZ )  -> DECID  N 
||  n )
2220, 17, 21syl2anc 411 . . . . . 6  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  n  e.  ( 1 ... K
) )  -> DECID  N  ||  n )
23 dcan2 934 . . . . . 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 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 ) )
264, 7, 14, 25infssuzledc 11934 . . 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 4022 . 2  |-  ( ( ( ( K  e.  NN  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( M  =  0  \/  N  =  0
) )  /\  ( M  ||  K  /\  N  ||  K ) )  -> 
( M lcm  N )  <_  K )
2827ex 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 708  DECID wdc 834    /\ w3a 978    = wceq 1353    e. wcel 2148   {crab 2459   class class class wbr 4000   ` cfv 5212  (class class class)co 5869  infcinf 6976   RRcr 7801   0cc0 7802   1c1 7803    < clt 7982    <_ cle 7983   NNcn 8908   ZZcz 9242   ZZ>=cuz 9517   ...cfz 9995    || cdvds 11778   lcm clcm 12043
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584  ax-cnex 7893  ax-resscn 7894  ax-1cn 7895  ax-1re 7896  ax-icn 7897  ax-addcl 7898  ax-addrcl 7899  ax-mulcl 7900  ax-mulrcl 7901  ax-addcom 7902  ax-mulcom 7903  ax-addass 7904  ax-mulass 7905  ax-distr 7906  ax-i2m1 7907  ax-0lt1 7908  ax-1rid 7909  ax-0id 7910  ax-rnegex 7911  ax-precex 7912  ax-cnre 7913  ax-pre-ltirr 7914  ax-pre-ltwlin 7915  ax-pre-lttrn 7916  ax-pre-apti 7917  ax-pre-ltadd 7918  ax-pre-mulgt0 7919  ax-pre-mulext 7920  ax-arch 7921  ax-caucvg 7922
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4290  df-po 4293  df-iso 4294  df-iord 4363  df-on 4365  df-ilim 4366  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-isom 5221  df-riota 5825  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-frec 6386  df-sup 6977  df-inf 6978  df-pnf 7984  df-mnf 7985  df-xr 7986  df-ltxr 7987  df-le 7988  df-sub 8120  df-neg 8121  df-reap 8522  df-ap 8529  df-div 8619  df-inn 8909  df-2 8967  df-3 8968  df-4 8969  df-n0 9166  df-z 9243  df-uz 9518  df-q 9609  df-rp 9641  df-fz 9996  df-fzo 10129  df-fl 10256  df-mod 10309  df-seqfrec 10432  df-exp 10506  df-cj 10835  df-re 10836  df-im 10837  df-rsqrt 10991  df-abs 10992  df-dvds 11779  df-lcm 12044
This theorem is referenced by:  lcmneg  12057
  Copyright terms: Public domain W3C validator