| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fz01en | GIF version | ||
| Description: 0-based and 1-based finite sets of sequential integers are equinumerous. (Contributed by Paul Chapman, 11-Apr-2009.) |
| Ref | Expression |
|---|---|
| fz01en | ⊢ (𝑁 ∈ ℤ → (0...(𝑁 − 1)) ≈ (1...𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | peano2zm 9507 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
| 2 | 0z 9480 | . . . 4 ⊢ 0 ∈ ℤ | |
| 3 | 1z 9495 | . . . 4 ⊢ 1 ∈ ℤ | |
| 4 | fzen 10268 | . . . 4 ⊢ ((0 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ ∧ 1 ∈ ℤ) → (0...(𝑁 − 1)) ≈ ((0 + 1)...((𝑁 − 1) + 1))) | |
| 5 | 2, 3, 4 | mp3an13 1362 | . . 3 ⊢ ((𝑁 − 1) ∈ ℤ → (0...(𝑁 − 1)) ≈ ((0 + 1)...((𝑁 − 1) + 1))) |
| 6 | 1, 5 | syl 14 | . 2 ⊢ (𝑁 ∈ ℤ → (0...(𝑁 − 1)) ≈ ((0 + 1)...((𝑁 − 1) + 1))) |
| 7 | 0p1e1 9247 | . . . 4 ⊢ (0 + 1) = 1 | |
| 8 | 7 | a1i 9 | . . 3 ⊢ (𝑁 ∈ ℤ → (0 + 1) = 1) |
| 9 | zcn 9474 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 10 | ax-1cn 8115 | . . . 4 ⊢ 1 ∈ ℂ | |
| 11 | npcan 8378 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
| 12 | 9, 10, 11 | sylancl 413 | . . 3 ⊢ (𝑁 ∈ ℤ → ((𝑁 − 1) + 1) = 𝑁) |
| 13 | 8, 12 | oveq12d 6031 | . 2 ⊢ (𝑁 ∈ ℤ → ((0 + 1)...((𝑁 − 1) + 1)) = (1...𝑁)) |
| 14 | 6, 13 | breqtrd 4112 | 1 ⊢ (𝑁 ∈ ℤ → (0...(𝑁 − 1)) ≈ (1...𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 class class class wbr 4086 (class class class)co 6013 ≈ cen 6902 ℂcc 8020 0cc0 8022 1c1 8023 + caddc 8025 − cmin 8340 ℤcz 9469 ...cfz 10233 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-ltadd 8138 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-en 6905 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-inn 9134 df-n0 9393 df-z 9470 df-fz 10234 |
| This theorem is referenced by: 4sqlem11 12964 |
| Copyright terms: Public domain | W3C validator |