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

Theorem dvdsbnd 12219
Description: There is an upper bound to the divisors of a nonzero integer. (Contributed by Jim Kingdon, 11-Dec-2021.)
Assertion
Ref Expression
dvdsbnd  |-  ( ( A  e.  ZZ  /\  A  =/=  0 )  ->  E. n  e.  NN  A. m  e.  ( ZZ>= `  n )  -.  m  ||  A )
Distinct variable group:    A, m, n

Proof of Theorem dvdsbnd
StepHypRef Expression
1 simpl 109 . . . . 5  |-  ( ( A  e.  ZZ  /\  A  =/=  0 )  ->  A  e.  ZZ )
21zcnd 9495 . . . 4  |-  ( ( A  e.  ZZ  /\  A  =/=  0 )  ->  A  e.  CC )
32abscld 11434 . . 3  |-  ( ( A  e.  ZZ  /\  A  =/=  0 )  -> 
( abs `  A
)  e.  RR )
4 arch 9291 . . 3  |-  ( ( abs `  A )  e.  RR  ->  E. n  e.  NN  ( abs `  A
)  <  n )
53, 4syl 14 . 2  |-  ( ( A  e.  ZZ  /\  A  =/=  0 )  ->  E. n  e.  NN  ( abs `  A )  <  n )
63ad3antrrr 492 . . . . . . . 8  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  ( abs `  A )  e.  RR )
7 simpllr 534 . . . . . . . . 9  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  n  e.  NN )
87nnred 9048 . . . . . . . 8  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  n  e.  RR )
9 eluzelz 9656 . . . . . . . . . 10  |-  ( m  e.  ( ZZ>= `  n
)  ->  m  e.  ZZ )
109adantl 277 . . . . . . . . 9  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  m  e.  ZZ )
1110zred 9494 . . . . . . . 8  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  m  e.  RR )
12 simplr 528 . . . . . . . 8  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  ( abs `  A )  <  n
)
13 eluzle 9659 . . . . . . . . 9  |-  ( m  e.  ( ZZ>= `  n
)  ->  n  <_  m )
1413adantl 277 . . . . . . . 8  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  n  <_  m )
156, 8, 11, 12, 14ltletrd 8495 . . . . . . 7  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  ( abs `  A )  <  m
)
16 zabscl 11339 . . . . . . . . 9  |-  ( A  e.  ZZ  ->  ( abs `  A )  e.  ZZ )
1716ad4antr 494 . . . . . . . 8  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  ( abs `  A )  e.  ZZ )
18 zltnle 9417 . . . . . . . 8  |-  ( ( ( abs `  A
)  e.  ZZ  /\  m  e.  ZZ )  ->  ( ( abs `  A
)  <  m  <->  -.  m  <_  ( abs `  A
) ) )
1917, 10, 18syl2anc 411 . . . . . . 7  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  ( ( abs `  A )  < 
m  <->  -.  m  <_  ( abs `  A ) ) )
2015, 19mpbid 147 . . . . . 6  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  -.  m  <_  ( abs `  A
) )
211ad3antrrr 492 . . . . . . 7  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  A  e.  ZZ )
22 simplr 528 . . . . . . . 8  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  ->  A  =/=  0
)
2322ad2antrr 488 . . . . . . 7  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  A  =/=  0 )
24 dvdsleabs 12098 . . . . . . . 8  |-  ( ( m  e.  ZZ  /\  A  e.  ZZ  /\  A  =/=  0 )  ->  (
m  ||  A  ->  m  <_  ( abs `  A
) ) )
2524con3d 632 . . . . . . 7  |-  ( ( m  e.  ZZ  /\  A  e.  ZZ  /\  A  =/=  0 )  ->  ( -.  m  <_  ( abs `  A )  ->  -.  m  ||  A ) )
2610, 21, 23, 25syl3anc 1249 . . . . . 6  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  ( -.  m  <_  ( abs `  A
)  ->  -.  m  ||  A ) )
2720, 26mpd 13 . . . . 5  |-  ( ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  /\  m  e.  ( ZZ>= `  n )
)  ->  -.  m  ||  A )
2827ralrimiva 2578 . . . 4  |-  ( ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  /\  ( abs `  A )  < 
n )  ->  A. m  e.  ( ZZ>= `  n )  -.  m  ||  A )
2928ex 115 . . 3  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  n  e.  NN )  ->  ( ( abs `  A )  <  n  ->  A. m  e.  (
ZZ>= `  n )  -.  m  ||  A ) )
3029reximdva 2607 . 2  |-  ( ( A  e.  ZZ  /\  A  =/=  0 )  -> 
( E. n  e.  NN  ( abs `  A
)  <  n  ->  E. n  e.  NN  A. m  e.  ( ZZ>= `  n )  -.  m  ||  A ) )
315, 30mpd 13 1  |-  ( ( A  e.  ZZ  /\  A  =/=  0 )  ->  E. n  e.  NN  A. m  e.  ( ZZ>= `  n )  -.  m  ||  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 980    e. wcel 2175    =/= wne 2375   A.wral 2483   E.wrex 2484   class class class wbr 4043   ` cfv 5270   RRcr 7923   0cc0 7924    < clt 8106    <_ cle 8107   NNcn 9035   ZZcz 9371   ZZ>=cuz 9647   abscabs 11250    || cdvds 12040
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 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-nul 4169  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-iinf 4635  ax-cnex 8015  ax-resscn 8016  ax-1cn 8017  ax-1re 8018  ax-icn 8019  ax-addcl 8020  ax-addrcl 8021  ax-mulcl 8022  ax-mulrcl 8023  ax-addcom 8024  ax-mulcom 8025  ax-addass 8026  ax-mulass 8027  ax-distr 8028  ax-i2m1 8029  ax-0lt1 8030  ax-1rid 8031  ax-0id 8032  ax-rnegex 8033  ax-precex 8034  ax-cnre 8035  ax-pre-ltirr 8036  ax-pre-ltwlin 8037  ax-pre-lttrn 8038  ax-pre-apti 8039  ax-pre-ltadd 8040  ax-pre-mulgt0 8041  ax-pre-mulext 8042  ax-arch 8043  ax-caucvg 8044
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-nel 2471  df-ral 2488  df-rex 2489  df-reu 2490  df-rmo 2491  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-if 3571  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-tr 4142  df-id 4339  df-po 4342  df-iso 4343  df-iord 4412  df-on 4414  df-ilim 4415  df-suc 4417  df-iom 4638  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-riota 5898  df-ov 5946  df-oprab 5947  df-mpo 5948  df-1st 6225  df-2nd 6226  df-recs 6390  df-frec 6476  df-pnf 8108  df-mnf 8109  df-xr 8110  df-ltxr 8111  df-le 8112  df-sub 8244  df-neg 8245  df-reap 8647  df-ap 8654  df-div 8745  df-inn 9036  df-2 9094  df-3 9095  df-4 9096  df-n0 9295  df-z 9372  df-uz 9648  df-q 9740  df-rp 9775  df-seqfrec 10591  df-exp 10682  df-cj 11095  df-re 11096  df-im 11097  df-rsqrt 11251  df-abs 11252  df-dvds 12041
This theorem is referenced by:  gcdsupex  12220  gcdsupcl  12221
  Copyright terms: Public domain W3C validator