| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nn0fz0 | Structured version Visualization version GIF version | ||
| Description: A nonnegative integer is always part of the finite set of sequential nonnegative integers with this integer as upper bound. (Contributed by Scott Fenton, 21-Mar-2018.) |
| Ref | Expression |
|---|---|
| nn0fz0 | ⊢ (𝑁 ∈ ℕ0 ↔ 𝑁 ∈ (0...𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 22 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℕ0) | |
| 2 | nn0re 12446 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 3 | 2 | leidd 11716 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ≤ 𝑁) |
| 4 | fznn0 13573 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ∈ (0...𝑁) ↔ (𝑁 ∈ ℕ0 ∧ 𝑁 ≤ 𝑁))) | |
| 5 | 1, 3, 4 | mpbir2and 714 | . 2 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ (0...𝑁)) |
| 6 | elfz3nn0 13575 | . 2 ⊢ (𝑁 ∈ (0...𝑁) → 𝑁 ∈ ℕ0) | |
| 7 | 5, 6 | impbii 209 | 1 ⊢ (𝑁 ∈ ℕ0 ↔ 𝑁 ∈ (0...𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2114 class class class wbr 5085 (class class class)co 7367 0cc0 11038 ≤ cle 11180 ℕ0cn0 12437 ...cfz 13461 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-fz 13462 |
| This theorem is referenced by: swrdrlen 14622 pfxid 14647 pfxccat1 14664 pfxpfxid 14671 pfxcctswrd 14672 pfxccatin12 14695 pfxccatid 14703 cshwlen 14761 cshwidxmod 14765 fallfacfac 16010 cayhamlem1 22831 cpmadugsumlemF 22841 wlkepvtx 29727 wlkp1lem7 29746 wlkp1lem8 29747 dfpth2 29797 spthdep 29802 crctcshwlkn0lem6 29883 crctcsh 29892 wwlknllvtx 29914 wwlksnred 29960 wpthswwlks2on 30032 konigsbergiedgw 30318 konigsberglem1 30322 konigsberglem2 30323 konigsberglem3 30324 dlwwlknondlwlknonf1olem1 30434 splfv3 33018 gsummulsubdishift1 33129 gsummulsubdishift2 33130 gsummulsubdishift1s 33131 gsummulsubdishift2s 33132 cycpmco2f1 33185 cycpmco2rn 33186 cycpmco2lem3 33189 cycpmco2lem4 33190 cycpmco2lem5 33191 cycpmco2lem6 33192 cycpmco2lem7 33193 cycpmco2 33194 esplyfvn 33721 iwrdsplit 34531 fibp1 34545 revpfxsfxrev 35298 poimirlem10 37951 poimirlem17 37958 poimirlem23 37964 poimirlem26 37967 poimirlem27 37968 iccpartiltu 47882 iccpartlt 47884 iccpartleu 47888 iccpartrn 47890 iccelpart 47893 iccpartiun 47894 iccpartdisj 47897 upgrimpthslem2 48384 upgrimpths 48385 upgrimcycls 48387 cycl3grtri 48423 usgrexmpl1lem 48497 |
| Copyright terms: Public domain | W3C validator |