Metamath Proof Explorer


Theorem mulpipq2

Description: Multiplication of positive fractions in terms of positive integers. (Contributed by Mario Carneiro, 8-May-2013) (New usage is discouraged.)

Ref Expression
Assertion mulpipq2 ⊢ A ∈ 𝑵 × 𝑵 ∧ B ∈ 𝑵 × 𝑵 → A ⋅ 𝑝𝑸 B = 1 st ⁡ A ⋅ 𝑵 1 st ⁡ B 2 nd ⁡ A ⋅ 𝑵 2 nd ⁡ B

Proof

Step Hyp Ref Expression
1 fveq2 ⊢ x = A → 1 st ⁡ x = 1 st ⁡ A
2 1 oveq1d ⊢ x = A → 1 st ⁡ x ⋅ 𝑵 1 st ⁡ y = 1 st ⁡ A ⋅ 𝑵 1 st ⁡ y
3 fveq2 ⊢ x = A → 2 nd ⁡ x = 2 nd ⁡ A
4 3 oveq1d ⊢ x = A → 2 nd ⁡ x ⋅ 𝑵 2 nd ⁡ y = 2 nd ⁡ A ⋅ 𝑵 2 nd ⁡ y
5 2 4 opeq12d ⊢ x = A → 1 st ⁡ x ⋅ 𝑵 1 st ⁡ y 2 nd ⁡ x ⋅ 𝑵 2 nd ⁡ y = 1 st ⁡ A ⋅ 𝑵 1 st ⁡ y 2 nd ⁡ A ⋅ 𝑵 2 nd ⁡ y
6 fveq2 ⊢ y = B → 1 st ⁡ y = 1 st ⁡ B
7 6 oveq2d ⊢ y = B → 1 st ⁡ A ⋅ 𝑵 1 st ⁡ y = 1 st ⁡ A ⋅ 𝑵 1 st ⁡ B
8 fveq2 ⊢ y = B → 2 nd ⁡ y = 2 nd ⁡ B
9 8 oveq2d ⊢ y = B → 2 nd ⁡ A ⋅ 𝑵 2 nd ⁡ y = 2 nd ⁡ A ⋅ 𝑵 2 nd ⁡ B
10 7 9 opeq12d ⊢ y = B → 1 st ⁡ A ⋅ 𝑵 1 st ⁡ y 2 nd ⁡ A ⋅ 𝑵 2 nd ⁡ y = 1 st ⁡ A ⋅ 𝑵 1 st ⁡ B 2 nd ⁡ A ⋅ 𝑵 2 nd ⁡ B
11 df-mpq ⊢ ⋅ 𝑝𝑸 = x ∈ 𝑵 × 𝑵 , y ∈ 𝑵 × 𝑵 ⟼ 1 st ⁡ x ⋅ 𝑵 1 st ⁡ y 2 nd ⁡ x ⋅ 𝑵 2 nd ⁡ y
12 opex ⊢ 1 st ⁡ A ⋅ 𝑵 1 st ⁡ B 2 nd ⁡ A ⋅ 𝑵 2 nd ⁡ B ∈ V
13 5 10 11 12 ovmpo ⊢ A ∈ 𝑵 × 𝑵 ∧ B ∈ 𝑵 × 𝑵 → A ⋅ 𝑝𝑸 B = 1 st ⁡ A ⋅ 𝑵 1 st ⁡ B 2 nd ⁡ A ⋅ 𝑵 2 nd ⁡ B