| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > modqcyc2 | GIF version | ||
| Description: The modulo operation is periodic. (Contributed by Jim Kingdon, 21-Oct-2021.) |
| Ref | Expression |
|---|---|
| modqcyc2 | ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → ((𝐴 − (𝐵 · 𝑁)) mod 𝐵) = (𝐴 mod 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simplr 528 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → 𝑁 ∈ ℤ) | |
| 2 | 1 | zcnd 9495 | . . . . . . 7 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → 𝑁 ∈ ℂ) |
| 3 | qcn 9754 | . . . . . . . 8 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ) | |
| 4 | 3 | ad2antrl 490 | . . . . . . 7 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → 𝐵 ∈ ℂ) |
| 5 | 2, 4 | mulneg1d 8482 | . . . . . 6 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → (-𝑁 · 𝐵) = -(𝑁 · 𝐵)) |
| 6 | mulcom 8053 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐵 · 𝑁) = (𝑁 · 𝐵)) | |
| 7 | 6 | negeqd 8266 | . . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → -(𝐵 · 𝑁) = -(𝑁 · 𝐵)) |
| 8 | 4, 2, 7 | syl2anc 411 | . . . . . 6 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → -(𝐵 · 𝑁) = -(𝑁 · 𝐵)) |
| 9 | 5, 8 | eqtr4d 2240 | . . . . 5 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → (-𝑁 · 𝐵) = -(𝐵 · 𝑁)) |
| 10 | 9 | oveq2d 5959 | . . . 4 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → (𝐴 + (-𝑁 · 𝐵)) = (𝐴 + -(𝐵 · 𝑁))) |
| 11 | qcn 9754 | . . . . . 6 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℂ) | |
| 12 | 11 | ad2antrr 488 | . . . . 5 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → 𝐴 ∈ ℂ) |
| 13 | 4, 2 | mulcld 8092 | . . . . 5 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → (𝐵 · 𝑁) ∈ ℂ) |
| 14 | 12, 13 | negsubd 8388 | . . . 4 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → (𝐴 + -(𝐵 · 𝑁)) = (𝐴 − (𝐵 · 𝑁))) |
| 15 | 10, 14 | eqtr2d 2238 | . . 3 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → (𝐴 − (𝐵 · 𝑁)) = (𝐴 + (-𝑁 · 𝐵))) |
| 16 | 15 | oveq1d 5958 | . 2 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → ((𝐴 − (𝐵 · 𝑁)) mod 𝐵) = ((𝐴 + (-𝑁 · 𝐵)) mod 𝐵)) |
| 17 | znegcl 9402 | . . 3 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) | |
| 18 | modqcyc 10502 | . . 3 ⊢ (((𝐴 ∈ ℚ ∧ -𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → ((𝐴 + (-𝑁 · 𝐵)) mod 𝐵) = (𝐴 mod 𝐵)) | |
| 19 | 17, 18 | sylanl2 403 | . 2 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → ((𝐴 + (-𝑁 · 𝐵)) mod 𝐵) = (𝐴 mod 𝐵)) |
| 20 | 16, 19 | eqtrd 2237 | 1 ⊢ (((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) ∧ (𝐵 ∈ ℚ ∧ 0 < 𝐵)) → ((𝐴 − (𝐵 · 𝑁)) mod 𝐵) = (𝐴 mod 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1372 ∈ wcel 2175 class class class wbr 4043 (class class class)co 5943 ℂcc 7922 0cc0 7924 + caddc 7927 · cmul 7929 < clt 8106 − cmin 8242 -cneg 8243 ℤcz 9371 ℚcq 9739 mod cmo 10465 |
| 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-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4479 ax-setind 4584 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 |
| This theorem depends on definitions: df-bi 117 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-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-id 4339 df-po 4342 df-iso 4343 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-fv 5278 df-riota 5898 df-ov 5946 df-oprab 5947 df-mpo 5948 df-1st 6225 df-2nd 6226 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-n0 9295 df-z 9372 df-q 9740 df-rp 9775 df-fl 10411 df-mod 10466 |
| This theorem is referenced by: modqadd1 10504 modqmul1 10520 q2submod 10528 modqsubdir 10536 |
| Copyright terms: Public domain | W3C validator |