Metamath Proof Explorer


Theorem mulidnq

Description: Multiplication identity element for positive fractions. (Contributed by NM, 3-Mar-1996) (Revised by Mario Carneiro, 28-Apr-2013) (New usage is discouraged.)

Ref Expression
Assertion mulidnq ⊢ A ∈ 𝑸 → A ⋅ 𝑸 1 𝑸 = A

Proof

Step Hyp Ref Expression
1 1nq ⊢ 1 𝑸 ∈ 𝑸
2 mulpqnq ⊢ A ∈ 𝑸 ∧ 1 𝑸 ∈ 𝑸 → A ⋅ 𝑸 1 𝑸 = / 𝑸 ⁡ A ⋅ 𝑝𝑸 1 𝑸
3 1 2 mpan2 ⊢ A ∈ 𝑸 → A ⋅ 𝑸 1 𝑸 = / 𝑸 ⁡ A ⋅ 𝑝𝑸 1 𝑸
4 relxp ⊢ Rel ⁡ 𝑵 × 𝑵
5 elpqn ⊢ A ∈ 𝑸 → A ∈ 𝑵 × 𝑵
6 1st2nd ⊢ Rel ⁡ 𝑵 × 𝑵 ∧ A ∈ 𝑵 × 𝑵 → A = 1 st ⁡ A 2 nd ⁡ A
7 4 5 6 sylancr ⊢ A ∈ 𝑸 → A = 1 st ⁡ A 2 nd ⁡ A
8 df-1nq ⊢ 1 𝑸 = 1 𝑜 1 𝑜
9 8 a1i ⊢ A ∈ 𝑸 → 1 𝑸 = 1 𝑜 1 𝑜
10 7 9 oveq12d ⊢ A ∈ 𝑸 → A ⋅ 𝑝𝑸 1 𝑸 = 1 st ⁡ A 2 nd ⁡ A ⋅ 𝑝𝑸 1 𝑜 1 𝑜
11 xp1st ⊢ A ∈ 𝑵 × 𝑵 → 1 st ⁡ A ∈ 𝑵
12 5 11 syl ⊢ A ∈ 𝑸 → 1 st ⁡ A ∈ 𝑵
13 xp2nd ⊢ A ∈ 𝑵 × 𝑵 → 2 nd ⁡ A ∈ 𝑵
14 5 13 syl ⊢ A ∈ 𝑸 → 2 nd ⁡ A ∈ 𝑵
15 1pi ⊢ 1 𝑜 ∈ 𝑵
16 15 a1i ⊢ A ∈ 𝑸 → 1 𝑜 ∈ 𝑵
17 mulpipq ⊢ 1 st ⁡ A ∈ 𝑵 ∧ 2 nd ⁡ A ∈ 𝑵 ∧ 1 𝑜 ∈ 𝑵 ∧ 1 𝑜 ∈ 𝑵 → 1 st ⁡ A 2 nd ⁡ A ⋅ 𝑝𝑸 1 𝑜 1 𝑜 = 1 st ⁡ A ⋅ 𝑵 1 𝑜 2 nd ⁡ A ⋅ 𝑵 1 𝑜
18 12 14 16 16 17 syl22anc ⊢ A ∈ 𝑸 → 1 st ⁡ A 2 nd ⁡ A ⋅ 𝑝𝑸 1 𝑜 1 𝑜 = 1 st ⁡ A ⋅ 𝑵 1 𝑜 2 nd ⁡ A ⋅ 𝑵 1 𝑜
19 mulidpi ⊢ 1 st ⁡ A ∈ 𝑵 → 1 st ⁡ A ⋅ 𝑵 1 𝑜 = 1 st ⁡ A
20 11 19 syl ⊢ A ∈ 𝑵 × 𝑵 → 1 st ⁡ A ⋅ 𝑵 1 𝑜 = 1 st ⁡ A
21 mulidpi ⊢ 2 nd ⁡ A ∈ 𝑵 → 2 nd ⁡ A ⋅ 𝑵 1 𝑜 = 2 nd ⁡ A
22 13 21 syl ⊢ A ∈ 𝑵 × 𝑵 → 2 nd ⁡ A ⋅ 𝑵 1 𝑜 = 2 nd ⁡ A
23 20 22 opeq12d ⊢ A ∈ 𝑵 × 𝑵 → 1 st ⁡ A ⋅ 𝑵 1 𝑜 2 nd ⁡ A ⋅ 𝑵 1 𝑜 = 1 st ⁡ A 2 nd ⁡ A
24 5 23 syl ⊢ A ∈ 𝑸 → 1 st ⁡ A ⋅ 𝑵 1 𝑜 2 nd ⁡ A ⋅ 𝑵 1 𝑜 = 1 st ⁡ A 2 nd ⁡ A
25 10 18 24 3eqtrd ⊢ A ∈ 𝑸 → A ⋅ 𝑝𝑸 1 𝑸 = 1 st ⁡ A 2 nd ⁡ A
26 25 7 eqtr4d ⊢ A ∈ 𝑸 → A ⋅ 𝑝𝑸 1 𝑸 = A
27 26 fveq2d ⊢ A ∈ 𝑸 → / 𝑸 ⁡ A ⋅ 𝑝𝑸 1 𝑸 = / 𝑸 ⁡ A
28 nqerid ⊢ A ∈ 𝑸 → / 𝑸 ⁡ A = A
29 3 27 28 3eqtrd ⊢ A ∈ 𝑸 → A ⋅ 𝑸 1 𝑸 = A