![]() |
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 1000 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℤ) | |
2 | zq 9694 | . . . . . . 7 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℚ) | |
3 | 1, 2 | syl 14 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℚ) |
4 | simp3 1001 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℤ) | |
5 | simp1 999 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝑁 ∈ ℕ) | |
6 | nnq 9701 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℚ) | |
7 | 5, 6 | syl 14 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝑁 ∈ ℚ) |
8 | 5 | nngt0d 9028 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 0 < 𝑁) |
9 | modqmulmod 10463 | . . . . . 6 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) ∧ (𝑁 ∈ ℚ ∧ 0 < 𝑁)) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = ((𝐴 · 𝐵) mod 𝑁)) | |
10 | 3, 4, 7, 8, 9 | syl22anc 1250 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = ((𝐴 · 𝐵) mod 𝑁)) |
11 | 10 | eqcomd 2199 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 · 𝐵) mod 𝑁) = (((𝐴 mod 𝑁) · 𝐵) mod 𝑁)) |
12 | 11 | adantr 276 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((𝐴 · 𝐵) mod 𝑁) = (((𝐴 mod 𝑁) · 𝐵) mod 𝑁)) |
13 | dvdsval3 11937 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ) → (𝑁 ∥ 𝐴 ↔ (𝐴 mod 𝑁) = 0)) | |
14 | 13 | 3adant3 1019 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝑁 ∥ 𝐴 ↔ (𝐴 mod 𝑁) = 0)) |
15 | 14 | biimpa 296 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (𝐴 mod 𝑁) = 0) |
16 | 15 | oveq1d 5934 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((𝐴 mod 𝑁) · 𝐵) = (0 · 𝐵)) |
17 | 16 | oveq1d 5934 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = ((0 · 𝐵) mod 𝑁)) |
18 | 4 | adantr 276 | . . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 𝐵 ∈ ℤ) |
19 | 18 | zcnd 9443 | . . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 𝐵 ∈ ℂ) |
20 | 19 | mul02d 8413 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (0 · 𝐵) = 0) |
21 | 20 | oveq1d 5934 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((0 · 𝐵) mod 𝑁) = (0 mod 𝑁)) |
22 | 7 | adantr 276 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 𝑁 ∈ ℚ) |
23 | 8 | adantr 276 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → 0 < 𝑁) |
24 | q0mod 10429 | . . . . . 6 ⊢ ((𝑁 ∈ ℚ ∧ 0 < 𝑁) → (0 mod 𝑁) = 0) | |
25 | 22, 23, 24 | syl2anc 411 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (0 mod 𝑁) = 0) |
26 | 21, 25 | eqtrd 2226 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → ((0 · 𝐵) mod 𝑁) = 0) |
27 | 17, 26 | eqtrd 2226 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ 𝑁 ∥ 𝐴) → (((𝐴 mod 𝑁) · 𝐵) mod 𝑁) = 0) |
28 | 12, 27 | eqtrd 2226 | . 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 980 = wceq 1364 ∈ wcel 2164 class class class wbr 4030 (class class class)co 5919 0cc0 7874 · cmul 7879 < clt 8056 ℕcn 8984 ℤcz 9320 ℚcq 9687 mod cmo 10396 ∥ cdvds 11933 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-apti 7989 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 ax-pre-mulext 7992 ax-arch 7993 |
This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-po 4328 df-iso 4329 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-reap 8596 df-ap 8603 df-div 8694 df-inn 8985 df-n0 9244 df-z 9321 df-q 9688 df-rp 9723 df-fl 10342 df-mod 10397 df-dvds 11934 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |