| 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 9759 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁)) | |
| 2 | eqid 2229 | . . . . . . 7 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
| 3 | 2 | frechashgf1o 10680 | . . . . . 6 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0):ω–1-1-onto→ℕ0 |
| 4 | peano2uz 9807 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) | |
| 5 | uznn0sub 9778 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) | |
| 6 | 4, 5 | syl 14 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) |
| 7 | f1ocnvdm 5917 | . . . . . 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 7054 | . . . . 5 ⊢ ((◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ ω → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) | |
| 10 | 8, 9 | syl 14 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) |
| 11 | 2 | frecfzen2 10679 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...𝑁) ≈ (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀))) |
| 12 | enfii 7056 | . . . 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 9515 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) | |
| 16 | 15 | ancoms 268 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) |
| 17 | fzn 10267 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅)) | |
| 18 | 16, 17 | bitr3d 190 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 ↔ (𝑀...𝑁) = ∅)) |
| 19 | 0fi 7066 | . . . 4 ⊢ ∅ ∈ Fin | |
| 20 | eleq1 2292 | . . . 4 ⊢ ((𝑀...𝑁) = ∅ → ((𝑀...𝑁) ∈ Fin ↔ ∅ ∈ Fin)) | |
| 21 | 19, 20 | mpbiri 168 | . . 3 ⊢ ((𝑀...𝑁) = ∅ → (𝑀...𝑁) ∈ Fin) |
| 22 | 18, 21 | biimtrdi 163 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 → (𝑀...𝑁) ∈ Fin)) |
| 23 | zdcle 9546 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ≤ 𝑁) | |
| 24 | df-dc 840 | . . 3 ⊢ (DECID 𝑀 ≤ 𝑁 ↔ (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁)) | |
| 25 | 23, 24 | sylib 122 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁)) |
| 26 | 14, 22, 25 | mpjaod 723 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 713 DECID wdc 839 = wceq 1395 ∈ wcel 2200 ∅c0 3492 class class class wbr 4086 ↦ cmpt 4148 ωcom 4686 ◡ccnv 4722 –1-1-onto→wf1o 5323 ‘cfv 5324 (class class class)co 6013 freccfrec 6551 ≈ cen 6902 Fincfn 6904 0cc0 8022 1c1 8023 + caddc 8025 < clt 8204 ≤ cle 8205 − cmin 8340 ℕ0cn0 9392 ℤcz 9469 ℤ≥cuz 9745 ...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-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 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-apti 8137 ax-pre-ltadd 8138 |
| This theorem depends on definitions: df-bi 117 df-dc 840 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-nul 3493 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-tr 4186 df-id 4388 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 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-recs 6466 df-frec 6552 df-1o 6577 df-er 6697 df-en 6905 df-fin 6907 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-uz 9746 df-fz 10234 |
| This theorem is referenced by: fzfigd 10683 fzofig 10684 isfinite4im 11044 phibnd 12779 |
| Copyright terms: Public domain | W3C validator |