| 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 9561 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
| 2 | 0z 9534 | . . . 4 ⊢ 0 ∈ ℤ | |
| 3 | 1z 9549 | . . . 4 ⊢ 1 ∈ ℤ | |
| 4 | fzen 10323 | . . . 4 ⊢ ((0 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ ∧ 1 ∈ ℤ) → (0...(𝑁 − 1)) ≈ ((0 + 1)...((𝑁 − 1) + 1))) | |
| 5 | 2, 3, 4 | mp3an13 1365 | . . 3 ⊢ ((𝑁 − 1) ∈ ℤ → (0...(𝑁 − 1)) ≈ ((0 + 1)...((𝑁 − 1) + 1))) |
| 6 | 1, 5 | syl 14 | . 2 ⊢ (𝑁 ∈ ℤ → (0...(𝑁 − 1)) ≈ ((0 + 1)...((𝑁 − 1) + 1))) |
| 7 | 0p1e1 9299 | . . . 4 ⊢ (0 + 1) = 1 | |
| 8 | 7 | a1i 9 | . . 3 ⊢ (𝑁 ∈ ℤ → (0 + 1) = 1) |
| 9 | zcn 9528 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 10 | ax-1cn 8168 | . . . 4 ⊢ 1 ∈ ℂ | |
| 11 | npcan 8430 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
| 12 | 9, 10, 11 | sylancl 413 | . . 3 ⊢ (𝑁 ∈ ℤ → ((𝑁 − 1) + 1) = 𝑁) |
| 13 | 8, 12 | oveq12d 6046 | . 2 ⊢ (𝑁 ∈ ℤ → ((0 + 1)...((𝑁 − 1) + 1)) = (1...𝑁)) |
| 14 | 6, 13 | breqtrd 4119 | 1 ⊢ (𝑁 ∈ ℤ → (0...(𝑁 − 1)) ≈ (1...𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2202 class class class wbr 4093 (class class class)co 6028 ≈ cen 6950 ℂcc 8073 0cc0 8075 1c1 8076 + caddc 8078 − cmin 8392 ℤcz 9523 ...cfz 10288 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-en 6953 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-inn 9186 df-n0 9445 df-z 9524 df-fz 10289 |
| This theorem is referenced by: 4sqlem11 13037 |
| Copyright terms: Public domain | W3C validator |