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

Theorem mulcompr 11009
Description: Multiplication of positive reals is commutative. Proposition 9-3.7(ii) of [Gleason] p. 124. (Contributed by NM, 19-Nov-1995.) (New usage is discouraged.)
Assertion
Ref Expression
mulcompr (𝐴 ·P 𝐵) = (𝐵 ·P 𝐴)

Proof of Theorem mulcompr
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mpv 10997 . . 3 ((𝐴P𝐵P) → (𝐴 ·P 𝐵) = {𝑥 ∣ ∃𝑧𝐴𝑦𝐵 𝑥 = (𝑧 ·Q 𝑦)})
2 mpv 10997 . . . . 5 ((𝐵P𝐴P) → (𝐵 ·P 𝐴) = {𝑥 ∣ ∃𝑦𝐵𝑧𝐴 𝑥 = (𝑦 ·Q 𝑧)})
3 mulcomnq 10939 . . . . . . . . 9 (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦)
43eqeq2i 2776 . . . . . . . 8 (𝑥 = (𝑦 ·Q 𝑧) ↔ 𝑥 = (𝑧 ·Q 𝑦))
542rexbii 3141 . . . . . . 7 (∃𝑦𝐵𝑧𝐴 𝑥 = (𝑦 ·Q 𝑧) ↔ ∃𝑦𝐵𝑧𝐴 𝑥 = (𝑧 ·Q 𝑦))
6 rexcom 3294 . . . . . . 7 (∃𝑦𝐵𝑧𝐴 𝑥 = (𝑧 ·Q 𝑦) ↔ ∃𝑧𝐴𝑦𝐵 𝑥 = (𝑧 ·Q 𝑦))
75, 6bitri 278 . . . . . 6 (∃𝑦𝐵𝑧𝐴 𝑥 = (𝑦 ·Q 𝑧) ↔ ∃𝑧𝐴𝑦𝐵 𝑥 = (𝑧 ·Q 𝑦))
87abbii 2830 . . . . 5 {𝑥 ∣ ∃𝑦𝐵𝑧𝐴 𝑥 = (𝑦 ·Q 𝑧)} = {𝑥 ∣ ∃𝑧𝐴𝑦𝐵 𝑥 = (𝑧 ·Q 𝑦)}
92, 8eqtrdi 2814 . . . 4 ((𝐵P𝐴P) → (𝐵 ·P 𝐴) = {𝑥 ∣ ∃𝑧𝐴𝑦𝐵 𝑥 = (𝑧 ·Q 𝑦)})
109ancoms 463 . . 3 ((𝐴P𝐵P) → (𝐵 ·P 𝐴) = {𝑥 ∣ ∃𝑧𝐴𝑦𝐵 𝑥 = (𝑧 ·Q 𝑦)})
111, 10eqtr4d 2801 . 2 ((𝐴P𝐵P) → (𝐴 ·P 𝐵) = (𝐵 ·P 𝐴))
12 dmmp 10999 . . 3 dom ·P = (P × P)
1312ndmovcom 7599 . 2 (¬ (𝐴P𝐵P) → (𝐴 ·P 𝐵) = (𝐵 ·P 𝐴))
1411, 13pm2.61i 184 1 (𝐴 ·P 𝐵) = (𝐵 ·P 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wa 400   = wceq 1570  wcel 2143  {cab 2741  wrex 3089  (class class class)co 7412   ·Q cmq 10842  Pcnp 10845   ·P cmp 10848
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-inf2 9611
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  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 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-oadd 8458  df-omul 8459  df-er 8695  df-ni 10858  df-mi 10860  df-lti 10861  df-mpq 10895  df-enq 10897  df-nq 10898  df-erq 10899  df-mq 10901  df-1nq 10902  df-np 10967  df-mp 10970
This theorem is referenced by:  mulcmpblnrlem  11056  mulcomsr  11075  mulasssr  11076  m1m1sr  11079  recexsrlem  11089  mulgt0sr  11091
  Copyright terms: Public domain W3C validator