Theorem nnaddcl 9333

Description: Closure of addition of positive integers, proved by induction on the second addend. (Contributed by NM, 12-Jan-1997.)

Assertion

Ref	Expression
nnaddcl	⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 + 𝐵) ∈ ℕ)

Proof of Theorem nnaddcl

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 6096	. . . . 5 ⊢ (𝑥 = 1 → (𝐴 + 𝑥) = (𝐴 + 1))
2	1	eleq1d 2307	. . . 4 ⊢ (𝑥 = 1 → ((𝐴 + 𝑥) ∈ ℕ ↔ (𝐴 + 1) ∈ ℕ))
3	2	imbi2d 230	. . 3 ⊢ (𝑥 = 1 → ((𝐴 ∈ ℕ → (𝐴 + 𝑥) ∈ ℕ) ↔ (𝐴 ∈ ℕ → (𝐴 + 1) ∈ ℕ)))
4		oveq2 6096	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴 + 𝑥) = (𝐴 + 𝑦))
5	4	eleq1d 2307	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝐴 + 𝑥) ∈ ℕ ↔ (𝐴 + 𝑦) ∈ ℕ))
6	5	imbi2d 230	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐴 ∈ ℕ → (𝐴 + 𝑥) ∈ ℕ) ↔ (𝐴 ∈ ℕ → (𝐴 + 𝑦) ∈ ℕ)))
7		oveq2 6096	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → (𝐴 + 𝑥) = (𝐴 + (𝑦 + 1)))
8	7	eleq1d 2307	. . . 4 ⊢ (𝑥 = (𝑦 + 1) → ((𝐴 + 𝑥) ∈ ℕ ↔ (𝐴 + (𝑦 + 1)) ∈ ℕ))
9	8	imbi2d 230	. . 3 ⊢ (𝑥 = (𝑦 + 1) → ((𝐴 ∈ ℕ → (𝐴 + 𝑥) ∈ ℕ) ↔ (𝐴 ∈ ℕ → (𝐴 + (𝑦 + 1)) ∈ ℕ)))
10		oveq2 6096	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴 + 𝑥) = (𝐴 + 𝐵))
11	10	eleq1d 2307	. . . 4 ⊢ (𝑥 = 𝐵 → ((𝐴 + 𝑥) ∈ ℕ ↔ (𝐴 + 𝐵) ∈ ℕ))
12	11	imbi2d 230	. . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ ℕ → (𝐴 + 𝑥) ∈ ℕ) ↔ (𝐴 ∈ ℕ → (𝐴 + 𝐵) ∈ ℕ)))
13		peano2nn 9325	. . 3 ⊢ (𝐴 ∈ ℕ → (𝐴 + 1) ∈ ℕ)
14		peano2nn 9325	. . . . . 6 ⊢ ((𝐴 + 𝑦) ∈ ℕ → ((𝐴 + 𝑦) + 1) ∈ ℕ)
15		nncn 9321	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ)
16		nncn 9321	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℂ)
17		ax-1cn 8278	. . . . . . . . 9 ⊢ 1 ∈ ℂ
18		addass 8315	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐴 + 𝑦) + 1) = (𝐴 + (𝑦 + 1)))
19	17, 18	mp3an3 1367	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝐴 + 𝑦) + 1) = (𝐴 + (𝑦 + 1)))
20	15, 16, 19	syl2an 289	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑦 ∈ ℕ) → ((𝐴 + 𝑦) + 1) = (𝐴 + (𝑦 + 1)))
21	20	eleq1d 2307	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑦 ∈ ℕ) → (((𝐴 + 𝑦) + 1) ∈ ℕ ↔ (𝐴 + (𝑦 + 1)) ∈ ℕ))
22	14, 21	imbitrid 154	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑦 ∈ ℕ) → ((𝐴 + 𝑦) ∈ ℕ → (𝐴 + (𝑦 + 1)) ∈ ℕ))
23	22	expcom 116	. . . 4 ⊢ (𝑦 ∈ ℕ → (𝐴 ∈ ℕ → ((𝐴 + 𝑦) ∈ ℕ → (𝐴 + (𝑦 + 1)) ∈ ℕ)))
24	23	a2d 26	. . 3 ⊢ (𝑦 ∈ ℕ → ((𝐴 ∈ ℕ → (𝐴 + 𝑦) ∈ ℕ) → (𝐴 ∈ ℕ → (𝐴 + (𝑦 + 1)) ∈ ℕ)))
25	3, 6, 9, 12, 13, 24	nnind 9329	. 2 ⊢ (𝐵 ∈ ℕ → (𝐴 ∈ ℕ → (𝐴 + 𝐵) ∈ ℕ))
26	25	impcom 125	1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 + 𝐵) ∈ ℕ)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  (class class class)co 6088  ℂcc 8183  1c1 8186   + caddc 8188  ℕcn 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:  nnmulcl  9334  nn2ge  9346  nnaddcld  9361  nnnn0addcl  9604  nn0addcl  9609  9p1e10  9790  pythagtriplem4  13076  ballotfilemofi  13277  ballotfilem1  13278  ballotfilemonn  13279  ballotfilem2  13286  ballotfilemfmpn  13292  ballotfilemefi  13295  ballotfilem4  13299  ballotfilemiex  13302  ballotfilemimin  13307  ballotfilemsval  13310  ballotfilemsdom  13313  ballotfilemsel1i  13314  ballotfilemrval  13319  ballotfilemfrceq  13330  ballotfilemfrcn0  13331  ballotfilem1ri  13336  ballotfilemth  13339  mulgnndir  14013