| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addcompr | Structured version Visualization version GIF version | ||
| Description: Addition of positive reals is commutative. Proposition 9-3.5(ii) of [Gleason] p. 123. (Contributed by NM, 19-Nov-1995.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| addcompr | ⊢ (𝐴 +P 𝐵) = (𝐵 +P 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | plpv 11122 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 +P 𝐵) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 +Q 𝑦)}) | |
| 2 | plpv 11122 | . . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵 +P 𝐴) = {𝑥 ∣ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 +Q 𝑧)}) | |
| 3 | addcomnq 11063 | . . . . . . . . 9 ⊢ (𝑦 +Q 𝑧) = (𝑧 +Q 𝑦) | |
| 4 | 3 | eqeq2i 2776 | . . . . . . . 8 ⊢ (𝑥 = (𝑦 +Q 𝑧) ↔ 𝑥 = (𝑧 +Q 𝑦)) |
| 5 | 4 | 2rexbii 3142 | . . . . . . 7 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 +Q 𝑧) ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑧 +Q 𝑦)) |
| 6 | rexcom 3295 | . . . . . . 7 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑧 +Q 𝑦) ↔ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 +Q 𝑦)) | |
| 7 | 5, 6 | bitri 278 | . . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 +Q 𝑧) ↔ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 +Q 𝑦)) |
| 8 | 7 | abbii 2830 | . . . . 5 ⊢ {𝑥 ∣ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 +Q 𝑧)} = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 +Q 𝑦)} |
| 9 | 2, 8 | eqtrdi 2814 | . . . 4 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵 +P 𝐴) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 +Q 𝑦)}) |
| 10 | 9 | ancoms 464 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐵 +P 𝐴) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 +Q 𝑦)}) |
| 11 | 1, 10 | eqtr4d 2801 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 +P 𝐵) = (𝐵 +P 𝐴)) |
| 12 | dmplp 11124 | . . 3 ⊢ dom +P = (P × P) | |
| 13 | 12 | ndmovcom 7632 | . 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 2147 {cab 2741 ∃wrex 3090 (class class class)co 7443 +Q cplq 10967 Pcnp 10971 +P cpp 10973 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-inf2 9669 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-oadd 8508 df-omul 8509 df-er 8745 df-ni 10984 df-pli 10985 df-mi 10986 df-lti 10987 df-plpq 11020 df-enq 11023 df-nq 11024 df-erq 11025 df-plq 11026 df-1nq 11028 df-np 11093 df-plp 11095 |
| This theorem is used by: enrer 11175 addcmpblnr 11181 mulcmpblnrlem 11182 ltsrpr 11189 addcomsr 11199 mulcomsr 11201 mulasssr 11202 distrsr 11203 ltsosr 11206 0lt1sr 11207 0idsr 11209 1idsr 11210 ltasr 11212 recexsrlem 11215 mulgt0sr 11217 ltpsrpr 11221 map2psrpr 11222 |
| Copyright terms: Public domain | W3C validator |