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 11178 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
3 | 2 | leidd 10473 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ≤ 𝑁) |
4 | fznn0 12301 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ∈ (0...𝑁) ↔ (𝑁 ∈ ℕ0 ∧ 𝑁 ≤ 𝑁))) | |
5 | 1, 3, 4 | mpbir2and 959 | . 2 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ (0...𝑁)) |
6 | elfz3nn0 12303 | . 2 ⊢ (𝑁 ∈ (0...𝑁) → 𝑁 ∈ ℕ0) | |
7 | 5, 6 | impbii 198 | 1 ⊢ (𝑁 ∈ ℕ0 ↔ 𝑁 ∈ (0...𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 ∈ wcel 1977 class class class wbr 4583 (class class class)co 6549 0cc0 9815 ≤ cle 9954 ℕ0cn0 11169 ...cfz 12197 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 |
This theorem is referenced by: swrdid 13280 swrdrlen 13287 swrd0len0 13288 swrd0swrdid 13316 wrdcctswrd 13317 swrdccatwrd 13320 swrdccatin12 13342 cshwlen 13396 cshwidxmod 13400 fallfacfac 14615 cayhamlem1 20490 cpmadugsumlemF 20500 wwlknred 26251 iwrdsplit 29776 fibp1 29790 poimirlem10 32589 poimirlem17 32596 poimirlem23 32602 poimirlem26 32605 poimirlem27 32606 iccpartiltu 39960 iccpartlt 39962 iccpartleu 39966 iccpartrn 39968 iccelpart 39971 iccpartiun 39972 iccpartdisj 39975 pfxlen0 40259 pfxccat1 40273 pfxpfxid 40279 pfxcctswrd 40280 pfxccatin12 40288 pfxccatid 40293 1wlkepvtx 40868 1wlkp1lem7 40888 1wlkp1lem8 40889 spthdep 40940 crctcsh1wlkn0lem6 41018 crctcsh 41027 wwlksnred 41098 wwlksnextproplem1 41115 clwlksfclwwlk1hash 41267 konigsbergiedgw 41416 konigsbergiedgwOLD 41417 konigsberglem1 41422 konigsberglem2 41423 konigsberglem3 41424 |
Copyright terms: Public domain | W3C validator |