Theorem mulcompq 11038

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 10982	. . . 4 ⊢ ((1st ‘𝐴) ·N (1st ‘𝐵)) = ((1st ‘𝐵) ·N (1st ‘𝐴))
2		mulcompi 10982	. . . 4 ⊢ ((2nd ‘𝐴) ·N (2nd ‘𝐵)) = ((2nd ‘𝐵) ·N (2nd ‘𝐴))
3	1, 2	opeq12i 4837	. . 3 ⊢ ⟨((1st ‘𝐴) ·N (1st ‘𝐵)), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩ = ⟨((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))⟩
4		mulpipq2 11025	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = ⟨((1st ‘𝐴) ·N (1st ‘𝐵)), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩)
5		mulpipq2 11025	. . . 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 11032	. . . 4 ⊢ ·pQ :((N × N) × (N × N))⟶(N × N)
9	8	fdmi 6721	. . 3 ⊢ dom ·pQ = ((N × N) × (N × N))
10	9	ndmovcom 7608	. 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 1569   ∈ wcel 2144  ⟨cop 4589   × cxp 5648  ‘cfv 6538  (class class class)co 7420  1^st c1st 7999  2^nd c2nd 8000  Ncnpi 10930   ·_N cmi 10932   ·_pQ cmpq 10935

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8300  df-wrecs 8331  df-recs 8380  df-rdg 8419  df-oadd 8481  df-omul 8482  df-ni 10958  df-mi 10960  df-mpq 10995

This theorem is used by:  mulcomnq  11039  mulerpq  11043