Theorem nnaddcl 8598

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 5714	. . . . 5 ⊢ (𝑥 = 1 → (𝐴 + 𝑥) = (𝐴 + 1))
2	1	eleq1d 2168	. . . 4 ⊢ (𝑥 = 1 → ((𝐴 + 𝑥) ∈ ℕ ↔ (𝐴 + 1) ∈ ℕ))
3	2	imbi2d 229	. . 3 ⊢ (𝑥 = 1 → ((𝐴 ∈ ℕ → (𝐴 + 𝑥) ∈ ℕ) ↔ (𝐴 ∈ ℕ → (𝐴 + 1) ∈ ℕ)))
4		oveq2 5714	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴 + 𝑥) = (𝐴 + 𝑦))
5	4	eleq1d 2168	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝐴 + 𝑥) ∈ ℕ ↔ (𝐴 + 𝑦) ∈ ℕ))
6	5	imbi2d 229	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐴 ∈ ℕ → (𝐴 + 𝑥) ∈ ℕ) ↔ (𝐴 ∈ ℕ → (𝐴 + 𝑦) ∈ ℕ)))
7		oveq2 5714	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → (𝐴 + 𝑥) = (𝐴 + (𝑦 + 1)))
8	7	eleq1d 2168	. . . 4 ⊢ (𝑥 = (𝑦 + 1) → ((𝐴 + 𝑥) ∈ ℕ ↔ (𝐴 + (𝑦 + 1)) ∈ ℕ))
9	8	imbi2d 229	. . 3 ⊢ (𝑥 = (𝑦 + 1) → ((𝐴 ∈ ℕ → (𝐴 + 𝑥) ∈ ℕ) ↔ (𝐴 ∈ ℕ → (𝐴 + (𝑦 + 1)) ∈ ℕ)))
10		oveq2 5714	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴 + 𝑥) = (𝐴 + 𝐵))
11	10	eleq1d 2168	. . . 4 ⊢ (𝑥 = 𝐵 → ((𝐴 + 𝑥) ∈ ℕ ↔ (𝐴 + 𝐵) ∈ ℕ))
12	11	imbi2d 229	. . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ ℕ → (𝐴 + 𝑥) ∈ ℕ) ↔ (𝐴 ∈ ℕ → (𝐴 + 𝐵) ∈ ℕ)))
13		peano2nn 8590	. . 3 ⊢ (𝐴 ∈ ℕ → (𝐴 + 1) ∈ ℕ)
14		peano2nn 8590	. . . . . 6 ⊢ ((𝐴 + 𝑦) ∈ ℕ → ((𝐴 + 𝑦) + 1) ∈ ℕ)
15		nncn 8586	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ)
16		nncn 8586	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℂ)
17		ax-1cn 7588	. . . . . . . . 9 ⊢ 1 ∈ ℂ
18		addass 7622	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐴 + 𝑦) + 1) = (𝐴 + (𝑦 + 1)))
19	17, 18	mp3an3 1272	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝐴 + 𝑦) + 1) = (𝐴 + (𝑦 + 1)))
20	15, 16, 19	syl2an 285	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑦 ∈ ℕ) → ((𝐴 + 𝑦) + 1) = (𝐴 + (𝑦 + 1)))
21	20	eleq1d 2168	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑦 ∈ ℕ) → (((𝐴 + 𝑦) + 1) ∈ ℕ ↔ (𝐴 + (𝑦 + 1)) ∈ ℕ))
22	14, 21	syl5ib 153	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑦 ∈ ℕ) → ((𝐴 + 𝑦) ∈ ℕ → (𝐴 + (𝑦 + 1)) ∈ ℕ))
23	22	expcom 115	. . . 4 ⊢ (𝑦 ∈ ℕ → (𝐴 ∈ ℕ → ((𝐴 + 𝑦) ∈ ℕ → (𝐴 + (𝑦 + 1)) ∈ ℕ)))
24	23	a2d 26	. . 3 ⊢ (𝑦 ∈ ℕ → ((𝐴 ∈ ℕ → (𝐴 + 𝑦) ∈ ℕ) → (𝐴 ∈ ℕ → (𝐴 + (𝑦 + 1)) ∈ ℕ)))
25	3, 6, 9, 12, 13, 24	nnind 8594	. 2 ⊢ (𝐵 ∈ ℕ → (𝐴 ∈ ℕ → (𝐴 + 𝐵) ∈ ℕ))
26	25	impcom 124	1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 + 𝐵) ∈ ℕ)

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1299   ∈ wcel 1448  (class class class)co 5706  ℂcc 7498  1c1 7501   + caddc 7503  ℕcn 8578

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-sep 3986  ax-cnex 7586  ax-resscn 7587  ax-1cn 7588  ax-1re 7589  ax-addrcl 7592  ax-addass 7597

This theorem depends on definitions:  df-bi 116  df-3an 932  df-tru 1302  df-nf 1405  df-sb 1704  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ral 2380  df-rex 2381  df-rab 2384  df-v 2643  df-un 3025  df-in 3027  df-ss 3034  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-int 3719  df-br 3876  df-iota 5024  df-fv 5067  df-ov 5709  df-inn 8579

This theorem is referenced by:  nnmulcl  8599  nn2ge  8611  nnaddcld  8626  nnnn0addcl  8859  nn0addcl  8864  9p1e10  9036