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

Theorem onasuc 8567
Description: Addition with successor. Theorem 4I(A2) of [Enderton] p. 79. (Note that this version of oasuc 8563 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 8478 . . . 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 6925 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
6 fvres 6924 . . . . 5 (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
76adantl 481 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
87fveq2d 6909 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((𝑥 ∈ V ↦ suc 𝑥)‘((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵)) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
92, 5, 83eqtr3d 2784 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
10 nnon 7894 . . . 4 (𝐵 ∈ ω → 𝐵 ∈ On)
11 onsuc 7832 . . . 4 (𝐵 ∈ On → suc 𝐵 ∈ On)
1210, 11syl 17 . . 3 (𝐵 ∈ ω → suc 𝐵 ∈ On)
13 oav 8550 . . 3 ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
1412, 13sylan2 593 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
15 ovex 7465 . . . 4 (𝐴 +o 𝐵) ∈ V
16 suceq 6449 . . . . 5 (𝑥 = (𝐴 +o 𝐵) → suc 𝑥 = suc (𝐴 +o 𝐵))
17 eqid 2736 . . . . 5 (𝑥 ∈ V ↦ suc 𝑥) = (𝑥 ∈ V ↦ suc 𝑥)
1815sucex 7827 . . . . 5 suc (𝐴 +o 𝐵) ∈ V
1916, 17, 18fvmpt 7015 . . . 4 ((𝐴 +o 𝐵) ∈ V → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵))
2015, 19ax-mp 5 . . 3 ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵)
21 oav 8550 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
2210, 21sylan2 593 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
2322fveq2d 6909 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
2420, 23eqtr3id 2790 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → suc (𝐴 +o 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
259, 14, 243eqtr4d 2786 1 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  Vcvv 3479  cmpt 5224  cres 5686  Oncon0 6383  suc csuc 6385  cfv 6560  (class class class)co 7432  ωcom 7888  reccrdg 8450   +o coa 8504
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pr 5431  ax-un 7756
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-oadd 8511
This theorem is referenced by:  oa1suc  8570  o2p2e4  8580  nnasuc  8645  naddoa  8741  rdgeqoa  37372
  Copyright terms: Public domain W3C validator