Theorem nna0r 8601

Description: Addition to zero. Remark in proof of Theorem 4K(2) of [Enderton] p. 81. Note: In this and later theorems, we deliberately avoid the more general ordinal versions of these theorems (in this case oa0r 8529) so that we can avoid ax-rep 5236, which is not needed for finite recursive definitions. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 14-Nov-2014.)

Assertion

Ref	Expression
nna0r	⊢ (𝐴 ∈ ω → (∅ +o 𝐴) = 𝐴)

Proof of Theorem nna0r

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

Step	Hyp	Ref	Expression
1		oveq2 7425	. . 3 ⊢ (𝑥 = ∅ → (∅ +o 𝑥) = (∅ +o ∅))
2		id 23	. . 3 ⊢ (𝑥 = ∅ → 𝑥 = ∅)
3	1, 2	eqeq12d 2778	. 2 ⊢ (𝑥 = ∅ → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o ∅) = ∅))
4		oveq2 7425	. . 3 ⊢ (𝑥 = 𝑦 → (∅ +o 𝑥) = (∅ +o 𝑦))
5		id 23	. . 3 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
6	4, 5	eqeq12d 2778	. 2 ⊢ (𝑥 = 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝑦) = 𝑦))
7		oveq2 7425	. . 3 ⊢ (𝑥 = suc 𝑦 → (∅ +o 𝑥) = (∅ +o suc 𝑦))
8		id 23	. . 3 ⊢ (𝑥 = suc 𝑦 → 𝑥 = suc 𝑦)
9	7, 8	eqeq12d 2778	. 2 ⊢ (𝑥 = suc 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o suc 𝑦) = suc 𝑦))
10		oveq2 7425	. . 3 ⊢ (𝑥 = 𝐴 → (∅ +o 𝑥) = (∅ +o 𝐴))
11		id 23	. . 3 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
12	10, 11	eqeq12d 2778	. 2 ⊢ (𝑥 = 𝐴 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝐴) = 𝐴))
13		0elon 6417	. . 3 ⊢ ∅ ∈ On
14		oa0 8507	. . 3 ⊢ (∅ ∈ On → (∅ +o ∅) = ∅)
15	13, 14	ax-mp 5	. 2 ⊢ (∅ +o ∅) = ∅
16		peano1 7889	. . . 4 ⊢ ∅ ∈ ω
17		nnasuc 8598	. . . 4 ⊢ ((∅ ∈ ω ∧ 𝑦 ∈ ω) → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
18	16, 17	mpan 703	. . 3 ⊢ (𝑦 ∈ ω → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
19		suceq 6430	. . . 4 ⊢ ((∅ +o 𝑦) = 𝑦 → suc (∅ +o 𝑦) = suc 𝑦)
20	19	eqeq2d 2773	. . 3 ⊢ ((∅ +o 𝑦) = 𝑦 → ((∅ +o suc 𝑦) = suc (∅ +o 𝑦) ↔ (∅ +o suc 𝑦) = suc 𝑦))
21	18, 20	syl5ibcom 248	. 2 ⊢ (𝑦 ∈ ω → ((∅ +o 𝑦) = 𝑦 → (∅ +o suc 𝑦) = suc 𝑦))
22	3, 6, 9, 12, 15, 21	finds 7897	1 ⊢ (𝐴 ∈ ω → (∅ +o 𝐴) = 𝐴)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ∅c0 4282  Oncon0 6361  suc csuc 6363  (class class class)co 7417  ωcom 7866   +_o coa 8456

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-oadd 8463

This theorem is used by:  nnacom  8609  nnm1  8644  dflim5  44178  tfsconcat0b  44195