| 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 1025 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℤ) | |
| 2 | zq 9964 | . . . . . . 7 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℚ) | |
| 3 | 1, 2 | syl 14 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℚ) |
| 4 | simp3 1026 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℤ) | |
| 5 | simp1 1024 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝑁 ∈ ℕ) | |
| 6 | nnq 9971 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℚ) | |
| 7 | 5, 6 | syl 14 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝑁 ∈ ℚ) |
| 8 | 5 | nngt0d 9286 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 0 < 𝑁) |
| 9 | modqmulmod 10758 | . . . . . 6 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) ∧ (𝑁 ∈ ℚ ∧ 0 < 𝑁)) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = ((𝐴 · 𝐵) mod 𝑁)) | |
| 10 | 3, 4, 7, 8, 9 | syl22anc 1275 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = ((𝐴 · 𝐵) mod 𝑁)) |
| 11 | 10 | eqcomd 2240 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 · 𝐵) mod 𝑁) = (((𝐴 mod 𝑁) · 𝐵) mod 𝑁)) |
| 12 | 11 | adantr 276 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((𝐴 · 𝐵) mod 𝑁) = (((𝐴 mod 𝑁) · 𝐵) mod 𝑁)) |
| 13 | dvdsval3 12485 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ) → (𝑁 ∥ 𝐴 ↔ (𝐴 mod 𝑁) = 0)) | |
| 14 | 13 | 3adant3 1044 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝑁 ∥ 𝐴 ↔ (𝐴 mod 𝑁) = 0)) |
| 15 | 14 | biimpa 296 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (𝐴 mod 𝑁) = 0) |
| 16 | 15 | oveq1d 6067 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((𝐴 mod 𝑁) · 𝐵) = (0 · 𝐵)) |
| 17 | 16 | oveq1d 6067 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = ((0 · 𝐵) mod 𝑁)) |
| 18 | 4 | adantr 276 | . . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 𝐵 ∈ ℤ) |
| 19 | 18 | zcnd 9707 | . . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 𝐵 ∈ ℂ) |
| 20 | 19 | mul02d 8670 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (0 · 𝐵) = 0) |
| 21 | 20 | oveq1d 6067 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((0 · 𝐵) mod 𝑁) = (0 mod 𝑁)) |
| 22 | 7 | adantr 276 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 𝑁 ∈ ℚ) |
| 23 | 8 | adantr 276 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 0 < 𝑁) |
| 24 | q0mod 10724 | . . . . . 6 ⊢ ((𝑁 ∈ ℚ ∧ 0 < 𝑁) → (0 mod 𝑁) = 0) | |
| 25 | 22, 23, 24 | syl2anc 411 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (0 mod 𝑁) = 0) |
| 26 | 21, 25 | eqtrd 2267 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((0 · 𝐵) mod 𝑁) = 0) |
| 27 | 17, 26 | eqtrd 2267 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = 0) |
| 28 | 12, 27 | eqtrd 2267 | . 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 1005 = wceq 1398 ∈ wcel 2205 class class class wbr 4111 (class class class)co 6052 0cc0 8132 · cmul 8137 < clt 8313 ℕcn 9242 ℤcz 9582 ℚcq 9957 mod cmo 10691 ∥ cdvds 12481 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-mulrcl 8231 ax-addcom 8232 ax-mulcom 8233 ax-addass 8234 ax-mulass 8235 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-1rid 8239 ax-0id 8240 ax-rnegex 8241 ax-precex 8242 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-apti 8247 ax-pre-ltadd 8248 ax-pre-mulgt0 8249 ax-pre-mulext 8250 ax-arch 8251 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-po 4419 df-iso 4420 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-reap 8854 df-ap 8861 df-div 8952 df-inn 9243 df-n0 9502 df-z 9583 df-q 9958 df-rp 9993 df-fl 10637 df-mod 10692 df-dvds 12482 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |