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

Theorem nna0r 8646
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 8575) so that we can avoid ax-rep 5285, 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 2751 . 2 (𝑥 = ∅ → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o ∅) = ∅))
4 oveq2 7439 . . 3 (𝑥 = 𝑦 → (∅ +o 𝑥) = (∅ +o 𝑦))
5 id 22 . . 3 (𝑥 = 𝑦𝑥 = 𝑦)
64, 5eqeq12d 2751 . 2 (𝑥 = 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝑦) = 𝑦))
7 oveq2 7439 . . 3 (𝑥 = suc 𝑦 → (∅ +o 𝑥) = (∅ +o suc 𝑦))
8 id 22 . . 3 (𝑥 = suc 𝑦𝑥 = suc 𝑦)
97, 8eqeq12d 2751 . 2 (𝑥 = suc 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o suc 𝑦) = suc 𝑦))
10 oveq2 7439 . . 3 (𝑥 = 𝐴 → (∅ +o 𝑥) = (∅ +o 𝐴))
11 id 22 . . 3 (𝑥 = 𝐴𝑥 = 𝐴)
1210, 11eqeq12d 2751 . 2 (𝑥 = 𝐴 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝐴) = 𝐴))
13 0elon 6440 . . 3 ∅ ∈ On
14 oa0 8553 . . 3 (∅ ∈ On → (∅ +o ∅) = ∅)
1513, 14ax-mp 5 . 2 (∅ +o ∅) = ∅
16 peano1 7911 . . . 4 ∅ ∈ ω
17 nnasuc 8643 . . . 4 ((∅ ∈ ω ∧ 𝑦 ∈ ω) → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
1816, 17mpan 690 . . 3 (𝑦 ∈ ω → (∅ +o suc 𝑦) = suc (∅ +o 𝑦))
19 suceq 6452 . . . 4 ((∅ +o 𝑦) = 𝑦 → suc (∅ +o 𝑦) = suc 𝑦)
2019eqeq2d 2746 . . 3 ((∅ +o 𝑦) = 𝑦 → ((∅ +o suc 𝑦) = suc (∅ +o 𝑦) ↔ (∅ +o suc 𝑦) = suc 𝑦))
2118, 20syl5ibcom 245 . 2 (𝑦 ∈ ω → ((∅ +o 𝑦) = 𝑦 → (∅ +o suc 𝑦) = suc 𝑦))
223, 6, 9, 12, 15, 21finds 7919 1 (𝐴 ∈ ω → (∅ +o 𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2106  c0 4339  Oncon0 6386  suc csuc 6388  (class class class)co 7431  ωcom 7887   +o coa 8502
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-oadd 8509
This theorem is referenced by:  nnacom  8654  nnm1  8689  dflim5  43319  tfsconcat0b  43336
  Copyright terms: Public domain W3C validator