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

Theorem onasuc 8492
Description: Addition with successor. Theorem 4I(A2) of [Enderton] p. 79. (Note that this version of oasuc 8488 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 8405 . . . 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 7866 . . . . 5 (𝐵 ∈ ω → suc 𝐵 ∈ ω)
43adantl 481 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → suc 𝐵 ∈ ω)
54fvresd 6878 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
6 fvres 6877 . . . . 5 (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
76adantl 481 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
87fveq2d 6862 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((𝑥 ∈ V ↦ suc 𝑥)‘((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵)) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
92, 5, 83eqtr3d 2772 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
10 nnon 7848 . . . 4 (𝐵 ∈ ω → 𝐵 ∈ On)
11 onsuc 7787 . . . 4 (𝐵 ∈ On → suc 𝐵 ∈ On)
1210, 11syl 17 . . 3 (𝐵 ∈ ω → suc 𝐵 ∈ On)
13 oav 8475 . . 3 ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
1412, 13sylan2 593 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
15 ovex 7420 . . . 4 (𝐴 +o 𝐵) ∈ V
16 suceq 6400 . . . . 5 (𝑥 = (𝐴 +o 𝐵) → suc 𝑥 = suc (𝐴 +o 𝐵))
17 eqid 2729 . . . . 5 (𝑥 ∈ V ↦ suc 𝑥) = (𝑥 ∈ V ↦ suc 𝑥)
1815sucex 7782 . . . . 5 suc (𝐴 +o 𝐵) ∈ V
1916, 17, 18fvmpt 6968 . . . 4 ((𝐴 +o 𝐵) ∈ V → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵))
2015, 19ax-mp 5 . . 3 ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵)
21 oav 8475 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
2210, 21sylan2 593 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
2322fveq2d 6862 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
2420, 23eqtr3id 2778 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → suc (𝐴 +o 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
259, 14, 243eqtr4d 2774 1 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  Vcvv 3447  cmpt 5188  cres 5640  Oncon0 6332  suc csuc 6334  cfv 6511  (class class class)co 7387  ωcom 7842  reccrdg 8377   +o coa 8431
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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-oadd 8438
This theorem is referenced by:  oa1suc  8495  o2p2e4  8505  nnasuc  8570  naddoa  8666  rdgeqoa  37358
  Copyright terms: Public domain W3C validator