MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nna0r Structured version   Visualization version   GIF version

Theorem nna0r 8647
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 8576) so that we can avoid ax-rep 5279, 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.
StepHypRef Expression
1 oveq2 7439 . . 3 (𝑥 = ∅ → (∅ +o 𝑥) = (∅ +o ∅))
2 id 22 . . 3 (𝑥 = ∅ → 𝑥 = ∅)
31, 2eqeq12d 2753 . 2 (𝑥 = ∅ → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o ∅) = ∅))
4 oveq2 7439 . . 3 (𝑥 = 𝑦 → (∅ +o 𝑥) = (∅ +o 𝑦))
5 id 22 . . 3 (𝑥 = 𝑦𝑥 = 𝑦)
64, 5eqeq12d 2753 . 2 (𝑥 = 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝑦) = 𝑦))
7 oveq2 7439 . . 3 (𝑥 = suc 𝑦 → (∅ +o 𝑥) = (∅ +o suc 𝑦))
8 id 22 . . 3 (𝑥 = suc 𝑦𝑥 = suc 𝑦)
97, 8eqeq12d 2753 . 2 (𝑥 = suc 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o suc 𝑦) = suc 𝑦))
10 oveq2 7439 . . 3 (𝑥 = 𝐴 → (∅ +o 𝑥) = (∅ +o 𝐴))
11 id 22 . . 3 (𝑥 = 𝐴𝑥 = 𝐴)
1210, 11eqeq12d 2753 . 2 (𝑥 = 𝐴 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝐴) = 𝐴))
13 0elon 6438 . . 3 ∅ ∈ On
14 oa0 8554 . . 3 (∅ ∈ On → (∅ +o ∅) = ∅)
1513, 14ax-mp 5 . 2 (∅ +o ∅) = ∅
16 peano1 7910 . . . 4 ∅ ∈ ω
17 nnasuc 8644 . . . 4 ((∅ ∈ ω ∧ 𝑦 ∈ ω) → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
1816, 17mpan 690 . . 3 (𝑦 ∈ ω → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
19 suceq 6450 . . . 4 ((∅ +o 𝑦) = 𝑦 → suc (∅ +o 𝑦) = suc 𝑦)
2019eqeq2d 2748 . . 3 ((∅ +o 𝑦) = 𝑦 → ((∅ +o suc 𝑦) = suc (∅ +o 𝑦) ↔ (∅ +o suc 𝑦) = suc 𝑦))
2118, 20syl5ibcom 245 . 2 (𝑦 ∈ ω → ((∅ +o 𝑦) = 𝑦 → (∅ +o suc 𝑦) = suc 𝑦))
223, 6, 9, 12, 15, 21finds 7918 1 (𝐴 ∈ ω → (∅ +o 𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2108  c0 4333  Oncon0 6384  suc csuc 6386  (class class class)co 7431  ωcom 7887   +o coa 8503
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-oadd 8510
This theorem is referenced by:  nnacom  8655  nnm1  8690  dflim5  43342  tfsconcat0b  43359
  Copyright terms: Public domain W3C validator