modcyc2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > modcyc2		Structured version Visualization version GIF version

Theorem modcyc2 13270

Description: The modulo operation is periodic. (Contributed by NM, 12-Nov-2008.)

**Assertion**
Ref	Expression
modcyc2	⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝑁 ∈ ℤ) → ((𝐴 − (𝐵 · 𝑁)) mod 𝐵) = (𝐴 mod 𝐵))

**Proof of Theorem modcyc2**
Step	Hyp	Ref	Expression
1		recn 10616	. . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ)
2		rpcn 12387	. . . 4 ⊢ (𝐵 ∈ ℝ⁺ → 𝐵 ∈ ℂ)
3		zcn 11974	. . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ)
4		mulneg1 11065	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (-𝑁 · 𝐵) = -(𝑁 · 𝐵))
5	4	ancoms 462	. . . . . . . 8 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (-𝑁 · 𝐵) = -(𝑁 · 𝐵))
6		mulcom 10612	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐵 · 𝑁) = (𝑁 · 𝐵))
7	6	negeqd 10869	. . . . . . . 8 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → -(𝐵 · 𝑁) = -(𝑁 · 𝐵))
8	5, 7	eqtr4d 2836	. . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (-𝑁 · 𝐵) = -(𝐵 · 𝑁))
9	8	3adant1 1127	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (-𝑁 · 𝐵) = -(𝐵 · 𝑁))
10	9	oveq2d 7151	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 + (-𝑁 · 𝐵)) = (𝐴 + -(𝐵 · 𝑁)))
11		mulcl 10610	. . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐵 · 𝑁) ∈ ℂ)
12		negsub 10923	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 · 𝑁) ∈ ℂ) → (𝐴 + -(𝐵 · 𝑁)) = (𝐴 − (𝐵 · 𝑁)))
13	11, 12	sylan2 595	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ)) → (𝐴 + -(𝐵 · 𝑁)) = (𝐴 − (𝐵 · 𝑁)))
14	13	3impb 1112	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 + -(𝐵 · 𝑁)) = (𝐴 − (𝐵 · 𝑁)))
15	10, 14	eqtr2d 2834	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 − (𝐵 · 𝑁)) = (𝐴 + (-𝑁 · 𝐵)))
16	1, 2, 3, 15	syl3an 1157	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝑁 ∈ ℤ) → (𝐴 − (𝐵 · 𝑁)) = (𝐴 + (-𝑁 · 𝐵)))
17	16	oveq1d 7150	. 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝑁 ∈ ℤ) → ((𝐴 − (𝐵 · 𝑁)) mod 𝐵) = ((𝐴 + (-𝑁 · 𝐵)) mod 𝐵))
18		znegcl 12005	. . 3 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ)
19		modcyc 13269	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ⁺ ∧ -𝑁 ∈ ℤ) → ((𝐴 + (-𝑁 · 𝐵)) mod 𝐵) = (𝐴 mod 𝐵))
20	18, 19	syl3an3 1162	. 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝑁 ∈ ℤ) → ((𝐴 + (-𝑁 · 𝐵)) mod 𝐵) = (𝐴 mod 𝐵))
21	17, 20	eqtrd 2833	1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ⁺ ∧ 𝑁 ∈ ℤ) → ((𝐴 − (𝐵 · 𝑁)) mod 𝐵) = (𝐴 mod 𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 (class class class)co 7135 ℂcc 10524 ℝcr 10525 + caddc 10529 · cmul 10531 − cmin 10859 -cneg 10860 ℤcz 11969 ℝ⁺crp 12377 mod cmo 13232

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-fl 13157 df-mod 13233

This theorem is referenced by: modadd1 13271 modmul1 13287 2submod 13295 modsubdir 13303

W3C validator