Theorem nna0r 8602

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 8530) so that we can avoid ax-rep 5232, 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 7420	. . 3 ⊢ (𝑥 = ∅ → (∅ +o 𝑥) = (∅ +o ∅))
2		id 23	. . 3 ⊢ (𝑥 = ∅ → 𝑥 = ∅)
3	1, 2	eqeq12d 2777	. 2 ⊢ (𝑥 = ∅ → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o ∅) = ∅))
4		oveq2 7420	. . 3 ⊢ (𝑥 = 𝑦 → (∅ +o 𝑥) = (∅ +o 𝑦))
5		id 23	. . 3 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
6	4, 5	eqeq12d 2777	. 2 ⊢ (𝑥 = 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝑦) = 𝑦))
7		oveq2 7420	. . 3 ⊢ (𝑥 = suc 𝑦 → (∅ +o 𝑥) = (∅ +o suc 𝑦))
8		id 23	. . 3 ⊢ (𝑥 = suc 𝑦 → 𝑥 = suc 𝑦)
9	7, 8	eqeq12d 2777	. 2 ⊢ (𝑥 = suc 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o suc 𝑦) = suc 𝑦))
10		oveq2 7420	. . 3 ⊢ (𝑥 = 𝐴 → (∅ +o 𝑥) = (∅ +o 𝐴))
11		id 23	. . 3 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
12	10, 11	eqeq12d 2777	. 2 ⊢ (𝑥 = 𝐴 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝐴) = 𝐴))
13		0elon 6411	. . 3 ⊢ ∅ ∈ On
14		oa0 8508	. . 3 ⊢ (∅ ∈ On → (∅ +o ∅) = ∅)
15	13, 14	ax-mp 5	. 2 ⊢ (∅ +o ∅) = ∅
16		peano1 7889	. . . 4 ⊢ ∅ ∈ ω
17		nnasuc 8599	. . . 4 ⊢ ((∅ ∈ ω ∧ 𝑦 ∈ ω) → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
18	16, 17	mpan 703	. . 3 ⊢ (𝑦 ∈ ω → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
19		suceq 6424	. . . 4 ⊢ ((∅ +o 𝑦) = 𝑦 → suc (∅ +o 𝑦) = suc 𝑦)
20	19	eqeq2d 2772	. . 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 4279  Oncon0 6355  suc csuc 6357  (class class class)co 7412  ωcom 7866   +_o coa 8457

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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-oadd 8464

This theorem is used by:  nnacom  8610  nnm1  8645  dflim5  44289  tfsconcat0b  44306