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

Theorem omsuc 8455
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 8357 . . 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 7757 . . 3 (𝐵 ∈ On → suc 𝐵 ∈ On)
4 omv 8441 . . 3 ((𝐴 ∈ On ∧ suc 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵))
53, 4sylan2 594 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o suc 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘suc 𝐵))
6 ovex 7393 . . . 4 (𝐴 ·o 𝐵) ∈ V
7 oveq1 7367 . . . . 5 (𝑥 = (𝐴 ·o 𝐵) → (𝑥 +o 𝐴) = ((𝐴 ·o 𝐵) +o 𝐴))
8 eqid 2737 . . . . 5 (𝑥 ∈ V ↦ (𝑥 +o 𝐴)) = (𝑥 ∈ V ↦ (𝑥 +o 𝐴))
9 ovex 7393 . . . . 5 ((𝐴 ·o 𝐵) +o 𝐴) ∈ V
107, 8, 9fvmpt 6942 . . . 4 ((𝐴 ·o 𝐵) ∈ V → ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝐴 ·o 𝐵) +o 𝐴))
116, 10ax-mp 5 . . 3 ((𝑥 ∈ V ↦ (𝑥 +o 𝐴))‘(𝐴 ·o 𝐵)) = ((𝐴 ·o 𝐵) +o 𝐴)
12 omv 8441 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) = (rec((𝑥 ∈ V ↦ (𝑥 +o 𝐴)), ∅)‘𝐵))
1312fveq2d 6839 . . 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 3441  c0 4286  cmpt 5180  Oncon0 6318  suc csuc 6320  cfv 6493  (class class class)co 7360  reccrdg 8342   +o coa 8396   ·o comu 8397
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 5225  ax-sep 5242  ax-nul 5252  ax-pr 5378  ax-un 7682
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 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7363  df-oprab 7364  df-mpo 7365  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-omul 8404
This theorem is referenced by:  omcl  8465  om0r  8468  om1r  8472  omordi  8495  omwordri  8501  omlimcl  8507  odi  8508  omass  8509  oneo  8510  omeulem1  8511  omeulem2  8512  om2  8515  oeoelem  8528  oaabs2  8579  omxpenlem  9010  cantnflt  9585  cantnflem1d  9601  infxpenc  9932  onexomgt  43550  omlimcl2  43551  onexoegt  43553  om0suclim  43585  oaomoencom  43626  omabs2  43641  naddwordnexlem0  43705  naddwordnexlem3  43708
  Copyright terms: Public domain W3C validator