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 9795 | . 2 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
2 | 1 | ssriv 3096 | 1 ⊢ (𝑀...𝑁) ⊆ (ℤ≥‘𝑀) |
Colors of variables: wff set class |
Syntax hints: ⊆ wss 3066 ‘cfv 5118 (class class class)co 5767 ℤ≥cuz 9319 ...cfz 9783 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 ax-setind 4447 ax-cnex 7704 ax-resscn 7705 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ne 2307 df-ral 2419 df-rex 2420 df-rab 2423 df-v 2683 df-sbc 2905 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-br 3925 df-opab 3985 df-mpt 3986 df-id 4210 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-rn 4545 df-res 4546 df-ima 4547 df-iota 5083 df-fun 5120 df-fn 5121 df-f 5122 df-fv 5126 df-ov 5770 df-oprab 5771 df-mpo 5772 df-neg 7929 df-z 9048 df-uz 9320 df-fz 9784 |
This theorem is referenced by: fzssnn 9841 fzossnn0 9945 seq3split 10245 seq3caopr2 10248 summodclem2a 11143 fisumss 11154 fsumsersdc 11157 isumclim3 11185 binomlem 11245 isprm3 11788 2prm 11797 |
Copyright terms: Public domain | W3C validator |