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

Theorem mulpiord 9745
Description: Positive integer multiplication in terms of ordinal multiplication. (Contributed by NM, 27-Aug-1995.) (New usage is discouraged.)
Assertion
Ref Expression
mulpiord ((𝐴N𝐵N) → (𝐴 ·N 𝐵) = (𝐴 ·𝑜 𝐵))

Proof of Theorem mulpiord
StepHypRef Expression
1 opelxpi 5182 . 2 ((𝐴N𝐵N) → ⟨𝐴, 𝐵⟩ ∈ (N × N))
2 fvres 6245 . . 3 (⟨𝐴, 𝐵⟩ ∈ (N × N) → (( ·𝑜 ↾ (N × N))‘⟨𝐴, 𝐵⟩) = ( ·𝑜 ‘⟨𝐴, 𝐵⟩))
3 df-ov 6693 . . . 4 (𝐴 ·N 𝐵) = ( ·N ‘⟨𝐴, 𝐵⟩)
4 df-mi 9734 . . . . 5 ·N = ( ·𝑜 ↾ (N × N))
54fveq1i 6230 . . . 4 ( ·N ‘⟨𝐴, 𝐵⟩) = (( ·𝑜 ↾ (N × N))‘⟨𝐴, 𝐵⟩)
63, 5eqtri 2673 . . 3 (𝐴 ·N 𝐵) = (( ·𝑜 ↾ (N × N))‘⟨𝐴, 𝐵⟩)
7 df-ov 6693 . . 3 (𝐴 ·𝑜 𝐵) = ( ·𝑜 ‘⟨𝐴, 𝐵⟩)
82, 6, 73eqtr4g 2710 . 2 (⟨𝐴, 𝐵⟩ ∈ (N × N) → (𝐴 ·N 𝐵) = (𝐴 ·𝑜 𝐵))
91, 8syl 17 1 ((𝐴N𝐵N) → (𝐴 ·N 𝐵) = (𝐴 ·𝑜 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1523  wcel 2030  cop 4216   × cxp 5141  cres 5145  cfv 5926  (class class class)co 6690   ·𝑜 comu 7603  Ncnpi 9704   ·N cmi 9706
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-xp 5149  df-res 5155  df-iota 5889  df-fv 5934  df-ov 6693  df-mi 9734
This theorem is referenced by:  mulidpi  9746  mulclpi  9753  mulcompi  9756  mulasspi  9757  distrpi  9758  mulcanpi  9760  ltmpi  9764
  Copyright terms: Public domain W3C validator