![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nn0nnaddcl | Structured version Visualization version GIF version |
Description: A nonnegative integer plus a positive integer is a positive integer. (Contributed by NM, 22-Dec-2005.) |
Ref | Expression |
---|---|
nn0nnaddcl | ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℕ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nncn 12219 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
2 | nn0cn 12481 | . . . 4 ⊢ (𝑀 ∈ ℕ0 → 𝑀 ∈ ℂ) | |
3 | addcom 11399 | . . . 4 ⊢ ((𝑁 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (𝑁 + 𝑀) = (𝑀 + 𝑁)) | |
4 | 1, 2, 3 | syl2an 596 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ0) → (𝑁 + 𝑀) = (𝑀 + 𝑁)) |
5 | nnnn0addcl 12501 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ0) → (𝑁 + 𝑀) ∈ ℕ) | |
6 | 4, 5 | eqeltrrd 2834 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ0) → (𝑀 + 𝑁) ∈ ℕ) |
7 | 6 | ancoms 459 | 1 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℕ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 (class class class)co 7408 ℂcc 11107 + caddc 11112 ℕcn 12211 ℕ0cn0 12471 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7411 df-om 7855 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-ltxr 11252 df-nn 12212 df-n0 12472 |
This theorem is referenced by: nn0p1nn 12510 nnaddm1cl 12618 numnncl 12686 modfzo0difsn 13907 faclbnd4lem1 14252 vdwlem3 16915 vdwlem5 16917 vdwlem6 16918 vdwlem9 16921 mod2xnegi 17003 tdeglem4 25576 tdeglem4OLD 25577 basellem5 26586 wwlksext2clwwlk 29307 fmtnodvds 46202 |
Copyright terms: Public domain | W3C validator |