| Mathbox for Steve Rodriguez |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > hashnzfz2 | Structured version Visualization version GIF version | ||
| Description: Special case of hashnzfz 45626: the count of multiples in nℤ, n greater than one, restricted to an interval starting at two. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
| Ref | Expression |
|---|---|
| hashnzfz2.n | ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘2)) |
| hashnzfz2.k | ⊢ (𝜑 → 𝐾 ∈ ℕ) |
| Ref | Expression |
|---|---|
| hashnzfz2 | ⊢ (𝜑 → (♯‘(( ∥ “ {𝑁}) ∩ (2...𝐾))) = (⌊‘(𝐾 / 𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2nn 12456 | . . . . 5 ⊢ 2 ∈ ℕ | |
| 2 | uznnssnn 13062 | . . . . 5 ⊢ (2 ∈ ℕ → (ℤ≥‘2) ⊆ ℕ) | |
| 3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ (ℤ≥‘2) ⊆ ℕ |
| 4 | hashnzfz2.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘2)) | |
| 5 | 3, 4 | sselid 3911 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| 6 | 2z 12768 | . . . 4 ⊢ 2 ∈ ℤ | |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝜑 → 2 ∈ ℤ) |
| 8 | hashnzfz2.k | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) | |
| 9 | nnuz 13044 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
| 10 | 2m1e1 12507 | . . . . . 6 ⊢ (2 − 1) = 1 | |
| 11 | 10 | fveq2i 6919 | . . . . 5 ⊢ (ℤ≥‘(2 − 1)) = (ℤ≥‘1) |
| 12 | 9, 11 | eqtr4i 2789 | . . . 4 ⊢ ℕ = (ℤ≥‘(2 − 1)) |
| 13 | 8, 12 | eleqtrdi 2874 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘(2 − 1))) |
| 14 | 5, 7, 13 | hashnzfz 45626 | . 2 ⊢ (𝜑 → (♯‘(( ∥ “ {𝑁}) ∩ (2...𝐾))) = ((⌊‘(𝐾 / 𝑁)) − (⌊‘((2 − 1) / 𝑁)))) |
| 15 | 10 | oveq1i 7461 | . . . . 5 ⊢ ((2 − 1) / 𝑁) = (1 / 𝑁) |
| 16 | 15 | fveq2i 6919 | . . . 4 ⊢ (⌊‘((2 − 1) / 𝑁)) = (⌊‘(1 / 𝑁)) |
| 17 | 0red 11350 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 18 | 5 | nnrecred 12429 | . . . . . 6 ⊢ (𝜑 → (1 / 𝑁) ∈ ℝ) |
| 19 | 5 | nnred 12390 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 20 | 5 | nngt0d 12427 | . . . . . . 7 ⊢ (𝜑 → 0 < 𝑁) |
| 21 | 19, 20 | recgt0d 12291 | . . . . . 6 ⊢ (𝜑 → 0 < (1 / 𝑁)) |
| 22 | 17, 18, 21 | ltled 11497 | . . . . 5 ⊢ (𝜑 → 0 ≤ (1 / 𝑁)) |
| 23 | eluzle 13018 | . . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ≤ 𝑁) | |
| 24 | 4, 23 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → 2 ≤ 𝑁) |
| 25 | 5 | nnzd 12759 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 26 | zlem1lt 12788 | . . . . . . . . . 10 ⊢ ((2 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (2 ≤ 𝑁 ↔ (2 − 1) < 𝑁)) | |
| 27 | 6, 25, 26 | sylancr 599 | . . . . . . . . 9 ⊢ (𝜑 → (2 ≤ 𝑁 ↔ (2 − 1) < 𝑁)) |
| 28 | 24, 27 | mpbid 235 | . . . . . . . 8 ⊢ (𝜑 → (2 − 1) < 𝑁) |
| 29 | 10, 28 | eqbrtrrid 5147 | . . . . . . 7 ⊢ (𝜑 → 1 < 𝑁) |
| 30 | 5 | nnrpd 13202 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ+) |
| 31 | 30 | recgt1d 13218 | . . . . . . 7 ⊢ (𝜑 → (1 < 𝑁 ↔ (1 / 𝑁) < 1)) |
| 32 | 29, 31 | mpbid 235 | . . . . . 6 ⊢ (𝜑 → (1 / 𝑁) < 1) |
| 33 | 0p1e1 12503 | . . . . . 6 ⊢ (0 + 1) = 1 | |
| 34 | 32, 33 | breqtrrdi 5153 | . . . . 5 ⊢ (𝜑 → (1 / 𝑁) < (0 + 1)) |
| 35 | 0z 12744 | . . . . . 6 ⊢ 0 ∈ ℤ | |
| 36 | flbi 13996 | . . . . . 6 ⊢ (((1 / 𝑁) ∈ ℝ ∧ 0 ∈ ℤ) → ((⌊‘(1 / 𝑁)) = 0 ↔ (0 ≤ (1 / 𝑁) ∧ (1 / 𝑁) < (0 + 1)))) | |
| 37 | 18, 35, 36 | sylancl 598 | . . . . 5 ⊢ (𝜑 → ((⌊‘(1 / 𝑁)) = 0 ↔ (0 ≤ (1 / 𝑁) ∧ (1 / 𝑁) < (0 + 1)))) |
| 38 | 22, 34, 37 | mpbir2and 726 | . . . 4 ⊢ (𝜑 → (⌊‘(1 / 𝑁)) = 0) |
| 39 | 16, 38 | eqtrid 2810 | . . 3 ⊢ (𝜑 → (⌊‘((2 − 1) / 𝑁)) = 0) |
| 40 | 39 | oveq2d 7467 | . 2 ⊢ (𝜑 → ((⌊‘(𝐾 / 𝑁)) − (⌊‘((2 − 1) / 𝑁))) = ((⌊‘(𝐾 / 𝑁)) − 0)) |
| 41 | 8 | nnred 12390 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℝ) |
| 42 | 41, 5 | nndivred 12432 | . . . . 5 ⊢ (𝜑 → (𝐾 / 𝑁) ∈ ℝ) |
| 43 | 42 | flcld 13978 | . . . 4 ⊢ (𝜑 → (⌊‘(𝐾 / 𝑁)) ∈ ℤ) |
| 44 | 43 | zcnd 12844 | . . 3 ⊢ (𝜑 → (⌊‘(𝐾 / 𝑁)) ∈ ℂ) |
| 45 | 44 | subid1d 11697 | . 2 ⊢ (𝜑 → ((⌊‘(𝐾 / 𝑁)) − 0) = (⌊‘(𝐾 / 𝑁))) |
| 46 | 14, 40, 45 | 3eqtrd 2802 | 1 ⊢ (𝜑 → (♯‘(( ∥ “ {𝑁}) ∩ (2...𝐾))) = (⌊‘(𝐾 / 𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∩ cin 4092 {csn 4588 class class class wbr 5108 “ cima 5661 ‘cfv 6566 (class class class)co 7451 ℝcr 11238 0cc0 11239 1c1 11240 + caddc 11242 < clt 11382 ≤ cle 11383 − cmin 11580 / cdiv 12013 ℕcn 12375 2c2 12437 ℤcz 12733 ℤ≥cuz 13005 ...cfz 13679 ⌊cfl 13970 ♯chash 14515 ∥ 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-cnex 11295 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 ax-pre-sup 11317 |
| 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-rmo 3369 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-int 4913 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-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-fz 13680 df-fl 13972 df-hash 14516 df-dvds 16467 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |