| 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 11001 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 +P 𝐵) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 +Q 𝑦)}) | |
| 2 | plpv 11001 | . . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵 +P 𝐴) = {𝑥 ∣ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑦 +Q 𝑧)}) | |
| 3 | addcomnq 10942 | . . . . . . . . 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 463 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐵 +P 𝐴) = {𝑥 ∣ ∃𝑧 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = (𝑧 +Q 𝑦)}) |
| 11 | 1, 10 | eqtr4d 2800 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 +P 𝐵) = (𝐵 +P 𝐴)) |
| 12 | dmplp 11003 | . . 3 ⊢ dom +P = (P × P) | |
| 13 | 12 | ndmovcom 7599 | . 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 400 = wceq 1569 ∈ wcel 2142 {cab 2740 ∃wrex 3088 (class class class)co 7412 +Q cplq 10846 Pcnp 10850 +P cpp 10852 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-inf2 9608 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 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 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-oadd 8455 df-omul 8456 df-er 8692 df-ni 10863 df-pli 10864 df-mi 10865 df-lti 10866 df-plpq 10899 df-enq 10902 df-nq 10903 df-erq 10904 df-plq 10905 df-1nq 10907 df-np 10972 df-plp 10974 |
| This theorem is used by: enrer 11054 addcmpblnr 11060 mulcmpblnrlem 11061 ltsrpr 11068 addcomsr 11078 mulcomsr 11080 mulasssr 11081 distrsr 11082 ltsosr 11085 0lt1sr 11086 0idsr 11088 1idsr 11089 ltasr 11091 recexsrlem 11094 mulgt0sr 11096 ltpsrpr 11100 map2psrpr 11101 |
| Copyright terms: Public domain | W3C validator |