| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fnfz0hash | GIF version | ||
| Description: The size of a function on a finite set of sequential nonnegative integers. (Contributed by Alexander van der Vekens, 25-Jun-2018.) |
| Ref | Expression |
|---|---|
| fnfz0hash | ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (0...𝑁)) → (♯‘𝐹) = (𝑁 + 1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 110 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (0...𝑁)) → 𝐹 Fn (0...𝑁)) | |
| 2 | 0zd 9667 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (0...𝑁)) → 0 ∈ ℤ) | |
| 3 | simpl 109 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (0...𝑁)) → 𝑁 ∈ ℕ0) | |
| 4 | 3 | nn0zd 9777 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (0...𝑁)) → 𝑁 ∈ ℤ) |
| 5 | 2, 4 | fzfigd 10889 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (0...𝑁)) → (0...𝑁) ∈ Fin) |
| 6 | fihashfn 11262 | . . 3 ⊢ ((𝐹 Fn (0...𝑁) ∧ (0...𝑁) ∈ Fin) → (♯‘𝐹) = (♯‘(0...𝑁))) | |
| 7 | 1, 5, 6 | syl2anc 415 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (0...𝑁)) → (♯‘𝐹) = (♯‘(0...𝑁))) |
| 8 | hashfz0 11288 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (♯‘(0...𝑁)) = (𝑁 + 1)) | |
| 9 | 8 | adantr 276 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (0...𝑁)) → (♯‘(0...𝑁)) = (𝑁 + 1)) |
| 10 | 7, 9 | eqtrd 2271 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (0...𝑁)) → (♯‘𝐹) = (𝑁 + 1)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 Fn wfn 5375 ‘cfv 5380 (class class class)co 6088 Fincfn 7026 0cc0 8185 1c1 8186 + caddc 8188 ℕ0cn0 9574 ...cfz 10428 ♯chash 11236 |
| 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 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 |
| 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-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-frec 6666 df-1o 6691 df-er 6811 df-en 7027 df-dom 7028 df-fin 7029 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-n0 9575 df-z 9656 df-uz 9938 df-fz 10429 df-ihash 11237 |
| This theorem is used by: ffz0hash 11298 |
| Copyright terms: Public domain | W3C validator |