| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hashfzp1 | Structured version Visualization version GIF version | ||
| Description: Value of the numeric cardinality of a (possibly empty) integer range. (Contributed by AV, 19-Jun-2021.) |
| Ref | Expression |
|---|---|
| hashfzp1 | ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘((𝐴 + 1)...𝐵)) = (𝐵 − 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hash0 14291 | . . . 4 ⊢ (♯‘∅) = 0 | |
| 2 | eluzelre 12763 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℝ) | |
| 3 | 2 | ltp1d 12073 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 < (𝐵 + 1)) |
| 4 | eluzelz 12762 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℤ) | |
| 5 | peano2z 12533 | . . . . . . . 8 ⊢ (𝐵 ∈ ℤ → (𝐵 + 1) ∈ ℤ) | |
| 6 | 5 | ancri 549 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → ((𝐵 + 1) ∈ ℤ ∧ 𝐵 ∈ ℤ)) |
| 7 | fzn 13457 | . . . . . . 7 ⊢ (((𝐵 + 1) ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 < (𝐵 + 1) ↔ ((𝐵 + 1)...𝐵) = ∅)) | |
| 8 | 4, 6, 7 | 3syl 18 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 < (𝐵 + 1) ↔ ((𝐵 + 1)...𝐵) = ∅)) |
| 9 | 3, 8 | mpbid 232 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐵 + 1)...𝐵) = ∅) |
| 10 | 9 | fveq2d 6836 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘((𝐵 + 1)...𝐵)) = (♯‘∅)) |
| 11 | 4 | zcnd 12598 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℂ) |
| 12 | 11 | subidd 11481 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 − 𝐵) = 0) |
| 13 | 1, 10, 12 | 3eqtr4a 2798 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘((𝐵 + 1)...𝐵)) = (𝐵 − 𝐵)) |
| 14 | oveq1 7365 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝐴 + 1) = (𝐵 + 1)) | |
| 15 | 14 | fvoveq1d 7380 | . . . 4 ⊢ (𝐴 = 𝐵 → (♯‘((𝐴 + 1)...𝐵)) = (♯‘((𝐵 + 1)...𝐵))) |
| 16 | oveq2 7366 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝐵 − 𝐴) = (𝐵 − 𝐵)) | |
| 17 | 15, 16 | eqeq12d 2753 | . . 3 ⊢ (𝐴 = 𝐵 → ((♯‘((𝐴 + 1)...𝐵)) = (𝐵 − 𝐴) ↔ (♯‘((𝐵 + 1)...𝐵)) = (𝐵 − 𝐵))) |
| 18 | 13, 17 | imbitrrid 246 | . 2 ⊢ (𝐴 = 𝐵 → (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘((𝐴 + 1)...𝐵)) = (𝐵 − 𝐴))) |
| 19 | uzp1 12789 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐵 = 𝐴 ∨ 𝐵 ∈ (ℤ≥‘(𝐴 + 1)))) | |
| 20 | pm2.24 124 | . . . . . . . . 9 ⊢ (𝐴 = 𝐵 → (¬ 𝐴 = 𝐵 → 𝐵 ∈ (ℤ≥‘(𝐴 + 1)))) | |
| 21 | 20 | eqcoms 2745 | . . . . . . . 8 ⊢ (𝐵 = 𝐴 → (¬ 𝐴 = 𝐵 → 𝐵 ∈ (ℤ≥‘(𝐴 + 1)))) |
| 22 | ax-1 6 | . . . . . . . 8 ⊢ (𝐵 ∈ (ℤ≥‘(𝐴 + 1)) → (¬ 𝐴 = 𝐵 → 𝐵 ∈ (ℤ≥‘(𝐴 + 1)))) | |
| 23 | 21, 22 | jaoi 858 | . . . . . . 7 ⊢ ((𝐵 = 𝐴 ∨ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → (¬ 𝐴 = 𝐵 → 𝐵 ∈ (ℤ≥‘(𝐴 + 1)))) |
| 24 | 19, 23 | syl 17 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (¬ 𝐴 = 𝐵 → 𝐵 ∈ (ℤ≥‘(𝐴 + 1)))) |
| 25 | 24 | impcom 407 | . . . . 5 ⊢ ((¬ 𝐴 = 𝐵 ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) |
| 26 | hashfz 14351 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘(𝐴 + 1)) → (♯‘((𝐴 + 1)...𝐵)) = ((𝐵 − (𝐴 + 1)) + 1)) | |
| 27 | 25, 26 | syl 17 | . . . 4 ⊢ ((¬ 𝐴 = 𝐵 ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → (♯‘((𝐴 + 1)...𝐵)) = ((𝐵 − (𝐴 + 1)) + 1)) |
| 28 | eluzel2 12757 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ∈ ℤ) | |
| 29 | 28 | zcnd 12598 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ∈ ℂ) |
| 30 | 1cnd 11128 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 1 ∈ ℂ) | |
| 31 | 11, 29, 30 | nppcan2d 11519 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → ((𝐵 − (𝐴 + 1)) + 1) = (𝐵 − 𝐴)) |
| 32 | 31 | adantl 481 | . . . 4 ⊢ ((¬ 𝐴 = 𝐵 ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → ((𝐵 − (𝐴 + 1)) + 1) = (𝐵 − 𝐴)) |
| 33 | 27, 32 | eqtrd 2772 | . . 3 ⊢ ((¬ 𝐴 = 𝐵 ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → (♯‘((𝐴 + 1)...𝐵)) = (𝐵 − 𝐴)) |
| 34 | 33 | ex 412 | . 2 ⊢ (¬ 𝐴 = 𝐵 → (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘((𝐴 + 1)...𝐵)) = (𝐵 − 𝐴))) |
| 35 | 18, 34 | pm2.61i 182 | 1 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (♯‘((𝐴 + 1)...𝐵)) = (𝐵 − 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ∅c0 4274 class class class wbr 5086 ‘cfv 6490 (class class class)co 7358 0cc0 11027 1c1 11028 + caddc 11030 < clt 11167 − cmin 11365 ℤcz 12489 ℤ≥cuz 12752 ...cfz 13424 ♯chash 14254 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-card 9852 df-pnf 11169 df-mnf 11170 df-xr 11171 df-ltxr 11172 df-le 11173 df-sub 11367 df-neg 11368 df-nn 12147 df-n0 12403 df-z 12490 df-uz 12753 df-fz 13425 df-hash 14255 |
| This theorem is referenced by: 2lgslem1 27345 sticksstones12a 42588 |
| Copyright terms: Public domain | W3C validator |