Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > modabs | Structured version Visualization version GIF version |
Description: Absorption law for modulo. (Contributed by NM, 29-Dec-2008.) |
Ref | Expression |
---|---|
modabs | ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → ((𝐴 mod 𝐵) mod 𝐶) = (𝐴 mod 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | modcl 13240 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 mod 𝐵) ∈ ℝ) | |
2 | 1 | anim1i 616 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) ∧ 𝐶 ∈ ℝ+) → ((𝐴 mod 𝐵) ∈ ℝ ∧ 𝐶 ∈ ℝ+)) |
3 | 2 | 3impa 1106 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) → ((𝐴 mod 𝐵) ∈ ℝ ∧ 𝐶 ∈ ℝ+)) |
4 | 3 | adantr 483 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → ((𝐴 mod 𝐵) ∈ ℝ ∧ 𝐶 ∈ ℝ+)) |
5 | modge0 13246 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 0 ≤ (𝐴 mod 𝐵)) | |
6 | 5 | 3adant3 1128 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) → 0 ≤ (𝐴 mod 𝐵)) |
7 | 6 | adantr 483 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → 0 ≤ (𝐴 mod 𝐵)) |
8 | 1 | 3adant3 1128 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) → (𝐴 mod 𝐵) ∈ ℝ) |
9 | 8 | adantr 483 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → (𝐴 mod 𝐵) ∈ ℝ) |
10 | rpre 12396 | . . . . 5 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℝ) | |
11 | 10 | 3ad2ant2 1130 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) → 𝐵 ∈ ℝ) |
12 | 11 | adantr 483 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → 𝐵 ∈ ℝ) |
13 | rpre 12396 | . . . . 5 ⊢ (𝐶 ∈ ℝ+ → 𝐶 ∈ ℝ) | |
14 | 13 | 3ad2ant3 1131 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) → 𝐶 ∈ ℝ) |
15 | 14 | adantr 483 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → 𝐶 ∈ ℝ) |
16 | modlt 13247 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 mod 𝐵) < 𝐵) | |
17 | 16 | 3adant3 1128 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) → (𝐴 mod 𝐵) < 𝐵) |
18 | 17 | adantr 483 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → (𝐴 mod 𝐵) < 𝐵) |
19 | simpr 487 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → 𝐵 ≤ 𝐶) | |
20 | 9, 12, 15, 18, 19 | ltletrd 10799 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → (𝐴 mod 𝐵) < 𝐶) |
21 | modid 13263 | . 2 ⊢ ((((𝐴 mod 𝐵) ∈ ℝ ∧ 𝐶 ∈ ℝ+) ∧ (0 ≤ (𝐴 mod 𝐵) ∧ (𝐴 mod 𝐵) < 𝐶)) → ((𝐴 mod 𝐵) mod 𝐶) = (𝐴 mod 𝐵)) | |
22 | 4, 7, 20, 21 | syl12anc 834 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ 𝐶 ∈ ℝ+) ∧ 𝐵 ≤ 𝐶) → ((𝐴 mod 𝐵) mod 𝐶) = (𝐴 mod 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 class class class wbr 5065 (class class class)co 7155 ℝcr 10535 0cc0 10536 < clt 10674 ≤ cle 10675 ℝ+crp 12388 mod cmo 13236 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 ax-pre-sup 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-sup 8905 df-inf 8906 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-div 11297 df-nn 11638 df-n0 11897 df-z 11981 df-uz 12243 df-rp 12389 df-fl 13161 df-mod 13237 |
This theorem is referenced by: modabs2 13272 |
Copyright terms: Public domain | W3C validator |