Theorem mulcompq 10964

Description: Multiplication of positive fractions is commutative. (Contributed by NM, 31-Aug-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
mulcompq	⊢ (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴)

Proof of Theorem mulcompq

Step	Hyp	Ref	Expression
1		mulcompi 10908	. . . 4 ⊢ ((1st ‘𝐴) ·N (1st ‘𝐵)) = ((1st ‘𝐵) ·N (1st ‘𝐴))
2		mulcompi 10908	. . . 4 ⊢ ((2nd ‘𝐴) ·N (2nd ‘𝐵)) = ((2nd ‘𝐵) ·N (2nd ‘𝐴))
3	1, 2	opeq12i 4838	. . 3 ⊢ ⟨((1st ‘𝐴) ·N (1st ‘𝐵)), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩ = ⟨((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))⟩
4		mulpipq2 10951	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = ⟨((1st ‘𝐴) ·N (1st ‘𝐵)), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩)
5		mulpipq2 10951	. . . 4 ⊢ ((𝐵 ∈ (N × N) ∧ 𝐴 ∈ (N × N)) → (𝐵 ·pQ 𝐴) = ⟨((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))⟩)
6	5	ancoms 464	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐵 ·pQ 𝐴) = ⟨((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))⟩)
7	3, 4, 6	3eqtr4a 2821	. 2 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴))
8		mulpqf 10958	. . . 4 ⊢ ·pQ :((N × N) × (N × N))⟶(N × N)
9	8	fdmi 6715	. . 3 ⊢ dom ·pQ = ((N × N) × (N × N))
10	9	ndmovcom 7602	. 2 ⊢ (¬ (𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴))
11	7, 10	pm2.61i 184	1 ⊢ (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴)

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ⟨cop 4590   × cxp 5653  ‘cfv 6533  (class class class)co 7414  1^st c1st 7985  2^nd c2nd 7986  Ncnpi 10856   ·_N cmi 10858   ·_pQ cmpq 10861

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-oadd 8462  df-omul 8463  df-ni 10884  df-mi 10886  df-mpq 10921

This theorem is used by:  mulcomnq  10965  mulerpq  10969