| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fz1ssnn | Structured version Visualization version GIF version | ||
| Description: A finite set of positive integers is a set of positive integers. (Contributed by Stefan O'Rear, 16-Oct-2014.) |
| Ref | Expression |
|---|---|
| fz1ssnn | ⊢ (1...𝐴) ⊆ ℕ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfznn 13560 | . 2 ⊢ (𝑎 ∈ (1...𝐴) → 𝑎 ∈ ℕ) | |
| 2 | 1 | ssriv 3942 | 1 ⊢ (1...𝐴) ⊆ ℕ |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3906 (class class class)co 7398 1c1 11076 ℕcn 12212 ...cfz 13514 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-1st 7972 df-2nd 7973 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-er 8680 df-en 8930 df-dom 8931 df-sdom 8932 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-sub 11418 df-neg 11419 df-nn 12213 df-z 12571 df-uz 12842 df-fz 13515 |
| This theorem is referenced by: fzssnn 13575 fzossnn 13719 isercoll 15697 prmreclem2 16955 prmreclem3 16956 vdwnnlem1 17033 prmodvdslcmf 17085 gsumval3 19949 1stcfb 23507 1stckgenlem 23615 ovoliunlem1 25566 ovoliun2 25570 ovolicc2lem4 25584 uniioovol 25643 uniioombllem4 25650 lgamgulm2 27102 lgamcvglem 27106 fsumvma2 27280 dchrmusum2 27560 dchrvmasum2lem 27562 mudivsum 27596 mulogsum 27598 mulog2sumlem2 27601 padct 32922 psgnfzto1stlem 33282 fzto1st1 33284 smatrcl 34095 smatlem 34096 smattr 34098 smatbl 34099 smatbr 34100 1smat1 34103 submateqlem1 34106 submateqlem2 34107 submateq 34108 madjusmdetlem2 34127 madjusmdetlem3 34128 madjusmdetlem4 34129 mdetlap 34131 esumsup 34388 esumgect 34389 carsggect 34617 carsgclctunlem2 34618 ballotlemsup 34804 fsum2dsub 34903 reprgt 34917 reprfi2 34919 reprfz1 34920 hashrepr 34921 breprexplema 34926 breprexplemc 34928 breprexp 34929 breprexpnat 34930 vtscl 34934 circlemeth 34936 hgt750lemd 34944 hgt750lemb 34952 hgt750leme 34954 lcmineqlem4 42654 lcmineqlem6 42656 lcmineqlem15 42665 lcmineqlem16 42666 lcmineqlem19 42669 lcmineqlem20 42670 lcmineqlem21 42671 lcmineqlem22 42672 sticksstones1 42768 fisdomnn 42865 sumcubes 42927 eldioph4b 43393 diophren 43395 caratheodorylem2 47106 hoidmvlelem2 47175 |
| Copyright terms: Public domain | W3C validator |