Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fzssuz | GIF version |
Description: A finite set of sequential integers is a subset of an upper set of integers. (Contributed by NM, 28-Oct-2005.) |
Ref | Expression |
---|---|
fzssuz | ⊢ (𝑀...𝑁) ⊆ (ℤ≥‘𝑀) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfzuz 9770 | . 2 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
2 | 1 | ssriv 3071 | 1 ⊢ (𝑀...𝑁) ⊆ (ℤ≥‘𝑀) |
Colors of variables: wff set class |
Syntax hints: ⊆ wss 3041 ‘cfv 5093 (class class class)co 5742 ℤ≥cuz 9294 ...cfz 9758 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-pow 4068 ax-pr 4101 ax-setind 4422 ax-cnex 7679 ax-resscn 7680 |
This theorem depends on definitions: df-bi 116 df-3or 948 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-ral 2398 df-rex 2399 df-rab 2402 df-v 2662 df-sbc 2883 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-br 3900 df-opab 3960 df-mpt 3961 df-id 4185 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-res 4521 df-ima 4522 df-iota 5058 df-fun 5095 df-fn 5096 df-f 5097 df-fv 5101 df-ov 5745 df-oprab 5746 df-mpo 5747 df-neg 7904 df-z 9023 df-uz 9295 df-fz 9759 |
This theorem is referenced by: fzssnn 9816 fzossnn0 9920 seq3split 10220 seq3caopr2 10223 summodclem2a 11118 fisumss 11129 fsumsersdc 11132 isumclim3 11160 binomlem 11220 isprm3 11726 2prm 11735 |
Copyright terms: Public domain | W3C validator |