| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > modcyc2 | Structured version Visualization version GIF version | ||
| Description: The modulo operation is periodic. (Contributed by NM, 12-Nov-2008.) |
| Ref | Expression |
|---|---|
| modcyc2 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → ((𝐴 − (𝐵 · 𝑁)) mod 𝐵) = (𝐴 mod 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recn 11196 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 2 | rpcn 13033 | . . . 4 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℂ) | |
| 3 | zcn 12602 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 4 | mulneg1 11656 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (-𝑁 · 𝐵) = -(𝑁 · 𝐵)) | |
| 5 | 4 | ancoms 463 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (-𝑁 · 𝐵) = -(𝑁 · 𝐵)) |
| 6 | mulcom 11192 | . . . . . . . . 9 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐵 · 𝑁) = (𝑁 · 𝐵)) | |
| 7 | 6 | negeqd 11457 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → -(𝐵 · 𝑁) = -(𝑁 · 𝐵)) |
| 8 | 5, 7 | eqtr4d 2800 | . . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (-𝑁 · 𝐵) = -(𝐵 · 𝑁)) |
| 9 | 8 | 3adant1 1147 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (-𝑁 · 𝐵) = -(𝐵 · 𝑁)) |
| 10 | 9 | oveq2d 7428 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 + (-𝑁 · 𝐵)) = (𝐴 + -(𝐵 · 𝑁))) |
| 11 | mulcl 11190 | . . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐵 · 𝑁) ∈ ℂ) | |
| 12 | negsub 11512 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 · 𝑁) ∈ ℂ) → (𝐴 + -(𝐵 · 𝑁)) = (𝐴 − (𝐵 · 𝑁))) | |
| 13 | 11, 12 | sylan2 604 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ)) → (𝐴 + -(𝐵 · 𝑁)) = (𝐴 − (𝐵 · 𝑁))) |
| 14 | 13 | 3impb 1131 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 + -(𝐵 · 𝑁)) = (𝐴 − (𝐵 · 𝑁))) |
| 15 | 10, 14 | eqtr2d 2798 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 − (𝐵 · 𝑁)) = (𝐴 + (-𝑁 · 𝐵))) |
| 16 | 1, 2, 3, 15 | syl3an 1177 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → (𝐴 − (𝐵 · 𝑁)) = (𝐴 + (-𝑁 · 𝐵))) |
| 17 | 16 | oveq1d 7427 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → ((𝐴 − (𝐵 · 𝑁)) mod 𝐵) = ((𝐴 + (-𝑁 · 𝐵)) mod 𝐵)) |
| 18 | znegcl 12635 | . . 3 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) | |
| 19 | modcyc 13946 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ -𝑁 ∈ ℤ) → ((𝐴 + (-𝑁 · 𝐵)) mod 𝐵) = (𝐴 mod 𝐵)) | |
| 20 | 18, 19 | syl3an3 1182 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → ((𝐴 + (-𝑁 · 𝐵)) mod 𝐵) = (𝐴 mod 𝐵)) |
| 21 | 17, 20 | eqtrd 2797 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → ((𝐴 − (𝐵 · 𝑁)) mod 𝐵) = (𝐴 mod 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 (class class class)co 7412 ℂcc 11104 ℝcr 11105 + caddc 11109 · cmul 11111 − cmin 11447 -cneg 11448 ℤcz 12597 ℝ+crp 13022 mod cmo 13909 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9400 df-inf 9401 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-fl 13832 df-mod 13910 |
| This theorem is used by: modadd1 13948 modmul1 13967 2submod 13975 modsubdir 13983 |
| Copyright terms: Public domain | W3C validator |