| 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 9885 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁)) | |
| 2 | eqid 2234 | . . . . . . 7 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
| 3 | 2 | frechashgf1o 10814 | . . . . . 6 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0):ω–1-1-onto→ℕ0 |
| 4 | peano2uz 9933 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) | |
| 5 | uznn0sub 9904 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) | |
| 6 | 4, 5 | syl 14 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 + 1) − 𝑀) ∈ ℕ0) |
| 7 | f1ocnvdm 5960 | . . . . . 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 7140 | . . . . 5 ⊢ ((◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ ω → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) | |
| 10 | 8, 9 | syl 14 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀)) ∈ Fin) |
| 11 | 2 | frecfzen2 10813 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...𝑁) ≈ (◡frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)‘((𝑁 + 1) − 𝑀))) |
| 12 | enfii 7142 | . . . 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 9640 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) | |
| 16 | 15 | ancoms 268 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) |
| 17 | fzn 10396 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅)) | |
| 18 | 16, 17 | bitr3d 190 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 ↔ (𝑀...𝑁) = ∅)) |
| 19 | 0fi 7154 | . . . 4 ⊢ ∅ ∈ Fin | |
| 20 | eleq1 2297 | . . . 4 ⊢ ((𝑀...𝑁) = ∅ → ((𝑀...𝑁) ∈ Fin ↔ ∅ ∈ Fin)) | |
| 21 | 19, 20 | mpbiri 168 | . . 3 ⊢ ((𝑀...𝑁) = ∅ → (𝑀...𝑁) ∈ Fin) |
| 22 | 18, 21 | biimtrdi 163 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑀 ≤ 𝑁 → (𝑀...𝑁) ∈ Fin)) |
| 23 | zdcle 9671 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ≤ 𝑁) | |
| 24 | df-dc 843 | . . 3 ⊢ (DECID 𝑀 ≤ 𝑁 ↔ (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁)) | |
| 25 | 23, 24 | sylib 122 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ∨ ¬ 𝑀 ≤ 𝑁)) |
| 26 | 14, 22, 25 | mpjaod 726 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 DECID wdc 842 = wceq 1398 ∈ wcel 2205 ∅c0 3512 class class class wbr 4114 ↦ cmpt 4176 ωcom 4717 ◡ccnv 4753 –1-1-onto→wf1o 5356 ‘cfv 5357 (class class class)co 6058 freccfrec 6634 ≈ cen 6986 Fincfn 6988 0cc0 8143 1c1 8144 + caddc 8146 < clt 8324 ≤ cle 8325 − cmin 8460 ℕ0cn0 9513 ℤcz 9594 ℤ≥cuz 9871 ...cfz 10361 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-frec 6635 df-1o 6660 df-er 6780 df-en 6989 df-fin 6991 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-inn 9255 df-n0 9514 df-z 9595 df-uz 9872 df-fz 10362 |
| This theorem is referenced by: fzfigd 10817 fzofig 10818 isfinite4im 11180 phibnd 12939 ballotfilemofi 13163 ballotfilem1 13164 ballotfilem2 13172 ballotfilemfmpn 13178 ballotfilemefi 13181 ballotfilemodife 13184 ballotfilemsval 13196 ballotfilemrval 13205 konigsbergvtx 16603 konigsbergiedg 16604 konigsbergumgr 16608 konigsberglem1 16609 konigsberglem2 16610 konigsberglem3 16611 konigsberglem5 16613 konigsberg 16614 |
| Copyright terms: Public domain | W3C validator |