| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mulcompr | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| mulcompr | ⊢ (𝐴 ·P 𝐵) = (𝐵 ·P 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mpv 11099 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·P 𝐵) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)}) | |
| 2 | mpv 11099 | . . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵 ·P 𝐴) = {𝑥 ∣ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 ·Q 𝑧)}) | |
| 3 | mulcomnq 11041 | . . . . . . . . 9 ⊢ (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦) | |
| 4 | 3 | eqeq2i 2773 | . . . . . . . 8 ⊢ (𝑥 = (𝑦 ·Q 𝑧) ↔ 𝑥 = (𝑧 ·Q 𝑦)) |
| 5 | 4 | 2rexbii 3138 | . . . . . . 7 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 ·Q 𝑧) ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑧 ·Q 𝑦)) |
| 6 | rexcom 3291 | . . . . . . 7 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑧 ·Q 𝑦) ↔ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)) | |
| 7 | 5, 6 | bitri 278 | . . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 ·Q 𝑧) ↔ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)) |
| 8 | 7 | abbii 2827 | . . . . 5 ⊢ {𝑥 ∣ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 ·Q 𝑧)} = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)} |
| 9 | 2, 8 | eqtrdi 2811 | . . . 4 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵 ·P 𝐴) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)}) |
| 10 | 9 | ancoms 464 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐵 ·P 𝐴) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)}) |
| 11 | 1, 10 | eqtr4d 2798 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·P 𝐵) = (𝐵 ·P 𝐴)) |
| 12 | dmmp 11101 | . . 3 ⊢ dom ·P = (P × P) | |
| 13 | 12 | ndmovcom 7608 | . 2 ⊢ (¬ (𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·P 𝐵) = (𝐵 ·P 𝐴)) |
| 14 | 11, 13 | pm2.61i 184 | 1 ⊢ (𝐴 ·P 𝐵) = (𝐵 ·P 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1569 ∈ wcel 2144 {cab 2738 ∃wrex 3086 (class class class)co 7420 ·Q cmq 10944 Pcnp 10947 ·P cmp 10950 |
| 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-pow 5326 ax-pr 5390 ax-un 7751 ax-inf2 9645 |
| 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-rmo 3365 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 4585 df-pr 4587 df-op 4835 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 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-oadd 8483 df-omul 8484 df-er 8720 df-ni 10960 df-mi 10962 df-lti 10963 df-mpq 10997 df-enq 10999 df-nq 11000 df-erq 11001 df-mq 11003 df-1nq 11004 df-np 11069 df-mp 11072 |
| This theorem is used by: mulcmpblnrlem 11158 mulcomsr 11177 mulasssr 11178 m1m1sr 11181 recexsrlem 11191 mulgt0sr 11193 |
| Copyright terms: Public domain | W3C validator |