Metamath Proof Explorer


Theorem mulpiord

Description: Positive integer multiplication in terms of ordinal multiplication. (Contributed by NM, 27-Aug-1995) (New usage is discouraged.)

Ref Expression
Assertion mulpiord ⊢ A ∈ 𝑵 ∧ B ∈ 𝑵 → A ⋅ 𝑵 B = A ⋅ 𝑜 B

Proof

Step Hyp Ref Expression
1 opelxpi ⊢ A ∈ 𝑵 ∧ B ∈ 𝑵 → A B ∈ 𝑵 × 𝑵
2 fvres ⊢ A B ∈ 𝑵 × 𝑵 → ⋅ 𝑜 ↾ 𝑵 × 𝑵 ⁡ A B = ⋅ 𝑜 ⁡ A B
3 df-ov ⊢ A ⋅ 𝑵 B = ⋅ 𝑵 ⁡ A B
4 df-mi ⊢ ⋅ 𝑵 = ⋅ 𝑜 ↾ 𝑵 × 𝑵
5 4 fveq1i ⊢ ⋅ 𝑵 ⁡ A B = ⋅ 𝑜 ↾ 𝑵 × 𝑵 ⁡ A B
6 3 5 eqtri ⊢ A ⋅ 𝑵 B = ⋅ 𝑜 ↾ 𝑵 × 𝑵 ⁡ A B
7 df-ov ⊢ A ⋅ 𝑜 B = ⋅ 𝑜 ⁡ A B
8 2 6 7 3eqtr4g ⊢ A B ∈ 𝑵 × 𝑵 → A ⋅ 𝑵 B = A ⋅ 𝑜 B
9 1 8 syl ⊢ A ∈ 𝑵 ∧ B ∈ 𝑵 → A ⋅ 𝑵 B = A ⋅ 𝑜 B