![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > hashfzo | GIF version |
Description: Cardinality of a half-open set of integers. (Contributed by Stefan O'Rear, 15-Aug-2015.) |
Ref | Expression |
---|---|
hashfzo | ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘(𝐴..^𝐵)) = (𝐵 − 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fzo0 10198 | . . . . . 6 ⊢ (𝐴..^𝐴) = ∅ | |
2 | 1 | fveq2i 5537 | . . . . 5 ⊢ (♯‘(𝐴..^𝐴)) = (♯‘∅) |
3 | hash0 10808 | . . . . 5 ⊢ (♯‘∅) = 0 | |
4 | 2, 3 | eqtri 2210 | . . . 4 ⊢ (♯‘(𝐴..^𝐴)) = 0 |
5 | eluzel2 9563 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ∈ ℤ) | |
6 | 5 | zcnd 9406 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ∈ ℂ) |
7 | 6 | subidd 8286 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴 − 𝐴) = 0) |
8 | 4, 7 | eqtr4id 2241 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘(𝐴..^𝐴)) = (𝐴 − 𝐴)) |
9 | oveq2 5904 | . . . . 5 ⊢ (𝐵 = 𝐴 → (𝐴..^𝐵) = (𝐴..^𝐴)) | |
10 | 9 | fveq2d 5538 | . . . 4 ⊢ (𝐵 = 𝐴 → (♯‘(𝐴..^𝐵)) = (♯‘(𝐴..^𝐴))) |
11 | oveq1 5903 | . . . 4 ⊢ (𝐵 = 𝐴 → (𝐵 − 𝐴) = (𝐴 − 𝐴)) | |
12 | 10, 11 | eqeq12d 2204 | . . 3 ⊢ (𝐵 = 𝐴 → ((♯‘(𝐴..^𝐵)) = (𝐵 − 𝐴) ↔ (♯‘(𝐴..^𝐴)) = (𝐴 − 𝐴))) |
13 | 8, 12 | syl5ibrcom 157 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 = 𝐴 → (♯‘(𝐴..^𝐵)) = (𝐵 − 𝐴))) |
14 | eluzelz 9567 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℤ) | |
15 | fzoval 10178 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → (𝐴..^𝐵) = (𝐴...(𝐵 − 1))) | |
16 | 14, 15 | syl 14 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴..^𝐵) = (𝐴...(𝐵 − 1))) |
17 | 16 | fveq2d 5538 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘(𝐴..^𝐵)) = (♯‘(𝐴...(𝐵 − 1)))) |
18 | 17 | adantr 276 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ (𝐵 − 1) ∈ (ℤ≥‘𝐴)) → (♯‘(𝐴..^𝐵)) = (♯‘(𝐴...(𝐵 − 1)))) |
19 | hashfz 10833 | . . . . 5 ⊢ ((𝐵 − 1) ∈ (ℤ≥‘𝐴) → (♯‘(𝐴...(𝐵 − 1))) = (((𝐵 − 1) − 𝐴) + 1)) | |
20 | 14 | zcnd 9406 | . . . . . . . 8 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℂ) |
21 | 1cnd 8003 | . . . . . . . 8 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 1 ∈ ℂ) | |
22 | 20, 21, 6 | sub32d 8330 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐵 − 1) − 𝐴) = ((𝐵 − 𝐴) − 1)) |
23 | 22 | oveq1d 5911 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (((𝐵 − 1) − 𝐴) + 1) = (((𝐵 − 𝐴) − 1) + 1)) |
24 | 20, 6 | subcld 8298 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 − 𝐴) ∈ ℂ) |
25 | ax-1cn 7934 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
26 | npcan 8196 | . . . . . . 7 ⊢ (((𝐵 − 𝐴) ∈ ℂ ∧ 1 ∈ ℂ) → (((𝐵 − 𝐴) − 1) + 1) = (𝐵 − 𝐴)) | |
27 | 24, 25, 26 | sylancl 413 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (((𝐵 − 𝐴) − 1) + 1) = (𝐵 − 𝐴)) |
28 | 23, 27 | eqtrd 2222 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (((𝐵 − 1) − 𝐴) + 1) = (𝐵 − 𝐴)) |
29 | 19, 28 | sylan9eqr 2244 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ (𝐵 − 1) ∈ (ℤ≥‘𝐴)) → (♯‘(𝐴...(𝐵 − 1))) = (𝐵 − 𝐴)) |
30 | 18, 29 | eqtrd 2222 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ (𝐵 − 1) ∈ (ℤ≥‘𝐴)) → (♯‘(𝐴..^𝐵)) = (𝐵 − 𝐴)) |
31 | 30 | ex 115 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐵 − 1) ∈ (ℤ≥‘𝐴) → (♯‘(𝐴..^𝐵)) = (𝐵 − 𝐴))) |
32 | uzm1 9588 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 = 𝐴 ∨ (𝐵 − 1) ∈ (ℤ≥‘𝐴))) | |
33 | 13, 31, 32 | mpjaod 719 | 1 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘(𝐴..^𝐵)) = (𝐵 − 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2160 ∅c0 3437 ‘cfv 5235 (class class class)co 5896 ℂcc 7839 0cc0 7841 1c1 7842 + caddc 7844 − cmin 8158 ℤcz 9283 ℤ≥cuz 9558 ...cfz 10038 ..^cfzo 10172 ♯chash 10787 |
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 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-nul 4144 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-setind 4554 ax-iinf 4605 ax-cnex 7932 ax-resscn 7933 ax-1cn 7934 ax-1re 7935 ax-icn 7936 ax-addcl 7937 ax-addrcl 7938 ax-mulcl 7939 ax-addcom 7941 ax-addass 7943 ax-distr 7945 ax-i2m1 7946 ax-0lt1 7947 ax-0id 7949 ax-rnegex 7950 ax-cnre 7952 ax-pre-ltirr 7953 ax-pre-ltwlin 7954 ax-pre-lttrn 7955 ax-pre-apti 7956 ax-pre-ltadd 7957 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-tr 4117 df-id 4311 df-iord 4384 df-on 4386 df-ilim 4387 df-suc 4389 df-iom 4608 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-f1 5240 df-fo 5241 df-f1o 5242 df-fv 5243 df-riota 5852 df-ov 5899 df-oprab 5900 df-mpo 5901 df-1st 6165 df-2nd 6166 df-recs 6330 df-frec 6416 df-1o 6441 df-er 6559 df-en 6767 df-dom 6768 df-fin 6769 df-pnf 8024 df-mnf 8025 df-xr 8026 df-ltxr 8027 df-le 8028 df-sub 8160 df-neg 8161 df-inn 8950 df-n0 9207 df-z 9284 df-uz 9559 df-fz 10039 df-fzo 10173 df-ihash 10788 |
This theorem is referenced by: hashfzo0 10835 |
Copyright terms: Public domain | W3C validator |