Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  mulcompq Structured version   Visualization version   GIF version

Theorem mulcompq 10367
 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
StepHypRef Expression
1 mulcompi 10311 . . . 4 ((1st𝐴) ·N (1st𝐵)) = ((1st𝐵) ·N (1st𝐴))
2 mulcompi 10311 . . . 4 ((2nd𝐴) ·N (2nd𝐵)) = ((2nd𝐵) ·N (2nd𝐴))
31, 2opeq12i 4773 . . 3 ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩ = ⟨((1st𝐵) ·N (1st𝐴)), ((2nd𝐵) ·N (2nd𝐴))⟩
4 mulpipq2 10354 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩)
5 mulpipq2 10354 . . . 4 ((𝐵 ∈ (N × N) ∧ 𝐴 ∈ (N × N)) → (𝐵 ·pQ 𝐴) = ⟨((1st𝐵) ·N (1st𝐴)), ((2nd𝐵) ·N (2nd𝐴))⟩)
65ancoms 462 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐵 ·pQ 𝐴) = ⟨((1st𝐵) ·N (1st𝐴)), ((2nd𝐵) ·N (2nd𝐴))⟩)
73, 4, 63eqtr4a 2862 . 2 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴))
8 mulpqf 10361 . . . 4 ·pQ :((N × N) × (N × N))⟶(N × N)
98fdmi 6502 . . 3 dom ·pQ = ((N × N) × (N × N))
109ndmovcom 7319 . 2 (¬ (𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴))
117, 10pm2.61i 185 1 (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴)
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 399   = wceq 1538   ∈ wcel 2112  ⟨cop 4534   × cxp 5521  ‘cfv 6328  (class class class)co 7139  1st c1st 7673  2nd c2nd 7674  Ncnpi 10259   ·N cmi 10261   ·pQ cmpq 10264 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7445 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-ral 3114  df-rex 3115  df-reu 3116  df-rab 3118  df-v 3446  df-sbc 3724  df-csb 3832  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3903  df-nul 4247  df-if 4429  df-pw 4502  df-sn 4529  df-pr 4531  df-tp 4533  df-op 4535  df-uni 4804  df-iun 4886  df-br 5034  df-opab 5096  df-mpt 5114  df-tr 5140  df-id 5428  df-eprel 5433  df-po 5442  df-so 5443  df-fr 5482  df-we 5484  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-pred 6120  df-ord 6166  df-on 6167  df-lim 6168  df-suc 6169  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-ov 7142  df-oprab 7143  df-mpo 7144  df-om 7565  df-1st 7675  df-2nd 7676  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-oadd 8093  df-omul 8094  df-ni 10287  df-mi 10289  df-mpq 10324 This theorem is referenced by:  mulcomnq  10368  mulerpq  10372
 Copyright terms: Public domain W3C validator