| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > divalglem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for divalg 16617. (Contributed by Paul Chapman, 21-Mar-2011.) |
| Ref | Expression |
|---|---|
| divalglem0.1 | ⊢ 𝑁 ∈ ℤ |
| divalglem0.2 | ⊢ 𝐷 ∈ ℤ |
| divalglem1.3 | ⊢ 𝐷 ≠ 0 |
| divalglem2.4 | ⊢ 𝑆 = {𝑟 ∈ ℕ0 ∣ 𝐷 ∥ (𝑁 − 𝑟)} |
| Ref | Expression |
|---|---|
| divalglem4 | ⊢ 𝑆 = {𝑟 ∈ ℕ0 ∣ ∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑟)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | divalglem0.2 | . . . . . 6 ⊢ 𝐷 ∈ ℤ | |
| 2 | divalglem0.1 | . . . . . . 7 ⊢ 𝑁 ∈ ℤ | |
| 3 | nn0z 12757 | . . . . . . 7 ⊢ (𝑧 ∈ ℕ0 → 𝑧 ∈ ℤ) | |
| 4 | zsubcl 12778 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑧 ∈ ℤ) → (𝑁 − 𝑧) ∈ ℤ) | |
| 5 | 2, 3, 4 | sylancr 599 | . . . . . 6 ⊢ (𝑧 ∈ ℕ0 → (𝑁 − 𝑧) ∈ ℤ) |
| 6 | divides 16468 | . . . . . 6 ⊢ ((𝐷 ∈ ℤ ∧ (𝑁 − 𝑧) ∈ ℤ) → (𝐷 ∥ (𝑁 − 𝑧) ↔ ∃𝑞 ∈ ℤ (𝑞 · 𝐷) = (𝑁 − 𝑧))) | |
| 7 | 1, 5, 6 | sylancr 599 | . . . . 5 ⊢ (𝑧 ∈ ℕ0 → (𝐷 ∥ (𝑁 − 𝑧) ↔ ∃𝑞 ∈ ℤ (𝑞 · 𝐷) = (𝑁 − 𝑧))) |
| 8 | nn0cn 12656 | . . . . . . . 8 ⊢ (𝑧 ∈ ℕ0 → 𝑧 ∈ ℂ) | |
| 9 | zmulcl 12785 | . . . . . . . . . 10 ⊢ ((𝑞 ∈ ℤ ∧ 𝐷 ∈ ℤ) → (𝑞 · 𝐷) ∈ ℤ) | |
| 10 | 1, 9 | mpan2 704 | . . . . . . . . 9 ⊢ (𝑞 ∈ ℤ → (𝑞 · 𝐷) ∈ ℤ) |
| 11 | 10 | zcnd 12844 | . . . . . . . 8 ⊢ (𝑞 ∈ ℤ → (𝑞 · 𝐷) ∈ ℂ) |
| 12 | zcn 12738 | . . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 13 | 2, 12 | ax-mp 5 | . . . . . . . . . 10 ⊢ 𝑁 ∈ ℂ |
| 14 | subadd 11599 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℂ ∧ 𝑧 ∈ ℂ ∧ (𝑞 · 𝐷) ∈ ℂ) → ((𝑁 − 𝑧) = (𝑞 · 𝐷) ↔ (𝑧 + (𝑞 · 𝐷)) = 𝑁)) | |
| 15 | 13, 14 | mp3an1 1478 | . . . . . . . . 9 ⊢ ((𝑧 ∈ ℂ ∧ (𝑞 · 𝐷) ∈ ℂ) → ((𝑁 − 𝑧) = (𝑞 · 𝐷) ↔ (𝑧 + (𝑞 · 𝐷)) = 𝑁)) |
| 16 | addcom 11535 | . . . . . . . . . 10 ⊢ ((𝑧 ∈ ℂ ∧ (𝑞 · 𝐷) ∈ ℂ) → (𝑧 + (𝑞 · 𝐷)) = ((𝑞 · 𝐷) + 𝑧)) | |
| 17 | 16 | eqeq1d 2765 | . . . . . . . . 9 ⊢ ((𝑧 ∈ ℂ ∧ (𝑞 · 𝐷) ∈ ℂ) → ((𝑧 + (𝑞 · 𝐷)) = 𝑁 ↔ ((𝑞 · 𝐷) + 𝑧) = 𝑁)) |
| 18 | 15, 17 | bitrd 282 | . . . . . . . 8 ⊢ ((𝑧 ∈ ℂ ∧ (𝑞 · 𝐷) ∈ ℂ) → ((𝑁 − 𝑧) = (𝑞 · 𝐷) ↔ ((𝑞 · 𝐷) + 𝑧) = 𝑁)) |
| 19 | 8, 11, 18 | syl2an 608 | . . . . . . 7 ⊢ ((𝑧 ∈ ℕ0 ∧ 𝑞 ∈ ℤ) → ((𝑁 − 𝑧) = (𝑞 · 𝐷) ↔ ((𝑞 · 𝐷) + 𝑧) = 𝑁)) |
| 20 | eqcom 2770 | . . . . . . 7 ⊢ ((𝑁 − 𝑧) = (𝑞 · 𝐷) ↔ (𝑞 · 𝐷) = (𝑁 − 𝑧)) | |
| 21 | eqcom 2770 | . . . . . . 7 ⊢ (((𝑞 · 𝐷) + 𝑧) = 𝑁 ↔ 𝑁 = ((𝑞 · 𝐷) + 𝑧)) | |
| 22 | 19, 20, 21 | 3bitr3g 316 | . . . . . 6 ⊢ ((𝑧 ∈ ℕ0 ∧ 𝑞 ∈ ℤ) → ((𝑞 · 𝐷) = (𝑁 − 𝑧) ↔ 𝑁 = ((𝑞 · 𝐷) + 𝑧))) |
| 23 | 22 | rexbidva 3188 | . . . . 5 ⊢ (𝑧 ∈ ℕ0 → (∃𝑞 ∈ ℤ (𝑞 · 𝐷) = (𝑁 − 𝑧) ↔ ∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑧))) |
| 24 | 7, 23 | bitrd 282 | . . . 4 ⊢ (𝑧 ∈ ℕ0 → (𝐷 ∥ (𝑁 − 𝑧) ↔ ∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑧))) |
| 25 | 24 | pm5.32i 585 | . . 3 ⊢ ((𝑧 ∈ ℕ0 ∧ 𝐷 ∥ (𝑁 − 𝑧)) ↔ (𝑧 ∈ ℕ0 ∧ ∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑧))) |
| 26 | oveq2 7459 | . . . . 5 ⊢ (𝑟 = 𝑧 → (𝑁 − 𝑟) = (𝑁 − 𝑧)) | |
| 27 | 26 | breq2d 5120 | . . . 4 ⊢ (𝑟 = 𝑧 → (𝐷 ∥ (𝑁 − 𝑟) ↔ 𝐷 ∥ (𝑁 − 𝑧))) |
| 28 | divalglem2.4 | . . . 4 ⊢ 𝑆 = {𝑟 ∈ ℕ0 ∣ 𝐷 ∥ (𝑁 − 𝑟)} | |
| 29 | 27, 28 | elrab2 3652 | . . 3 ⊢ (𝑧 ∈ 𝑆 ↔ (𝑧 ∈ ℕ0 ∧ 𝐷 ∥ (𝑁 − 𝑧))) |
| 30 | oveq2 7459 | . . . . . 6 ⊢ (𝑟 = 𝑧 → ((𝑞 · 𝐷) + 𝑟) = ((𝑞 · 𝐷) + 𝑧)) | |
| 31 | 30 | eqeq2d 2774 | . . . . 5 ⊢ (𝑟 = 𝑧 → (𝑁 = ((𝑞 · 𝐷) + 𝑟) ↔ 𝑁 = ((𝑞 · 𝐷) + 𝑧))) |
| 32 | 31 | rexbidv 3190 | . . . 4 ⊢ (𝑟 = 𝑧 → (∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑟) ↔ ∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑧))) |
| 33 | 32 | elrab 3648 | . . 3 ⊢ (𝑧 ∈ {𝑟 ∈ ℕ0 ∣ ∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑟)} ↔ (𝑧 ∈ ℕ0 ∧ ∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑧))) |
| 34 | 25, 29, 33 | 3bitr4i 306 | . 2 ⊢ (𝑧 ∈ 𝑆 ↔ 𝑧 ∈ {𝑟 ∈ ℕ0 ∣ ∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑟)}) |
| 35 | 34 | eqriv 2760 | 1 ⊢ 𝑆 = {𝑟 ∈ ℕ0 ∣ ∃𝑞 ∈ ℤ 𝑁 = ((𝑞 · 𝐷) + 𝑟)} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 {crab 3416 class class class wbr 5108 (class class class)co 7451 ℂcc 11237 0cc0 11239 + caddc 11242 · cmul 11244 − cmin 11580 ℕ0cn0 12646 ℤcz 12733 ∥ cdvds 16466 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-dvds 16467 |
| This theorem is used by: divalglem10 16616 |
| Copyright terms: Public domain | W3C validator |