| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzfig | GIF version | ||
| Description: A finite interval of integers is finite. (Contributed by Jim Kingdon, 19-May-2020.) |
| Ref | Expression |
|---|---|
| fzfig | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluz 9660 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁)) | |
| 2 | eqid 2204 | . . . . . . 7 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
| 3 | 2 | frechashgf1o 10571 | . . . . . 6 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0):ω–1-1-onto→ℕ0 |
| 4 | peano2uz 9703 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) | |
| 5 | uznn0sub 9679 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) | |
| 6 | 4, 5 | syl 14 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) |
| 7 | f1ocnvdm 5849 | . . . . . 6 ⊢ ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0):ω–1-1-onto→ℕ0 ∧ ((𝑁 + 1) − 𝑀) ∈ ℕ0) → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ ω) | |
| 8 | 3, 6, 7 | sylancr 414 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ ω) |
| 9 | nnfi 6968 | . . . . 5 ⊢ ((◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ ω → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) | |
| 10 | 8, 9 | syl 14 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) |
| 11 | 2 | frecfzen2 10570 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...𝑁) ≈ (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀))) |
| 12 | enfii 6970 | . . . 4 ⊢ (((◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin ∧ (𝑀...𝑁) ≈ (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀))) → (𝑀...𝑁) ∈ Fin) | |
| 13 | 10, 11, 12 | syl2anc 411 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...𝑁) ∈ Fin) |
| 14 | 1, 13 | biimtrrdi 164 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 → (𝑀...𝑁) ∈ Fin)) |
| 15 | zltnle 9417 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) | |
| 16 | 15 | ancoms 268 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) |
| 17 | fzn 10163 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅)) | |
| 18 | 16, 17 | bitr3d 190 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 ↔ (𝑀...𝑁) = ∅)) |
| 19 | 0fin 6980 | . . . 4 ⊢ ∅ ∈ Fin | |
| 20 | eleq1 2267 | . . . 4 ⊢ ((𝑀...𝑁) = ∅ → ((𝑀...𝑁) ∈ Fin ↔ ∅ ∈ Fin)) | |
| 21 | 19, 20 | mpbiri 168 | . . 3 ⊢ ((𝑀...𝑁) = ∅ → (𝑀...𝑁) ∈ Fin) |
| 22 | 18, 21 | biimtrdi 163 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 → (𝑀...𝑁) ∈ Fin)) |
| 23 | zdcle 9448 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ≤ 𝑁) | |
| 24 | df-dc 836 | . . 3 ⊢ (DECID 𝑀 ≤ 𝑁 ↔ (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁)) | |
| 25 | 23, 24 | sylib 122 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁)) |
| 26 | 14, 22, 25 | mpjaod 719 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 = wceq 1372 ∈ wcel 2175 ∅c0 3459 class class class wbr 4043 ↦ cmpt 4104 ωcom 4637 ◡ccnv 4673 –1-1-onto→wf1o 5269 ‘cfv 5270 (class class class)co 5943 freccfrec 6475 ≈ cen 6824 Fincfn 6826 0cc0 7924 1c1 7925 + caddc 7927 < clt 8106 ≤ cle 8107 − cmin 8242 ℕ0cn0 9294 ℤcz 9371 ℤ≥cuz 9647 ...cfz 10129 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-coll 4158 ax-sep 4161 ax-nul 4169 ax-pow 4217 ax-pr 4252 ax-un 4479 ax-setind 4584 ax-iinf 4635 ax-cnex 8015 ax-resscn 8016 ax-1cn 8017 ax-1re 8018 ax-icn 8019 ax-addcl 8020 ax-addrcl 8021 ax-mulcl 8022 ax-addcom 8024 ax-addass 8026 ax-distr 8028 ax-i2m1 8029 ax-0lt1 8030 ax-0id 8032 ax-rnegex 8033 ax-cnre 8035 ax-pre-ltirr 8036 ax-pre-ltwlin 8037 ax-pre-lttrn 8038 ax-pre-apti 8039 ax-pre-ltadd 8040 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-nel 2471 df-ral 2488 df-rex 2489 df-reu 2490 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-nul 3460 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-int 3885 df-iun 3928 df-br 4044 df-opab 4105 df-mpt 4106 df-tr 4142 df-id 4339 df-iord 4412 df-on 4414 df-ilim 4415 df-suc 4417 df-iom 4638 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-rn 4685 df-res 4686 df-ima 4687 df-iota 5231 df-fun 5272 df-fn 5273 df-f 5274 df-f1 5275 df-fo 5276 df-f1o 5277 df-fv 5278 df-riota 5898 df-ov 5946 df-oprab 5947 df-mpo 5948 df-1st 6225 df-2nd 6226 df-recs 6390 df-frec 6476 df-1o 6501 df-er 6619 df-en 6827 df-fin 6829 df-pnf 8108 df-mnf 8109 df-xr 8110 df-ltxr 8111 df-le 8112 df-sub 8244 df-neg 8245 df-inn 9036 df-n0 9295 df-z 9372 df-uz 9648 df-fz 10130 |
| This theorem is referenced by: fzfigd 10574 fzofig 10575 isfinite4im 10935 phibnd 12481 |
| Copyright terms: Public domain | W3C validator |