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 37541: 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 11062 | . . . . 5 ⊢ 2 ∈ ℕ | |
2 | uznnssnn 11611 | . . . . 5 ⊢ (2 ∈ ℕ → (ℤ≥‘2) ⊆ ℕ) | |
3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ (ℤ≥‘2) ⊆ ℕ |
4 | hashnzfz2.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘2)) | |
5 | 3, 4 | sseldi 3566 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ) |
6 | 2z 11286 | . . . 4 ⊢ 2 ∈ ℤ | |
7 | 6 | a1i 11 | . . 3 ⊢ (𝜑 → 2 ∈ ℤ) |
8 | hashnzfz2.k | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) | |
9 | nnuz 11599 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
10 | 2m1e1 11012 | . . . . . 6 ⊢ (2 − 1) = 1 | |
11 | 10 | fveq2i 6106 | . . . . 5 ⊢ (ℤ≥‘(2 − 1)) = (ℤ≥‘1) |
12 | 9, 11 | eqtr4i 2635 | . . . 4 ⊢ ℕ = (ℤ≥‘(2 − 1)) |
13 | 8, 12 | syl6eleq 2698 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘(2 − 1))) |
14 | 5, 7, 13 | hashnzfz 37541 | . 2 ⊢ (𝜑 → (#‘(( ∥ “ {𝑁}) ∩ (2...𝐾))) = ((⌊‘(𝐾 / 𝑁)) − (⌊‘((2 − 1) / 𝑁)))) |
15 | 10 | oveq1i 6559 | . . . . 5 ⊢ ((2 − 1) / 𝑁) = (1 / 𝑁) |
16 | 15 | fveq2i 6106 | . . . 4 ⊢ (⌊‘((2 − 1) / 𝑁)) = (⌊‘(1 / 𝑁)) |
17 | 0red 9920 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
18 | 5 | nnrecred 10943 | . . . . . 6 ⊢ (𝜑 → (1 / 𝑁) ∈ ℝ) |
19 | 5 | nnred 10912 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
20 | 5 | nngt0d 10941 | . . . . . . 7 ⊢ (𝜑 → 0 < 𝑁) |
21 | 19, 20 | recgt0d 10837 | . . . . . 6 ⊢ (𝜑 → 0 < (1 / 𝑁)) |
22 | 17, 18, 21 | ltled 10064 | . . . . 5 ⊢ (𝜑 → 0 ≤ (1 / 𝑁)) |
23 | eluzle 11576 | . . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ≤ 𝑁) | |
24 | 4, 23 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → 2 ≤ 𝑁) |
25 | 5 | nnzd 11357 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
26 | zlem1lt 11306 | . . . . . . . . . 10 ⊢ ((2 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (2 ≤ 𝑁 ↔ (2 − 1) < 𝑁)) | |
27 | 6, 25, 26 | sylancr 694 | . . . . . . . . 9 ⊢ (𝜑 → (2 ≤ 𝑁 ↔ (2 − 1) < 𝑁)) |
28 | 24, 27 | mpbid 221 | . . . . . . . 8 ⊢ (𝜑 → (2 − 1) < 𝑁) |
29 | 10, 28 | syl5eqbrr 4619 | . . . . . . 7 ⊢ (𝜑 → 1 < 𝑁) |
30 | 5 | nnrpd 11746 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ+) |
31 | 30 | recgt1d 11762 | . . . . . . 7 ⊢ (𝜑 → (1 < 𝑁 ↔ (1 / 𝑁) < 1)) |
32 | 29, 31 | mpbid 221 | . . . . . 6 ⊢ (𝜑 → (1 / 𝑁) < 1) |
33 | 0p1e1 11009 | . . . . . 6 ⊢ (0 + 1) = 1 | |
34 | 32, 33 | syl6breqr 4625 | . . . . 5 ⊢ (𝜑 → (1 / 𝑁) < (0 + 1)) |
35 | 0z 11265 | . . . . . 6 ⊢ 0 ∈ ℤ | |
36 | flbi 12479 | . . . . . 6 ⊢ (((1 / 𝑁) ∈ ℝ ∧ 0 ∈ ℤ) → ((⌊‘(1 / 𝑁)) = 0 ↔ (0 ≤ (1 / 𝑁) ∧ (1 / 𝑁) < (0 + 1)))) | |
37 | 18, 35, 36 | sylancl 693 | . . . . 5 ⊢ (𝜑 → ((⌊‘(1 / 𝑁)) = 0 ↔ (0 ≤ (1 / 𝑁) ∧ (1 / 𝑁) < (0 + 1)))) |
38 | 22, 34, 37 | mpbir2and 959 | . . . 4 ⊢ (𝜑 → (⌊‘(1 / 𝑁)) = 0) |
39 | 16, 38 | syl5eq 2656 | . . 3 ⊢ (𝜑 → (⌊‘((2 − 1) / 𝑁)) = 0) |
40 | 39 | oveq2d 6565 | . 2 ⊢ (𝜑 → ((⌊‘(𝐾 / 𝑁)) − (⌊‘((2 − 1) / 𝑁))) = ((⌊‘(𝐾 / 𝑁)) − 0)) |
41 | 8 | nnred 10912 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℝ) |
42 | 41, 5 | nndivred 10946 | . . . . 5 ⊢ (𝜑 → (𝐾 / 𝑁) ∈ ℝ) |
43 | 42 | flcld 12461 | . . . 4 ⊢ (𝜑 → (⌊‘(𝐾 / 𝑁)) ∈ ℤ) |
44 | 43 | zcnd 11359 | . . 3 ⊢ (𝜑 → (⌊‘(𝐾 / 𝑁)) ∈ ℂ) |
45 | 44 | subid1d 10260 | . 2 ⊢ (𝜑 → ((⌊‘(𝐾 / 𝑁)) − 0) = (⌊‘(𝐾 / 𝑁))) |
46 | 14, 40, 45 | 3eqtrd 2648 | 1 ⊢ (𝜑 → (#‘(( ∥ “ {𝑁}) ∩ (2...𝐾))) = (⌊‘(𝐾 / 𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∩ cin 3539 ⊆ wss 3540 {csn 4125 class class class wbr 4583 “ cima 5041 ‘cfv 5804 (class class class)co 6549 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 < clt 9953 ≤ cle 9954 − cmin 10145 / cdiv 10563 ℕcn 10897 2c2 10947 ℤcz 11254 ℤ≥cuz 11563 ...cfz 12197 ⌊cfl 12453 #chash 12979 ∥ cdvds 14821 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-inf 8232 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-fz 12198 df-fl 12455 df-hash 12980 df-dvds 14822 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |