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

Theorem onasuc 8565
Description: Addition with successor. Theorem 4I(A2) of [Enderton] p. 79. (Note that this version of oasuc 8561 does not need Replacement.) (Contributed by Mario Carneiro, 16-Nov-2014.)
Assertion
Ref Expression
onasuc ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵))

Proof of Theorem onasuc
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 frsuc 8476 . . . 4 (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘suc 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵)))
21adantl 481 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘suc 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵)))
3 peano2 7913 . . . . 5 (𝐵 ∈ ω → suc 𝐵 ∈ ω)
43adantl 481 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → suc 𝐵 ∈ ω)
54fvresd 6927 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
6 fvres 6926 . . . . 5 (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
76adantl 481 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
87fveq2d 6911 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((𝑥 ∈ V ↦ suc 𝑥)‘((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵)) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
92, 5, 83eqtr3d 2783 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
10 nnon 7893 . . . 4 (𝐵 ∈ ω → 𝐵 ∈ On)
11 onsuc 7831 . . . 4 (𝐵 ∈ On → suc 𝐵 ∈ On)
1210, 11syl 17 . . 3 (𝐵 ∈ ω → suc 𝐵 ∈ On)
13 oav 8548 . . 3 ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
1412, 13sylan2 593 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
15 ovex 7464 . . . 4 (𝐴 +o 𝐵) ∈ V
16 suceq 6452 . . . . 5 (𝑥 = (𝐴 +o 𝐵) → suc 𝑥 = suc (𝐴 +o 𝐵))
17 eqid 2735 . . . . 5 (𝑥 ∈ V ↦ suc 𝑥) = (𝑥 ∈ V ↦ suc 𝑥)
1815sucex 7826 . . . . 5 suc (𝐴 +o 𝐵) ∈ V
1916, 17, 18fvmpt 7016 . . . 4 ((𝐴 +o 𝐵) ∈ V → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵))
2015, 19ax-mp 5 . . 3 ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵)
21 oav 8548 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
2210, 21sylan2 593 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
2322fveq2d 6911 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
2420, 23eqtr3id 2789 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → suc (𝐴 +o 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
259, 14, 243eqtr4d 2785 1 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  Vcvv 3478  cmpt 5231  cres 5691  Oncon0 6386  suc csuc 6388  cfv 6563  (class class class)co 7431  ωcom 7887  reccrdg 8448   +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:  oa1suc  8568  o2p2e4  8578  nnasuc  8643  naddoa  8739  rdgeqoa  37353
  Copyright terms: Public domain W3C validator