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

Theorem omsuc 8451
Description: Multiplication with successor. Definition 8.15 of [TakeutiZaring] p. 62. Definition 2.5 of [Schloeder] p. 4. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
omsuc ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = ((𝐴 ·o 𝐵) +o 𝐴))

Proof of Theorem omsuc
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 rdgsuc 8353 . . 3 (𝐵 ∈ On → (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵)))
21adantl 481 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵)))
3 onsuc 7753 . . 3 (𝐵 ∈ On → suc 𝐵 ∈ On)
4 omv 8437 . . 3 ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵))
53, 4sylan2 593 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵))
6 ovex 7389 . . . 4 (𝐴 ·o 𝐵) ∈ V
7 oveq1 7363 . . . . 5 (𝑥 = (𝐴 ·o 𝐵) → (𝑥 +o 𝐴) = ((𝐴 ·o 𝐵) +o 𝐴))
8 eqid 2734 . . . . 5 (𝑥 ∈ V ↦ (𝑥 +o 𝐴)) = (𝑥 ∈ V ↦ (𝑥 +o 𝐴))
9 ovex 7389 . . . . 5 ((𝐴 ·o 𝐵) +o 𝐴) ∈ V
107, 8, 9fvmpt 6939 . . . 4 ((𝐴 ·o 𝐵) ∈ V → ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝐴 ·o 𝐵) +o 𝐴))
116, 10ax-mp 5 . . 3 ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝐴 ·o 𝐵) +o 𝐴)
12 omv 8437 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵))
1312fveq2d 6836 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵)))
1411, 13eqtr3id 2783 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ·o 𝐵) +o 𝐴) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵)))
152, 5, 143eqtr4d 2779 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = ((𝐴 ·o 𝐵) +o 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  Vcvv 3438  c0 4283  cmpt 5177  Oncon0 6315  suc csuc 6317  cfv 6490  (class class class)co 7356  reccrdg 8338   +o coa 8392   ·o comu 8393
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-omul 8400
This theorem is referenced by:  omcl  8461  om0r  8464  om1r  8468  omordi  8491  omwordri  8497  omlimcl  8503  odi  8504  omass  8505  oneo  8506  omeulem1  8507  omeulem2  8508  om2  8511  oeoelem  8524  oaabs2  8575  omxpenlem  9004  cantnflt  9579  cantnflem1d  9595  infxpenc  9926  onexomgt  43425  omlimcl2  43426  onexoegt  43428  om0suclim  43460  oaomoencom  43501  omabs2  43516  naddwordnexlem0  43580  naddwordnexlem3  43583
  Copyright terms: Public domain W3C validator