| 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 9769 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁)) | |
| 2 | eqid 2231 | . . . . . . 7 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
| 3 | 2 | frechashgf1o 10691 | . . . . . 6 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0):ω–1-1-onto→ℕ0 |
| 4 | peano2uz 9817 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) | |
| 5 | uznn0sub 9788 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) | |
| 6 | 4, 5 | syl 14 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) |
| 7 | f1ocnvdm 5922 | . . . . . 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 7059 | . . . . 5 ⊢ ((◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ ω → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) | |
| 10 | 8, 9 | syl 14 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) |
| 11 | 2 | frecfzen2 10690 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...𝑁) ≈ (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀))) |
| 12 | enfii 7061 | . . . 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 9525 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) | |
| 16 | 15 | ancoms 268 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) |
| 17 | fzn 10277 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅)) | |
| 18 | 16, 17 | bitr3d 190 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 ↔ (𝑀...𝑁) = ∅)) |
| 19 | 0fi 7073 | . . . 4 ⊢ ∅ ∈ Fin | |
| 20 | eleq1 2294 | . . . 4 ⊢ ((𝑀...𝑁) = ∅ → ((𝑀...𝑁) ∈ Fin ↔ ∅ ∈ Fin)) | |
| 21 | 19, 20 | mpbiri 168 | . . 3 ⊢ ((𝑀...𝑁) = ∅ → (𝑀...𝑁) ∈ Fin) |
| 22 | 18, 21 | biimtrdi 163 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 → (𝑀...𝑁) ∈ Fin)) |
| 23 | zdcle 9556 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ≤ 𝑁) | |
| 24 | df-dc 842 | . . 3 ⊢ (DECID 𝑀 ≤ 𝑁 ↔ (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁)) | |
| 25 | 23, 24 | sylib 122 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁)) |
| 26 | 14, 22, 25 | mpjaod 725 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 715 DECID wdc 841 = wceq 1397 ∈ wcel 2202 ∅c0 3494 class class class wbr 4088 ↦ cmpt 4150 ωcom 4688 ◡ccnv 4724 –1-1-onto→wf1o 5325 ‘cfv 5326 (class class class)co 6018 freccfrec 6556 ≈ cen 6907 Fincfn 6909 0cc0 8032 1c1 8033 + caddc 8035 < clt 8214 ≤ cle 8215 − cmin 8350 ℕ0cn0 9402 ℤcz 9479 ℤ≥cuz 9755 ...cfz 10243 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-frec 6557 df-1o 6582 df-er 6702 df-en 6910 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-n0 9403 df-z 9480 df-uz 9756 df-fz 10244 |
| This theorem is referenced by: fzfigd 10694 fzofig 10695 isfinite4im 11055 phibnd 12807 konigsbergvtx 16352 konigsbergiedg 16353 konigsbergumgr 16357 konigsberglem1 16358 konigsberglem2 16359 konigsberglem3 16360 konigsberglem5 16362 konigsberg 16363 |
| Copyright terms: Public domain | W3C validator |