| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > isfinite4im | GIF version | ||
| Description: A finite set is equinumerous to the range of integers from one up to the hash value of the set. (Contributed by Jim Kingdon, 22-Feb-2022.) |
| Ref | Expression |
|---|---|
| isfinite4im | ⊢ (𝐴 ∈ Fin → (1...(♯‘𝐴)) ≈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hashcl 11222 | . . 3 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0) | |
| 2 | hashfz1 11224 | . . 3 ⊢ ((♯‘𝐴) ∈ ℕ0 → (♯‘(1...(♯‘𝐴))) = (♯‘𝐴)) | |
| 3 | 1, 2 | syl 14 | . 2 ⊢ (𝐴 ∈ Fin → (♯‘(1...(♯‘𝐴))) = (♯‘𝐴)) |
| 4 | 1z 9672 | . . . 4 ⊢ 1 ∈ ℤ | |
| 5 | 1 | nn0zd 9768 | . . . 4 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℤ) |
| 6 | fzfig 10869 | . . . 4 ⊢ ((1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ) → (1...(♯‘𝐴)) ∈ Fin) | |
| 7 | 4, 5, 6 | sylancr 418 | . . 3 ⊢ (𝐴 ∈ Fin → (1...(♯‘𝐴)) ∈ Fin) |
| 8 | hashen 11225 | . . 3 ⊢ (((1...(♯‘𝐴)) ∈ Fin ∧ 𝐴 ∈ Fin) → ((♯‘(1...(♯‘𝐴))) = (♯‘𝐴) ↔ (1...(♯‘𝐴)) ≈ 𝐴)) | |
| 9 | 7, 8 | mpancom 426 | . 2 ⊢ (𝐴 ∈ Fin → ((♯‘(1...(♯‘𝐴))) = (♯‘𝐴) ↔ (1...(♯‘𝐴)) ≈ 𝐴)) |
| 10 | 3, 9 | mpbid 147 | 1 ⊢ (𝐴 ∈ Fin → (1...(♯‘𝐴)) ≈ 𝐴) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 105 = wceq 1402 ∈ wcel 2209 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 ≈ cen 7020 Fincfn 7022 1c1 8180 ℕ0cn0 9565 ℤcz 9646 ...cfz 10413 ♯chash 11216 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-1o 6687 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9306 df-n0 9566 df-z 9647 df-uz 9924 df-fz 10414 df-ihash 11217 |
| This theorem is used by: sseqn 11281 fz1f1o 12143 gsumf1ofi 14162 gsummhmfi 14166 gsumressfi 14169 |
| Copyright terms: Public domain | W3C validator |