Theorem nnaddcld 9361

Description: Closure of addition of positive integers. (Contributed by Mario Carneiro, 27-May-2016.)

Hypotheses

Ref	Expression
nnge1d.1	|- ( ph -> A e. NN )
nnmulcld.2	|- ( ph -> B e. NN )

Assertion

Ref	Expression
nnaddcld	|- ( ph -> ( A + B ) e. NN )

Proof of Theorem nnaddcld

Step	Hyp	Ref	Expression
1		nnge1d.1	. 2 |- ( ph -> A e. NN )
2		nnmulcld.2	. 2 |- ( ph -> B e. NN )
3		nnaddcl 9333	. 2 |- ( ( A e. NN /\ B e. NN ) -> ( A + B ) e. NN )
4	1, 2, 3	syl2anc 415	1 |- ( ph -> ( A + B ) e. NN )

This proof depends on syntax axioms:   -> wi 4   e. wcel 2209  (class class class)co 6088   + caddc 8188   NNcn 9313

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-sep 4251  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-addrcl 8282  ax-addass 8287

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-iota 5340  df-fv 5388  df-ov 6091  df-inn 9314

This theorem is used by:  pythagtriplem4  13076  pythagtriplem6  13078  pythagtriplem7  13079  pythagtriplem11  13082  pythagtriplem12  13083  pythagtriplem13  13084  pythagtriplem14  13085  pythagtriplem15  13086  pythagtriplem16  13087  ballotfilem5  13300  mulgnndir  14013  perfectlem2  16300  lgseisenlem2  16395