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

Theorem congr 12752
Description: Definition of congruence by integer multiple (see ProofWiki "Congruence (Number Theory)", 11-Jul-2021, https://proofwiki.org/wiki/Definition:Congruence_(Number_Theory)): An integer  A is congruent to an integer  B modulo  M if their difference is a multiple of 
M. See also the definition in [ApostolNT] p. 104: "...  a is congruent to  b modulo  m, and we write  a  ==  b (mod  m) if  m divides the difference  a  -  b", or Wikipedia "Modular arithmetic - Congruence", https://en.wikipedia.org/wiki/Modular_arithmetic#Congruence, 11-Jul-2021,: "Given an integer n > 1, called a modulus, two integers are said to be congruent modulo n, if n is a divisor of their difference (i.e., if there is an integer k such that a-b = kn)". (Contributed by AV, 11-Jul-2021.)
Assertion
Ref Expression
congr  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  M  e.  NN )  ->  (
( A  mod  M
)  =  ( B  mod  M )  <->  E. n  e.  ZZ  ( n  x.  M )  =  ( A  -  B ) ) )
Distinct variable groups:    A, n    B, n    n, M

Proof of Theorem congr
StepHypRef Expression
1 moddvds 12440 . . 3  |-  ( ( M  e.  NN  /\  A  e.  ZZ  /\  B  e.  ZZ )  ->  (
( A  mod  M
)  =  ( B  mod  M )  <->  M  ||  ( A  -  B )
) )
213coml 1237 . 2  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  M  e.  NN )  ->  (
( A  mod  M
)  =  ( B  mod  M )  <->  M  ||  ( A  -  B )
) )
3 simp3 1026 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  M  e.  NN )  ->  M  e.  NN )
43nnzd 9662 . . 3  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  M  e.  NN )  ->  M  e.  ZZ )
5 zsubcl 9581 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  -  B
)  e.  ZZ )
653adant3 1044 . . 3  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  M  e.  NN )  ->  ( A  -  B )  e.  ZZ )
7 divides 12430 . . 3  |-  ( ( M  e.  ZZ  /\  ( A  -  B
)  e.  ZZ )  ->  ( M  ||  ( A  -  B
)  <->  E. n  e.  ZZ  ( n  x.  M
)  =  ( A  -  B ) ) )
84, 6, 7syl2anc 411 . 2  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  M  e.  NN )  ->  ( M  ||  ( A  -  B )  <->  E. n  e.  ZZ  ( n  x.  M )  =  ( A  -  B ) ) )
92, 8bitrd 188 1  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  M  e.  NN )  ->  (
( A  mod  M
)  =  ( B  mod  M )  <->  E. n  e.  ZZ  ( n  x.  M )  =  ( A  -  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2202   E.wrex 2512   class class class wbr 4093  (class class class)co 6028    x. cmul 8097    - cmin 8409   NNcn 9202   ZZcz 9540    mod cmo 10647    || cdvds 12428
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210  ax-arch 8211
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-po 4399  df-iso 4400  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-inn 9203  df-n0 9462  df-z 9541  df-q 9915  df-rp 9950  df-fl 10593  df-mod 10648  df-dvds 12429
This theorem is referenced by:  cncongr1  12755
  Copyright terms: Public domain W3C validator