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

Theorem omsuc 8456
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 8358 . . 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 7759 . . 3 (𝐵 ∈ On → suc 𝐵 ∈ On)
4 omv 8442 . . 3 ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵))
53, 4sylan2 594 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵))
6 ovex 7395 . . . 4 (𝐴 ·o 𝐵) ∈ V
7 oveq1 7369 . . . . 5 (𝑥 = (𝐴 ·o 𝐵) → (𝑥 +o 𝐴) = ((𝐴 ·o 𝐵) +o 𝐴))
8 eqid 2737 . . . . 5 (𝑥 ∈ V ↦ (𝑥 +o 𝐴)) = (𝑥 ∈ V ↦ (𝑥 +o 𝐴))
9 ovex 7395 . . . . 5 ((𝐴 ·o 𝐵) +o 𝐴) ∈ V
107, 8, 9fvmpt 6943 . . . 4 ((𝐴 ·o 𝐵) ∈ V → ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝐴 ·o 𝐵) +o 𝐴))
116, 10ax-mp 5 . . 3 ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝐴 ·o 𝐵) +o 𝐴)
12 omv 8442 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵))
1312fveq2d 6840 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵)))
1411, 13eqtr3id 2786 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ·o 𝐵) +o 𝐴) = ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵)))
152, 5, 143eqtr4d 2782 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = ((𝐴 ·o 𝐵) +o 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3430  c0 4274  cmpt 5167  Oncon0 6319  suc csuc 6321  cfv 6494  (class class class)co 7362  reccrdg 8343   +o coa 8397   ·o comu 8398
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-rep 5213  ax-sep 5232  ax-nul 5242  ax-pr 5372  ax-un 7684
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 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5521  df-eprel 5526  df-po 5534  df-so 5535  df-fr 5579  df-we 5581  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-pred 6261  df-ord 6322  df-on 6323  df-lim 6324  df-suc 6325  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-ov 7365  df-oprab 7366  df-mpo 7367  df-2nd 7938  df-frecs 8226  df-wrecs 8257  df-recs 8306  df-rdg 8344  df-omul 8405
This theorem is referenced by:  omcl  8466  om0r  8469  om1r  8473  omordi  8496  omwordri  8502  omlimcl  8508  odi  8509  omass  8510  oneo  8511  omeulem1  8512  omeulem2  8513  om2  8516  oeoelem  8529  oaabs2  8580  omxpenlem  9011  cantnflt  9588  cantnflem1d  9604  infxpenc  9935  onexomgt  43691  omlimcl2  43692  onexoegt  43694  om0suclim  43726  oaomoencom  43767  omabs2  43782  naddwordnexlem0  43846  naddwordnexlem3  43849
  Copyright terms: Public domain W3C validator