Theorem mulcompq 10900

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 10844	. . . 4 ⊢ ((1st ‘𝐴) ·N (1st ‘𝐵)) = ((1st ‘𝐵) ·N (1st ‘𝐴))
2		mulcompi 10844	. . . 4 ⊢ ((2nd ‘𝐴) ·N (2nd ‘𝐵)) = ((2nd ‘𝐵) ·N (2nd ‘𝐴))
3	1, 2	opeq12i 4830	. . 3 ⊢ ⟨((1st ‘𝐴) ·N (1st ‘𝐵)), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩ = ⟨((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))⟩
4		mulpipq2 10887	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = ⟨((1st ‘𝐴) ·N (1st ‘𝐵)), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩)
5		mulpipq2 10887	. . . 4 ⊢ ((𝐵 ∈ (N × N) ∧ 𝐴 ∈ (N × N)) → (𝐵 ·pQ 𝐴) = ⟨((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))⟩)
6	5	ancoms 461	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐵 ·pQ 𝐴) = ⟨((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))⟩)
7	3, 4, 6	3eqtr4a 2817	. 2 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴))
8		mulpqf 10894	. . . 4 ⊢ ·pQ :((N × N) × (N × N))⟶(N × N)
9	8	fdmi 6692	. . 3 ⊢ dom ·pQ = ((N × N) × (N × N))
10	9	ndmovcom 7572	. 2 ⊢ (¬ (𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴))
11	7, 10	pm2.61i 183	1 ⊢ (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴)

Syntax hints:   ∧ wa 398   = wceq 1554   ∈ wcel 2136  ⟨cop 4582   × cxp 5638  ‘cfv 6510  (class class class)co 7385  1^st c1st 7957  2^nd c2nd 7958  Ncnpi 10792   ·_N cmi 10794   ·_pQ cmpq 10797

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-sep 5240  ax-nul 5250  ax-pr 5384  ax-un 7707

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ne 2952  df-ral 3071  df-rex 3081  df-reu 3362  df-rab 3409  df-v 3450  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4945  df-br 5095  df-opab 5157  df-mpt 5176  df-tr 5202  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6466  df-fun 6512  df-fn 6513  df-f 6514  df-f1 6515  df-fo 6516  df-f1o 6517  df-fv 6518  df-ov 7388  df-oprab 7389  df-mpo 7390  df-om 7836  df-1st 7959  df-2nd 7960  df-frecs 8250  df-wrecs 8281  df-recs 8330  df-rdg 8369  df-oadd 8429  df-omul 8430  df-ni 10820  df-mi 10822  df-mpq 10857

This theorem is referenced by:  mulcomnq  10901  mulerpq  10905