| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mulmoddvds | GIF version | ||
| Description: If an integer is divisible by a positive integer, the product of this integer with another integer modulo the positive integer is 0. (Contributed by Alexander van der Vekens, 30-Aug-2018.) |
| Ref | Expression |
|---|---|
| mulmoddvds | ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝑁 ∥ 𝐴 → ((𝐴 · 𝐵) mod 𝑁) = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp2 1024 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℤ) | |
| 2 | zq 9860 | . . . . . . 7 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℚ) | |
| 3 | 1, 2 | syl 14 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℚ) |
| 4 | simp3 1025 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℤ) | |
| 5 | simp1 1023 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝑁 ∈ ℕ) | |
| 6 | nnq 9867 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℚ) | |
| 7 | 5, 6 | syl 14 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝑁 ∈ ℚ) |
| 8 | 5 | nngt0d 9187 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 0 < 𝑁) |
| 9 | modqmulmod 10652 | . . . . . 6 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) ∧ (𝑁 ∈ ℚ ∧ 0 < 𝑁)) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = ((𝐴 · 𝐵) mod 𝑁)) | |
| 10 | 3, 4, 7, 8, 9 | syl22anc 1274 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = ((𝐴 · 𝐵) mod 𝑁)) |
| 11 | 10 | eqcomd 2237 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 · 𝐵) mod 𝑁) = (((𝐴 mod 𝑁) · 𝐵) mod 𝑁)) |
| 12 | 11 | adantr 276 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((𝐴 · 𝐵) mod 𝑁) = (((𝐴 mod 𝑁) · 𝐵) mod 𝑁)) |
| 13 | dvdsval3 12354 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ) → (𝑁 ∥ 𝐴 ↔ (𝐴 mod 𝑁) = 0)) | |
| 14 | 13 | 3adant3 1043 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝑁 ∥ 𝐴 ↔ (𝐴 mod 𝑁) = 0)) |
| 15 | 14 | biimpa 296 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (𝐴 mod 𝑁) = 0) |
| 16 | 15 | oveq1d 6033 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((𝐴 mod 𝑁) · 𝐵) = (0 · 𝐵)) |
| 17 | 16 | oveq1d 6033 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = ((0 · 𝐵) mod 𝑁)) |
| 18 | 4 | adantr 276 | . . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 𝐵 ∈ ℤ) |
| 19 | 18 | zcnd 9603 | . . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 𝐵 ∈ ℂ) |
| 20 | 19 | mul02d 8571 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (0 · 𝐵) = 0) |
| 21 | 20 | oveq1d 6033 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((0 · 𝐵) mod 𝑁) = (0 mod 𝑁)) |
| 22 | 7 | adantr 276 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 𝑁 ∈ ℚ) |
| 23 | 8 | adantr 276 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 0 < 𝑁) |
| 24 | q0mod 10618 | . . . . . 6 ⊢ ((𝑁 ∈ ℚ ∧ 0 < 𝑁) → (0 mod 𝑁) = 0) | |
| 25 | 22, 23, 24 | syl2anc 411 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (0 mod 𝑁) = 0) |
| 26 | 21, 25 | eqtrd 2264 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((0 · 𝐵) mod 𝑁) = 0) |
| 27 | 17, 26 | eqtrd 2264 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = 0) |
| 28 | 12, 27 | eqtrd 2264 | . 2 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((𝐴 · 𝐵) mod 𝑁) = 0) |
| 29 | 28 | ex 115 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝑁 ∥ 𝐴 → ((𝐴 · 𝐵) mod 𝑁) = 0)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 class class class wbr 4088 (class class class)co 6018 0cc0 8032 · cmul 8037 < clt 8214 ℕcn 9143 ℤcz 9479 ℚcq 9853 mod cmo 10585 ∥ cdvds 12350 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 ax-arch 8151 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-po 4393 df-iso 4394 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-n0 9403 df-z 9480 df-q 9854 df-rp 9889 df-fl 10531 df-mod 10586 df-dvds 12351 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |