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

Theorem onasuc 8465
Description: Addition with successor. Theorem 4I(A2) of [Enderton] p. 79. (Note that this version of oasuc 8461 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 8378 . . . 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 7842 . . . . 5 (𝐵 ∈ ω → suc 𝐵 ∈ ω)
43adantl 481 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → suc 𝐵 ∈ ω)
54fvresd 6862 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
6 fvres 6861 . . . . 5 (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
76adantl 481 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
87fveq2d 6846 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((𝑥 ∈ V ↦ suc 𝑥)‘((rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴) ↾ ω)‘𝐵)) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
92, 5, 83eqtr3d 2780 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
10 nnon 7824 . . . 4 (𝐵 ∈ ω → 𝐵 ∈ On)
11 onsuc 7765 . . . 4 (𝐵 ∈ On → suc 𝐵 ∈ On)
1210, 11syl 17 . . 3 (𝐵 ∈ ω → suc 𝐵 ∈ On)
13 oav 8448 . . 3 ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
1412, 13sylan2 594 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o suc 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘suc 𝐵))
15 ovex 7401 . . . 4 (𝐴 +o 𝐵) ∈ V
16 suceq 6393 . . . . 5 (𝑥 = (𝐴 +o 𝐵) → suc 𝑥 = suc (𝐴 +o 𝐵))
17 eqid 2737 . . . . 5 (𝑥 ∈ V ↦ suc 𝑥) = (𝑥 ∈ V ↦ suc 𝑥)
1815sucex 7761 . . . . 5 suc (𝐴 +o 𝐵) ∈ V
1916, 17, 18fvmpt 6949 . . . 4 ((𝐴 +o 𝐵) ∈ V → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵))
2015, 19ax-mp 5 . . 3 ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = suc (𝐴 +o 𝐵)
21 oav 8448 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
2210, 21sylan2 594 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) = (rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵))
2322fveq2d 6846 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ((𝑥 ∈ V ↦ suc 𝑥)‘(𝐴 +o 𝐵)) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
2420, 23eqtr3id 2786 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → suc (𝐴 +o 𝐵) = ((𝑥 ∈ V ↦ suc 𝑥)‘(rec((𝑥 ∈ V ↦ suc 𝑥), 𝐴)‘𝐵)))
259, 14, 243eqtr4d 2782 1 ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +o suc 𝐵) = suc (𝐴 +o 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3442  cmpt 5181  cres 5634  Oncon0 6325  suc csuc 6327  cfv 6500  (class class class)co 7368  ωcom 7818  reccrdg 8350   +o coa 8404
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-oadd 8411
This theorem is referenced by:  oa1suc  8468  o2p2e4  8478  nnasuc  8544  naddoa  8640  rdgeqoa  37625
  Copyright terms: Public domain W3C validator