![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > modmuladdim | Structured version Visualization version GIF version |
Description: Implication of a decomposition of an integer into a multiple of a modulus and a remainder. (Contributed by AV, 14-Jul-2021.) |
Ref | Expression |
---|---|
modmuladdim | ⊢ ((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) → ((𝐴 mod 𝑀) = 𝐵 → ∃𝑘 ∈ ℤ 𝐴 = ((𝑘 · 𝑀) + 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zre 12609 | . . . . . 6 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
2 | modelico 13896 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℝ+) → (𝐴 mod 𝑀) ∈ (0[,)𝑀)) | |
3 | 1, 2 | sylan 578 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) → (𝐴 mod 𝑀) ∈ (0[,)𝑀)) |
4 | 3 | adantr 479 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ (𝐴 mod 𝑀) = 𝐵) → (𝐴 mod 𝑀) ∈ (0[,)𝑀)) |
5 | eleq1 2813 | . . . . 5 ⊢ ((𝐴 mod 𝑀) = 𝐵 → ((𝐴 mod 𝑀) ∈ (0[,)𝑀) ↔ 𝐵 ∈ (0[,)𝑀))) | |
6 | 5 | adantl 480 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ (𝐴 mod 𝑀) = 𝐵) → ((𝐴 mod 𝑀) ∈ (0[,)𝑀) ↔ 𝐵 ∈ (0[,)𝑀))) |
7 | 4, 6 | mpbid 231 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ (𝐴 mod 𝑀) = 𝐵) → 𝐵 ∈ (0[,)𝑀)) |
8 | simpll 765 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ 𝐵 ∈ (0[,)𝑀)) → 𝐴 ∈ ℤ) | |
9 | simpr 483 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ 𝐵 ∈ (0[,)𝑀)) → 𝐵 ∈ (0[,)𝑀)) | |
10 | simpr 483 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) → 𝑀 ∈ ℝ+) | |
11 | 10 | adantr 479 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ 𝐵 ∈ (0[,)𝑀)) → 𝑀 ∈ ℝ+) |
12 | modmuladd 13928 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (0[,)𝑀) ∧ 𝑀 ∈ ℝ+) → ((𝐴 mod 𝑀) = 𝐵 ↔ ∃𝑘 ∈ ℤ 𝐴 = ((𝑘 · 𝑀) + 𝐵))) | |
13 | 8, 9, 11, 12 | syl3anc 1368 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ 𝐵 ∈ (0[,)𝑀)) → ((𝐴 mod 𝑀) = 𝐵 ↔ ∃𝑘 ∈ ℤ 𝐴 = ((𝑘 · 𝑀) + 𝐵))) |
14 | 13 | biimpd 228 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ 𝐵 ∈ (0[,)𝑀)) → ((𝐴 mod 𝑀) = 𝐵 → ∃𝑘 ∈ ℤ 𝐴 = ((𝑘 · 𝑀) + 𝐵))) |
15 | 14 | impancom 450 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ (𝐴 mod 𝑀) = 𝐵) → (𝐵 ∈ (0[,)𝑀) → ∃𝑘 ∈ ℤ 𝐴 = ((𝑘 · 𝑀) + 𝐵))) |
16 | 7, 15 | mpd 15 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) ∧ (𝐴 mod 𝑀) = 𝐵) → ∃𝑘 ∈ ℤ 𝐴 = ((𝑘 · 𝑀) + 𝐵)) |
17 | 16 | ex 411 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝑀 ∈ ℝ+) → ((𝐴 mod 𝑀) = 𝐵 → ∃𝑘 ∈ ℤ 𝐴 = ((𝑘 · 𝑀) + 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∃wrex 3059 (class class class)co 7423 ℝcr 11153 0cc0 11154 + caddc 11157 · cmul 11159 ℤcz 12605 ℝ+crp 13023 [,)cico 13375 mod cmo 13884 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5303 ax-nul 5310 ax-pow 5368 ax-pr 5432 ax-un 7745 ax-cnex 11210 ax-resscn 11211 ax-1cn 11212 ax-icn 11213 ax-addcl 11214 ax-addrcl 11215 ax-mulcl 11216 ax-mulrcl 11217 ax-mulcom 11218 ax-addass 11219 ax-mulass 11220 ax-distr 11221 ax-i2m1 11222 ax-1ne0 11223 ax-1rid 11224 ax-rnegex 11225 ax-rrecex 11226 ax-cnre 11227 ax-pre-lttri 11228 ax-pre-lttrn 11229 ax-pre-ltadd 11230 ax-pre-mulgt0 11231 ax-pre-sup 11232 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3776 df-csb 3892 df-dif 3949 df-un 3951 df-in 3953 df-ss 3963 df-pss 3966 df-nul 4325 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5579 df-eprel 5585 df-po 5593 df-so 5594 df-fr 5636 df-we 5638 df-xp 5687 df-rel 5688 df-cnv 5689 df-co 5690 df-dm 5691 df-rn 5692 df-res 5693 df-ima 5694 df-pred 6311 df-ord 6378 df-on 6379 df-lim 6380 df-suc 6381 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7379 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7876 df-2nd 8003 df-frecs 8295 df-wrecs 8326 df-recs 8400 df-rdg 8439 df-er 8733 df-en 8974 df-dom 8975 df-sdom 8976 df-sup 9481 df-inf 9482 df-pnf 11296 df-mnf 11297 df-xr 11298 df-ltxr 11299 df-le 11300 df-sub 11492 df-neg 11493 df-div 11918 df-nn 12260 df-n0 12520 df-z 12606 df-uz 12870 df-rp 13024 df-ico 13379 df-fl 13807 df-mod 13885 |
This theorem is referenced by: modmuladdnn0 13930 2lgsoddprmlem2 27430 remexz 41762 fppr2odd 47252 |
Copyright terms: Public domain | W3C validator |