ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  zdvdsdc Unicode version
Theorem zdvdsdc 12579
Description: Divisibility of integers is decidable. (Contributed by Jim Kingdon, 17-Jan-2022.)
Assertion
Ref Expression
zdvdsdc |- ( ( M e. ZZ /\ N e. ZZ ) -> DECID M || N )
Proof of Theorem zdvdsdc
StepHypRef Expression
1 simpll 531 . . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> M e. ZZ )
21znegcld 9770 . . . . 5 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> -u M e. ZZ )
3 simpr 110 . . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> M < 0 )
41zred 9768 . . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> M e. RR )
54lt0neg1d 8843 . . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> ( M < 0 <-> 0 < -u M ) )
63, 5mpbid 147 . . . . 5 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> 0 < -u M )
7 elnnz 9654 . . . . 5 |- ( -u M e. NN <-> ( -u M e. ZZ /\ 0 < -u M ) )
82, 6, 7sylanbrc 421 . . . 4 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> -u M e. NN )
9 simplr 533 . . . 4 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> N e. ZZ )
10 dvdsdc 12565 . . . 4 |- ( ( -u M e. NN /\ N e. ZZ ) -> DECID -u M || N )
118, 9, 10syl2anc 415 . . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> DECID -u M || N )
12 negdvdsb 12574 . . . . 5 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M || N <-> -u M || N ) )
1312adantr 276 . . . 4 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> ( M || N <-> -u M || N ) )
1413dcbid 850 . . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> (DECID M || N <-> DECID -u M || N ) )
1511, 14mpbird 167 . 2 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M < 0 ) -> DECID M || N )
16 0z 9655 . . . . 5 |- 0 e. ZZ
17 zdceq 9720 . . . . 5 |- ( ( N e. ZZ /\ 0 e. ZZ ) -> DECID N = 0 )
1816, 17mpan2 429 . . . 4 |- ( N e. ZZ -> DECID N = 0 )
1918ad2antlr 493 . . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M = 0 ) -> DECID N = 0 )
20 breq1 4133 . . . . . 6 |- ( M = 0 -> ( M || N <-> 0 || N ) )
2120adantl 277 . . . . 5 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M = 0 ) -> ( M || N <-> 0 || N ) )
22 0dvds 12578 . . . . . 6 |- ( N e. ZZ -> ( 0 || N <-> N = 0 ) )
2322ad2antlr 493 . . . . 5 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M = 0 ) -> ( 0 || N <-> N = 0 ) )
2421, 23bitrd 188 . . . 4 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M = 0 ) -> ( M || N <-> N = 0 ) )
2524dcbid 850 . . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M = 0 ) -> (DECID M || N <-> DECID N = 0 ) )
2619, 25mpbird 167 . 2 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ M = 0 ) -> DECID M || N )
27 simpll 531 . . . 4 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ 0 < M ) -> M e. ZZ )
28 simpr 110 . . . 4 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ 0 < M ) -> 0 < M )
29 elnnz 9654 . . . 4 |- ( M e. NN <-> ( M e. ZZ /\ 0 < M ) )
3027, 28, 29sylanbrc 421 . . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ 0 < M ) -> M e. NN )
31 simplr 533 . . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ 0 < M ) -> N e. ZZ )
32 dvdsdc 12565 . . 3 |- ( ( M e. NN /\ N e. ZZ ) -> DECID M || N )
3330, 31, 32syl2anc 415 . 2 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ 0 < M ) -> DECID M || N )
34 ztri3or0 9686 . . 3 |- ( M e. ZZ -> ( M < 0 \/ M = 0 \/ 0 < M ) )
3534adantr 276 . 2 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M < 0 \/ M = 0 \/ 0 < M ) )
3615, 26, 33, 35mpjao3dan 1348 1 |- ( ( M e. ZZ /\ N e. ZZ ) -> DECID M || N )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 846   \/ w3o 1008   = wceq 1402   e. wcel 2209   class class class wbr 4130   0cc0 8179   < clt 8360   -ucneg 8498   NNcn 9304   ZZcz 9644   || cdvds 12554
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645  df-q 10020  df-rp 10055  df-fl 10705  df-mod 10760  df-dvds 12555
This theorem is used by:  lcmval  12841  lcmcllem  12845  lcmledvds  12848  phiprmpw  13000  pclemdc  13067  pc2dvds  13109  unennn  13288
  Copyright terms: Public domain W3C validator