| 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 11024 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·P 𝐵) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)}) | |
| 2 | mpv 11024 | . . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵 ·P 𝐴) = {𝑥 ∣ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 ·Q 𝑧)}) | |
| 3 | mulcomnq 10966 | . . . . . . . . 9 ⊢ (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦) | |
| 4 | 3 | eqeq2i 2775 | . . . . . . . 8 ⊢ (𝑥 = (𝑦 ·Q 𝑧) ↔ 𝑥 = (𝑧 ·Q 𝑦)) |
| 5 | 4 | 2rexbii 3140 | . . . . . . 7 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 ·Q 𝑧) ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑧 ·Q 𝑦)) |
| 6 | rexcom 3293 | . . . . . . 7 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑧 ·Q 𝑦) ↔ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)) | |
| 7 | 5, 6 | bitri 278 | . . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 ·Q 𝑧) ↔ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)) |
| 8 | 7 | abbii 2829 | . . . . 5 ⊢ {𝑥 ∣ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 ·Q 𝑧)} = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)} |
| 9 | 2, 8 | eqtrdi 2813 | . . . 4 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵 ·P 𝐴) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)}) |
| 10 | 9 | ancoms 464 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐵 ·P 𝐴) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 ·Q 𝑦)}) |
| 11 | 1, 10 | eqtr4d 2800 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·P 𝐵) = (𝐵 ·P 𝐴)) |
| 12 | dmmp 11026 | . . 3 ⊢ dom ·P = (P × P) | |
| 13 | 12 | ndmovcom 7605 | . 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 1570 ∈ wcel 2145 {cab 2740 ∃wrex 3088 (class class class)co 7417 ·Q cmq 10869 Pcnp 10872 ·P cmp 10875 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-inf2 9624 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-oadd 8463 df-omul 8464 df-er 8700 df-ni 10885 df-mi 10887 df-lti 10888 df-mpq 10922 df-enq 10924 df-nq 10925 df-erq 10926 df-mq 10928 df-1nq 10929 df-np 10994 df-mp 10997 |
| This theorem is used by: mulcmpblnrlem 11083 mulcomsr 11102 mulasssr 11103 m1m1sr 11106 recexsrlem 11116 mulgt0sr 11118 |
| Copyright terms: Public domain | W3C validator |