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

Theorem mulpiord 11009
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 𝐵) = (𝐴 ·o 𝐵))

Proof of Theorem mulpiord
StepHypRef Expression
1 opelxpi 5695 . 2 ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ⟨𝐴, 𝐵⟩ ∈ (N × N))
2 fvres 6935 . . 3 (⟨𝐴, 𝐵⟩ ∈ (N × N) → (( ·o ↾ (N × N))‘⟨𝐴, 𝐵⟩) = ( ·o ‘⟨𝐴, 𝐵⟩))
3 df-ov 7454 . . . 4 (𝐴 ·N 𝐵) = ( ·N ‘⟨𝐴, 𝐵⟩)
4 df-mi 10998 . . . . 5 ·N = ( ·o ↾ (N × N))
54fveq1i 6917 . . . 4 ( ·N ‘⟨𝐴, 𝐵⟩) = (( ·o ↾ (N × N))‘⟨𝐴, 𝐵⟩)
63, 5eqtri 2786 . . 3 (𝐴 ·N 𝐵) = (( ·o ↾ (N × N))‘⟨𝐴, 𝐵⟩)
7 df-ov 7454 . . 3 (𝐴 ·o 𝐵) = ( ·o ‘⟨𝐴, 𝐵⟩)
82, 6, 73eqtr4g 2823 . 2 (⟨𝐴, 𝐵⟩ ∈ (N × N) → (𝐴 ·N 𝐵) = (𝐴 ·o 𝐵))
91, 8syl 18 1 ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ·N 𝐵) = (𝐴 ·o 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟨cop 4840   × cxp 5656   ↾ cres 5660  ‘cfv 6566  (class class class)co 7451   ·o comu 8512  Ncnpi 10968   ·N cmi 10970
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-xp 5664  df-res 5670  df-iota 6520  df-fv 6574  df-ov 7454  df-mi 10998
This theorem is used by:  mulidpi  11010  mulclpi  11017  mulcompi  11020  mulasspi  11021  distrpi  11022  mulcanpi  11024  ltmpi  11028
  Copyright terms: Public domain W3C validator