Theorem nna0r 8583

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 8511) 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 7408	. . 3 ⊢ (𝑥 = ∅ → (∅ +o 𝑥) = (∅ +o ∅))
2		id 23	. . 3 ⊢ (𝑥 = ∅ → 𝑥 = ∅)
3	1, 2	eqeq12d 2781	. 2 ⊢ (𝑥 = ∅ → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o ∅) = ∅))
4		oveq2 7408	. . 3 ⊢ (𝑥 = 𝑦 → (∅ +o 𝑥) = (∅ +o 𝑦))
5		id 23	. . 3 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
6	4, 5	eqeq12d 2781	. 2 ⊢ (𝑥 = 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝑦) = 𝑦))
7		oveq2 7408	. . 3 ⊢ (𝑥 = suc 𝑦 → (∅ +o 𝑥) = (∅ +o suc 𝑦))
8		id 23	. . 3 ⊢ (𝑥 = suc 𝑦 → 𝑥 = suc 𝑦)
9	7, 8	eqeq12d 2781	. 2 ⊢ (𝑥 = suc 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o suc 𝑦) = suc 𝑦))
10		oveq2 7408	. . 3 ⊢ (𝑥 = 𝐴 → (∅ +o 𝑥) = (∅ +o 𝐴))
11		id 23	. . 3 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
12	10, 11	eqeq12d 2781	. 2 ⊢ (𝑥 = 𝐴 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝐴) = 𝐴))
13		0elon 6405	. . 3 ⊢ ∅ ∈ On
14		oa0 8489	. . 3 ⊢ (∅ ∈ On → (∅ +o ∅) = ∅)
15	13, 14	ax-mp 5	. 2 ⊢ (∅ +o ∅) = ∅
16		peano1 7873	. . . 4 ⊢ ∅ ∈ ω
17		nnasuc 8580	. . . 4 ⊢ ((∅ ∈ ω ∧ 𝑦 ∈ ω) → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
18	16, 17	mpan 702	. . 3 ⊢ (𝑦 ∈ ω → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
19		suceq 6418	. . . 4 ⊢ ((∅ +o 𝑦) = 𝑦 → suc (∅ +o 𝑦) = suc 𝑦)
20	19	eqeq2d 2776	. . 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 7881	1 ⊢ (𝐴 ∈ ω → (∅ +o 𝐴) = 𝐴)

Syntax hints:   → wi 4   = wceq 1563   ∈ wcel 2145  ∅c0 4288  Oncon0 6350  suc csuc 6352  (class class class)co 7400  ωcom 7850   +_o coa 8438

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-oadd 8445

This theorem is referenced by:  nnacom  8591  nnm1  8626  dflim5  43918  tfsconcat0b  43935