![]() |
Mathbox for Steve Rodriguez |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > hashnzfz | Structured version Visualization version GIF version |
Description: Special case of hashdvds 16102: the count of multiples in nℤ restricted to an interval. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
Ref | Expression |
---|---|
hashnzfz.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
hashnzfz.j | ⊢ (𝜑 → 𝐽 ∈ ℤ) |
hashnzfz.k | ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘(𝐽 − 1))) |
Ref | Expression |
---|---|
hashnzfz | ⊢ (𝜑 → (♯‘(( ∥ “ {𝑁}) ∩ (𝐽...𝐾))) = ((⌊‘(𝐾 / 𝑁)) − (⌊‘((𝐽 − 1) / 𝑁)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hashnzfz.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
2 | hashnzfz.j | . . 3 ⊢ (𝜑 → 𝐽 ∈ ℤ) | |
3 | hashnzfz.k | . . 3 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘(𝐽 − 1))) | |
4 | 0zd 11981 | . . 3 ⊢ (𝜑 → 0 ∈ ℤ) | |
5 | 1, 2, 3, 4 | hashdvds 16102 | . 2 ⊢ (𝜑 → (♯‘{𝑥 ∈ (𝐽...𝐾) ∣ 𝑁 ∥ (𝑥 − 0)}) = ((⌊‘((𝐾 − 0) / 𝑁)) − (⌊‘(((𝐽 − 1) − 0) / 𝑁)))) |
6 | elfzelz 12902 | . . . . . . . . 9 ⊢ (𝑥 ∈ (𝐽...𝐾) → 𝑥 ∈ ℤ) | |
7 | 6 | zcnd 12076 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐽...𝐾) → 𝑥 ∈ ℂ) |
8 | 7 | subid1d 10975 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐽...𝐾) → (𝑥 − 0) = 𝑥) |
9 | 8 | breq2d 5042 | . . . . . 6 ⊢ (𝑥 ∈ (𝐽...𝐾) → (𝑁 ∥ (𝑥 − 0) ↔ 𝑁 ∥ 𝑥)) |
10 | 9 | rabbiia 3419 | . . . . 5 ⊢ {𝑥 ∈ (𝐽...𝐾) ∣ 𝑁 ∥ (𝑥 − 0)} = {𝑥 ∈ (𝐽...𝐾) ∣ 𝑁 ∥ 𝑥} |
11 | dfrab3 4230 | . . . . 5 ⊢ {𝑥 ∈ (𝐽...𝐾) ∣ 𝑁 ∥ 𝑥} = ((𝐽...𝐾) ∩ {𝑥 ∣ 𝑁 ∥ 𝑥}) | |
12 | reldvds 41019 | . . . . . . . 8 ⊢ Rel ∥ | |
13 | relimasn 5919 | . . . . . . . 8 ⊢ (Rel ∥ → ( ∥ “ {𝑁}) = {𝑥 ∣ 𝑁 ∥ 𝑥}) | |
14 | 12, 13 | ax-mp 5 | . . . . . . 7 ⊢ ( ∥ “ {𝑁}) = {𝑥 ∣ 𝑁 ∥ 𝑥} |
15 | 14 | ineq2i 4136 | . . . . . 6 ⊢ ((𝐽...𝐾) ∩ ( ∥ “ {𝑁})) = ((𝐽...𝐾) ∩ {𝑥 ∣ 𝑁 ∥ 𝑥}) |
16 | incom 4128 | . . . . . 6 ⊢ ((𝐽...𝐾) ∩ ( ∥ “ {𝑁})) = (( ∥ “ {𝑁}) ∩ (𝐽...𝐾)) | |
17 | 15, 16 | eqtr3i 2823 | . . . . 5 ⊢ ((𝐽...𝐾) ∩ {𝑥 ∣ 𝑁 ∥ 𝑥}) = (( ∥ “ {𝑁}) ∩ (𝐽...𝐾)) |
18 | 10, 11, 17 | 3eqtri 2825 | . . . 4 ⊢ {𝑥 ∈ (𝐽...𝐾) ∣ 𝑁 ∥ (𝑥 − 0)} = (( ∥ “ {𝑁}) ∩ (𝐽...𝐾)) |
19 | 18 | fveq2i 6648 | . . 3 ⊢ (♯‘{𝑥 ∈ (𝐽...𝐾) ∣ 𝑁 ∥ (𝑥 − 0)}) = (♯‘(( ∥ “ {𝑁}) ∩ (𝐽...𝐾))) |
20 | 19 | a1i 11 | . 2 ⊢ (𝜑 → (♯‘{𝑥 ∈ (𝐽...𝐾) ∣ 𝑁 ∥ (𝑥 − 0)}) = (♯‘(( ∥ “ {𝑁}) ∩ (𝐽...𝐾)))) |
21 | eluzelz 12241 | . . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘(𝐽 − 1)) → 𝐾 ∈ ℤ) | |
22 | 3, 21 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
23 | 22 | zcnd 12076 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℂ) |
24 | 23 | subid1d 10975 | . . . 4 ⊢ (𝜑 → (𝐾 − 0) = 𝐾) |
25 | 24 | fvoveq1d 7157 | . . 3 ⊢ (𝜑 → (⌊‘((𝐾 − 0) / 𝑁)) = (⌊‘(𝐾 / 𝑁))) |
26 | peano2zm 12013 | . . . . . . 7 ⊢ (𝐽 ∈ ℤ → (𝐽 − 1) ∈ ℤ) | |
27 | 2, 26 | syl 17 | . . . . . 6 ⊢ (𝜑 → (𝐽 − 1) ∈ ℤ) |
28 | 27 | zcnd 12076 | . . . . 5 ⊢ (𝜑 → (𝐽 − 1) ∈ ℂ) |
29 | 28 | subid1d 10975 | . . . 4 ⊢ (𝜑 → ((𝐽 − 1) − 0) = (𝐽 − 1)) |
30 | 29 | fvoveq1d 7157 | . . 3 ⊢ (𝜑 → (⌊‘(((𝐽 − 1) − 0) / 𝑁)) = (⌊‘((𝐽 − 1) / 𝑁))) |
31 | 25, 30 | oveq12d 7153 | . 2 ⊢ (𝜑 → ((⌊‘((𝐾 − 0) / 𝑁)) − (⌊‘(((𝐽 − 1) − 0) / 𝑁))) = ((⌊‘(𝐾 / 𝑁)) − (⌊‘((𝐽 − 1) / 𝑁)))) |
32 | 5, 20, 31 | 3eqtr3d 2841 | 1 ⊢ (𝜑 → (♯‘(( ∥ “ {𝑁}) ∩ (𝐽...𝐾))) = ((⌊‘(𝐾 / 𝑁)) − (⌊‘((𝐽 − 1) / 𝑁)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 {cab 2776 {crab 3110 ∩ cin 3880 {csn 4525 class class class wbr 5030 “ cima 5522 Rel wrel 5524 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 − cmin 10859 / cdiv 11286 ℕcn 11625 ℤcz 11969 ℤ≥cuz 12231 ...cfz 12885 ⌊cfl 13155 ♯chash 13686 ∥ cdvds 15599 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fl 13157 df-hash 13687 df-dvds 15600 |
This theorem is referenced by: hashnzfz2 41025 hashnzfzclim 41026 |
Copyright terms: Public domain | W3C validator |