![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nn0addcl | Structured version Visualization version GIF version |
Description: Closure of addition of nonnegative integers. (Contributed by Raph Levien, 10-Dec-2002.) (Proof shortened by Mario Carneiro, 17-Jul-2014.) |
Ref | Expression |
---|---|
nn0addcl | ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀 + 𝑁) ∈ ℕ0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnsscn 11063 | . 2 ⊢ ℕ ⊆ ℂ | |
2 | id 22 | . . 3 ⊢ (ℕ ⊆ ℂ → ℕ ⊆ ℂ) | |
3 | df-n0 11331 | . . 3 ⊢ ℕ0 = (ℕ ∪ {0}) | |
4 | nnaddcl 11080 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℕ) | |
5 | 4 | adantl 481 | . . 3 ⊢ ((ℕ ⊆ ℂ ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ)) → (𝑀 + 𝑁) ∈ ℕ) |
6 | 2, 3, 5 | un0addcl 11364 | . 2 ⊢ ((ℕ ⊆ ℂ ∧ (𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)) → (𝑀 + 𝑁) ∈ ℕ0) |
7 | 1, 6 | mpan 706 | 1 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀 + 𝑁) ∈ ℕ0) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∈ wcel 2030 ⊆ wss 3607 (class class class)co 6690 ℂcc 9972 + caddc 9977 ℕcn 11058 ℕ0cn0 11330 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-resscn 10031 ax-1cn 10032 ax-icn 10033 ax-addcl 10034 ax-addrcl 10035 ax-mulcl 10036 ax-mulrcl 10037 ax-mulcom 10038 ax-addass 10039 ax-mulass 10040 ax-distr 10041 ax-i2m1 10042 ax-1ne0 10043 ax-1rid 10044 ax-rnegex 10045 ax-rrecex 10046 ax-cnre 10047 ax-pre-lttri 10048 ax-pre-lttrn 10049 ax-pre-ltadd 10050 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-rex 2947 df-reu 2948 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-ov 6693 df-om 7108 df-wrecs 7452 df-recs 7513 df-rdg 7551 df-er 7787 df-en 7998 df-dom 7999 df-sdom 8000 df-pnf 10114 df-mnf 10115 df-ltxr 10117 df-nn 11059 df-n0 11331 |
This theorem is referenced by: nn0addcli 11368 peano2nn0 11371 nn0addcld 11393 nn0readdcl 11395 xnn0xaddcl 12104 difelfznle 12492 elfzodifsumelfzo 12573 modsumfzodifsn 12783 expadd 12942 faclbnd4lem3 13122 faclbnd5 13125 faclbnd6 13126 facavg 13128 ccatlen 13393 ccatalpha 13411 swrdswrdlem 13505 swrdswrd 13506 swrdccatin1 13529 swrdccatin12lem3 13536 swrdccatid 13543 splfv2a 13553 repswswrd 13577 repswccat 13578 cshwcsh2id 13620 fsumnn0cl 14511 bcxmas 14611 nn0risefaccl 14797 eftlub 14883 4sqlem1 15699 psgnunilem2 17961 sylow1lem1 18059 psrbagaddcl 19418 nn0subm 19849 expmhm 19863 dvnadd 23737 ply1divex 23941 coemullem 24051 coemulhi 24055 plymul0or 24081 chtublem 24981 2sqlem7 25194 crctcshwlkn0lem4 26761 clwwlkccatlem 27331 fmtnofac2lem 41805 ply1mulgsumlem1 42499 |
Copyright terms: Public domain | W3C validator |