| 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 9631 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁)) | |
| 2 | eqid 2196 | . . . . . . 7 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
| 3 | 2 | frechashgf1o 10537 | . . . . . 6 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0):ω–1-1-onto→ℕ0 |
| 4 | peano2uz 9674 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) | |
| 5 | uznn0sub 9650 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) | |
| 6 | 4, 5 | syl 14 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) |
| 7 | f1ocnvdm 5831 | . . . . . 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 6942 | . . . . 5 ⊢ ((◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ ω → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) | |
| 10 | 8, 9 | syl 14 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) |
| 11 | 2 | frecfzen2 10536 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...𝑁) ≈ (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀))) |
| 12 | enfii 6944 | . . . 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 9389 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) | |
| 16 | 15 | ancoms 268 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) |
| 17 | fzn 10134 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅)) | |
| 18 | 16, 17 | bitr3d 190 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 ↔ (𝑀...𝑁) = ∅)) |
| 19 | 0fin 6954 | . . . 4 ⊢ ∅ ∈ Fin | |
| 20 | eleq1 2259 | . . . 4 ⊢ ((𝑀...𝑁) = ∅ → ((𝑀...𝑁) ∈ Fin ↔ ∅ ∈ Fin)) | |
| 21 | 19, 20 | mpbiri 168 | . . 3 ⊢ ((𝑀...𝑁) = ∅ → (𝑀...𝑁) ∈ Fin) |
| 22 | 18, 21 | biimtrdi 163 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 → (𝑀...𝑁) ∈ Fin)) |
| 23 | zdcle 9419 | . . 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 1364 ∈ wcel 2167 ∅c0 3451 class class class wbr 4034 ↦ cmpt 4095 ωcom 4627 ◡ccnv 4663 –1-1-onto→wf1o 5258 ‘cfv 5259 (class class class)co 5925 freccfrec 6457 ≈ cen 6806 Fincfn 6808 0cc0 7896 1c1 7897 + caddc 7899 < clt 8078 ≤ cle 8079 − cmin 8214 ℕ0cn0 9266 ℤcz 9343 ℤ≥cuz 9618 ...cfz 10100 |
| 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-addcom 7996 ax-addass 7998 ax-distr 8000 ax-i2m1 8001 ax-0lt1 8002 ax-0id 8004 ax-rnegex 8005 ax-cnre 8007 ax-pre-ltirr 8008 ax-pre-ltwlin 8009 ax-pre-lttrn 8010 ax-pre-apti 8011 ax-pre-ltadd 8012 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-iord 4402 df-on 4404 df-ilim 4405 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-frec 6458 df-1o 6483 df-er 6601 df-en 6809 df-fin 6811 df-pnf 8080 df-mnf 8081 df-xr 8082 df-ltxr 8083 df-le 8084 df-sub 8216 df-neg 8217 df-inn 9008 df-n0 9267 df-z 9344 df-uz 9619 df-fz 10101 |
| This theorem is referenced by: fzfigd 10540 fzofig 10541 isfinite4im 10901 phibnd 12410 |
| Copyright terms: Public domain | W3C validator |