| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mulcompq | Structured version Visualization version GIF version | ||
| Description: Multiplication of positive fractions is commutative. (Contributed by NM, 31-Aug-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| mulcompq | ⊢ (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mulcompi 10817 | . . . 4 ⊢ ((1st ‘𝐴) ·N (1st ‘𝐵)) = ((1st ‘𝐵) ·N (1st ‘𝐴)) | |
| 2 | mulcompi 10817 | . . . 4 ⊢ ((2nd ‘𝐴) ·N (2nd ‘𝐵)) = ((2nd ‘𝐵) ·N (2nd ‘𝐴)) | |
| 3 | 1, 2 | opeq12i 4816 | . . 3 ⊢ 〈((1st ‘𝐴) ·N (1st ‘𝐵)), ((2nd ‘𝐴) ·N (2nd ‘𝐵))〉 = 〈((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))〉 |
| 4 | mulpipq2 10860 | . . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = 〈((1st ‘𝐴) ·N (1st ‘𝐵)), ((2nd ‘𝐴) ·N (2nd ‘𝐵))〉) | |
| 5 | mulpipq2 10860 | . . . 4 ⊢ ((𝐵 ∈ (N × N) ∧ 𝐴 ∈ (N × N)) → (𝐵 ·pQ 𝐴) = 〈((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))〉) | |
| 6 | 5 | ancoms 459 | . . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐵 ·pQ 𝐴) = 〈((1st ‘𝐵) ·N (1st ‘𝐴)), ((2nd ‘𝐵) ·N (2nd ‘𝐴))〉) |
| 7 | 3, 4, 6 | 3eqtr4a 2801 | . 2 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴)) |
| 8 | mulpqf 10867 | . . . 4 ⊢ ·pQ :((N × N) × (N × N))⟶(N × N) | |
| 9 | 8 | fdmi 6673 | . . 3 ⊢ dom ·pQ = ((N × N) × (N × N)) |
| 10 | 9 | ndmovcom 7550 | . 2 ⊢ (¬ (𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴)) |
| 11 | 7, 10 | pm2.61i 183 | 1 ⊢ (𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 396 = wceq 1547 ∈ wcel 2119 〈cop 4568 × cxp 5623 ‘cfv 6492 (class class class)co 7363 1st c1st 7936 2nd c2nd 7937 Ncnpi 10765 ·N cmi 10767 ·pQ cmpq 10770 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-oadd 8406 df-omul 8407 df-ni 10793 df-mi 10795 df-mpq 10830 |
| This theorem is referenced by: mulcomnq 10874 mulerpq 10878 |
| Copyright terms: Public domain | W3C validator |