![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > hashfz | GIF version |
Description: Value of the numeric cardinality of a nonempty integer range. (Contributed by Stefan O'Rear, 12-Sep-2014.) (Proof shortened by Mario Carneiro, 15-Apr-2015.) |
Ref | Expression |
---|---|
hashfz | ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘(𝐴...𝐵)) = ((𝐵 − 𝐴) + 1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluzel2 9509 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ∈ ℤ) | |
2 | eluzelz 9513 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℤ) | |
3 | 1z 9255 | . . . . . 6 ⊢ 1 ∈ ℤ | |
4 | zsubcl 9270 | . . . . . 6 ⊢ ((1 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (1 − 𝐴) ∈ ℤ) | |
5 | 3, 1, 4 | sylancr 414 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (1 − 𝐴) ∈ ℤ) |
6 | fzen 10016 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ (1 − 𝐴) ∈ ℤ) → (𝐴...𝐵) ≈ ((𝐴 + (1 − 𝐴))...(𝐵 + (1 − 𝐴)))) | |
7 | 1, 2, 5, 6 | syl3anc 1238 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴...𝐵) ≈ ((𝐴 + (1 − 𝐴))...(𝐵 + (1 − 𝐴)))) |
8 | 1 | zcnd 9352 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ∈ ℂ) |
9 | ax-1cn 7882 | . . . . . 6 ⊢ 1 ∈ ℂ | |
10 | pncan3 8142 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 + (1 − 𝐴)) = 1) | |
11 | 8, 9, 10 | sylancl 413 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴 + (1 − 𝐴)) = 1) |
12 | 1cnd 7951 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 1 ∈ ℂ) | |
13 | 2 | zcnd 9352 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℂ) |
14 | 13, 8 | subcld 8245 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 − 𝐴) ∈ ℂ) |
15 | 13, 12, 8 | addsub12d 8268 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 + (1 − 𝐴)) = (1 + (𝐵 − 𝐴))) |
16 | 12, 14, 15 | comraddd 8091 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 + (1 − 𝐴)) = ((𝐵 − 𝐴) + 1)) |
17 | 11, 16 | oveq12d 5886 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐴 + (1 − 𝐴))...(𝐵 + (1 − 𝐴))) = (1...((𝐵 − 𝐴) + 1))) |
18 | 7, 17 | breqtrd 4026 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴...𝐵) ≈ (1...((𝐵 − 𝐴) + 1))) |
19 | 1, 2 | fzfigd 10404 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐴...𝐵) ∈ Fin) |
20 | 1zzd 9256 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 1 ∈ ℤ) | |
21 | 2, 1 | zsubcld 9356 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 − 𝐴) ∈ ℤ) |
22 | 21 | peano2zd 9354 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐵 − 𝐴) + 1) ∈ ℤ) |
23 | 20, 22 | fzfigd 10404 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (1...((𝐵 − 𝐴) + 1)) ∈ Fin) |
24 | hashen 10735 | . . . 4 ⊢ (((𝐴...𝐵) ∈ Fin ∧ (1...((𝐵 − 𝐴) + 1)) ∈ Fin) → ((♯‘(𝐴...𝐵)) = (♯‘(1...((𝐵 − 𝐴) + 1))) ↔ (𝐴...𝐵) ≈ (1...((𝐵 − 𝐴) + 1)))) | |
25 | 19, 23, 24 | syl2anc 411 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((♯‘(𝐴...𝐵)) = (♯‘(1...((𝐵 − 𝐴) + 1))) ↔ (𝐴...𝐵) ≈ (1...((𝐵 − 𝐴) + 1)))) |
26 | 18, 25 | mpbird 167 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘(𝐴...𝐵)) = (♯‘(1...((𝐵 − 𝐴) + 1)))) |
27 | uznn0sub 9535 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 − 𝐴) ∈ ℕ0) | |
28 | peano2nn0 9192 | . . 3 ⊢ ((𝐵 − 𝐴) ∈ ℕ0 → ((𝐵 − 𝐴) + 1) ∈ ℕ0) | |
29 | hashfz1 10734 | . . 3 ⊢ (((𝐵 − 𝐴) + 1) ∈ ℕ0 → (♯‘(1...((𝐵 − 𝐴) + 1))) = ((𝐵 − 𝐴) + 1)) | |
30 | 27, 28, 29 | 3syl 17 | . 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘(1...((𝐵 − 𝐴) + 1))) = ((𝐵 − 𝐴) + 1)) |
31 | 26, 30 | eqtrd 2210 | 1 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘(𝐴...𝐵)) = ((𝐵 − 𝐴) + 1)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 = wceq 1353 ∈ wcel 2148 class class class wbr 4000 ‘cfv 5211 (class class class)co 5868 ≈ cen 6731 Fincfn 6733 ℂcc 7787 1c1 7790 + caddc 7792 − cmin 8105 ℕ0cn0 9152 ℤcz 9229 ℤ≥cuz 9504 ...cfz 9982 ♯chash 10726 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4115 ax-sep 4118 ax-nul 4126 ax-pow 4171 ax-pr 4205 ax-un 4429 ax-setind 4532 ax-iinf 4583 ax-cnex 7880 ax-resscn 7881 ax-1cn 7882 ax-1re 7883 ax-icn 7884 ax-addcl 7885 ax-addrcl 7886 ax-mulcl 7887 ax-addcom 7889 ax-addass 7891 ax-distr 7893 ax-i2m1 7894 ax-0lt1 7895 ax-0id 7897 ax-rnegex 7898 ax-cnre 7900 ax-pre-ltirr 7901 ax-pre-ltwlin 7902 ax-pre-lttrn 7903 ax-pre-apti 7904 ax-pre-ltadd 7905 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-int 3843 df-iun 3886 df-br 4001 df-opab 4062 df-mpt 4063 df-tr 4099 df-id 4289 df-iord 4362 df-on 4364 df-ilim 4365 df-suc 4367 df-iom 4586 df-xp 4628 df-rel 4629 df-cnv 4630 df-co 4631 df-dm 4632 df-rn 4633 df-res 4634 df-ima 4635 df-iota 5173 df-fun 5213 df-fn 5214 df-f 5215 df-f1 5216 df-fo 5217 df-f1o 5218 df-fv 5219 df-riota 5824 df-ov 5871 df-oprab 5872 df-mpo 5873 df-1st 6134 df-2nd 6135 df-recs 6299 df-frec 6385 df-1o 6410 df-er 6528 df-en 6734 df-dom 6735 df-fin 6736 df-pnf 7971 df-mnf 7972 df-xr 7973 df-ltxr 7974 df-le 7975 df-sub 8107 df-neg 8108 df-inn 8896 df-n0 9153 df-z 9230 df-uz 9505 df-fz 9983 df-ihash 10727 |
This theorem is referenced by: hashfzo 10773 hashfzp1 10775 hashfz0 10776 |
Copyright terms: Public domain | W3C validator |