Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fz01en | Structured version Visualization version 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 12026 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
2 | 0z 11993 | . . . 4 ⊢ 0 ∈ ℤ | |
3 | 1z 12013 | . . . 4 ⊢ 1 ∈ ℤ | |
4 | fzen 12925 | . . . 4 ⊢ ((0 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ ∧ 1 ∈ ℤ) → (0...(𝑁 − 1)) ≈ ((0 + 1)...((𝑁 − 1) + 1))) | |
5 | 2, 3, 4 | mp3an13 1448 | . . 3 ⊢ ((𝑁 − 1) ∈ ℤ → (0...(𝑁 − 1)) ≈ ((0 + 1)...((𝑁 − 1) + 1))) |
6 | 1, 5 | syl 17 | . 2 ⊢ (𝑁 ∈ ℤ → (0...(𝑁 − 1)) ≈ ((0 + 1)...((𝑁 − 1) + 1))) |
7 | 0p1e1 11760 | . . . 4 ⊢ (0 + 1) = 1 | |
8 | 7 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℤ → (0 + 1) = 1) |
9 | zcn 11987 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
10 | ax-1cn 10595 | . . . 4 ⊢ 1 ∈ ℂ | |
11 | npcan 10895 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
12 | 9, 10, 11 | sylancl 588 | . . 3 ⊢ (𝑁 ∈ ℤ → ((𝑁 − 1) + 1) = 𝑁) |
13 | 8, 12 | oveq12d 7174 | . 2 ⊢ (𝑁 ∈ ℤ → ((0 + 1)...((𝑁 − 1) + 1)) = (1...𝑁)) |
14 | 6, 13 | breqtrd 5092 | 1 ⊢ (𝑁 ∈ ℤ → (0...(𝑁 − 1)) ≈ (1...𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 class class class wbr 5066 (class class class)co 7156 ≈ cen 8506 ℂcc 10535 0cc0 10537 1c1 10538 + caddc 10540 − cmin 10870 ℤcz 11982 ...cfz 12893 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-n0 11899 df-z 11983 df-fz 12894 |
This theorem is referenced by: bpolylem 15402 4sqlem11 16291 dfod2 18691 |
Copyright terms: Public domain | W3C validator |