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

Theorem q2submod 10646
Description: If a number is between a modulus and twice the modulus, the first number modulo the modulus equals the first number minus the modulus. (Contributed by Jim Kingdon, 25-Oct-2021.)
Assertion
Ref Expression
q2submod  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( A  mod  B )  =  ( A  -  B ) )

Proof of Theorem q2submod
StepHypRef Expression
1 qcn 9867 . . . . . . 7  |-  ( B  e.  QQ  ->  B  e.  CC )
213ad2ant2 1045 . . . . . 6  |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  ->  B  e.  CC )
32adantr 276 . . . . 5  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  B  e.  CC )
43mulridd 8195 . . . 4  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( B  x.  1 )  =  B )
54oveq2d 6033 . . 3  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( A  -  ( B  x.  1
) )  =  ( A  -  B ) )
65oveq1d 6032 . 2  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( ( A  -  ( B  x.  1 ) )  mod 
B )  =  ( ( A  -  B
)  mod  B )
)
7 simpl1 1026 . . 3  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  A  e.  QQ )
8 1zzd 9505 . . 3  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  1  e.  ZZ )
9 simpl2 1027 . . 3  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  B  e.  QQ )
10 simpl3 1028 . . 3  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  0  <  B
)
11 modqcyc2 10621 . . 3  |-  ( ( ( A  e.  QQ  /\  1  e.  ZZ )  /\  ( B  e.  QQ  /\  0  < 
B ) )  -> 
( ( A  -  ( B  x.  1
) )  mod  B
)  =  ( A  mod  B ) )
127, 8, 9, 10, 11syl22anc 1274 . 2  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( ( A  -  ( B  x.  1 ) )  mod 
B )  =  ( A  mod  B ) )
13 qsubcl 9871 . . . 4  |-  ( ( A  e.  QQ  /\  B  e.  QQ )  ->  ( A  -  B
)  e.  QQ )
147, 9, 13syl2anc 411 . . 3  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( A  -  B )  e.  QQ )
15 simpr 110 . . . 4  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( B  <_  A  /\  A  <  (
2  x.  B ) ) )
16 qre 9858 . . . . . . . 8  |-  ( A  e.  QQ  ->  A  e.  RR )
177, 16syl 14 . . . . . . 7  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  A  e.  RR )
18 qre 9858 . . . . . . . 8  |-  ( B  e.  QQ  ->  B  e.  RR )
199, 18syl 14 . . . . . . 7  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  B  e.  RR )
2017, 19subge0d 8714 . . . . . 6  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( 0  <_ 
( A  -  B
)  <->  B  <_  A ) )
2120bicomd 141 . . . . 5  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( B  <_  A 
<->  0  <_  ( A  -  B ) ) )
2232timesd 9386 . . . . . . 7  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( 2  x.  B )  =  ( B  +  B ) )
2322breq2d 4100 . . . . . 6  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( A  < 
( 2  x.  B
)  <->  A  <  ( B  +  B ) ) )
2417, 19, 19ltsubaddd 8720 . . . . . 6  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( ( A  -  B )  < 
B  <->  A  <  ( B  +  B ) ) )
2523, 24bitr4d 191 . . . . 5  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( A  < 
( 2  x.  B
)  <->  ( A  -  B )  <  B
) )
2621, 25anbi12d 473 . . . 4  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( ( B  <_  A  /\  A  <  ( 2  x.  B
) )  <->  ( 0  <_  ( A  -  B )  /\  ( A  -  B )  <  B ) ) )
2715, 26mpbid 147 . . 3  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( 0  <_ 
( A  -  B
)  /\  ( A  -  B )  <  B
) )
28 modqid 10610 . . 3  |-  ( ( ( ( A  -  B )  e.  QQ  /\  B  e.  QQ )  /\  ( 0  <_ 
( A  -  B
)  /\  ( A  -  B )  <  B
) )  ->  (
( A  -  B
)  mod  B )  =  ( A  -  B ) )
2914, 9, 27, 28syl21anc 1272 . 2  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( ( A  -  B )  mod 
B )  =  ( A  -  B ) )
306, 12, 293eqtr3d 2272 1  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B  <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( A  mod  B )  =  ( A  -  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1004    = wceq 1397    e. wcel 2202   class class class wbr 4088  (class class class)co 6017   CCcc 8029   RRcr 8030   0cc0 8031   1c1 8032    + caddc 8034    x. cmul 8036    < clt 8213    <_ cle 8214    - cmin 8349   2c2 9193   ZZcz 9478   QQcq 9852    mod cmo 10583
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149  ax-arch 8150
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-2 9201  df-n0 9402  df-z 9479  df-q 9853  df-rp 9888  df-fl 10529  df-mod 10584
This theorem is referenced by:  modifeq2int  10647  modaddmodup  10648
  Copyright terms: Public domain W3C validator