| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rpaddcl | Structured version Visualization version GIF version | ||
| Description: Closure law for addition of positive reals. Part of Axiom 7 of [Apostol] p. 20. (Contributed by NM, 27-Oct-2007.) |
| Ref | Expression |
|---|---|
| rpaddcl | ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 + 𝐵) ∈ ℝ+) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rpre 13004 | . . 3 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ) | |
| 2 | rpre 13004 | . . 3 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℝ) | |
| 3 | readdcl 11158 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 4 | 1, 2, 3 | syl2an 605 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 + 𝐵) ∈ ℝ) |
| 5 | elrp 12997 | . . 3 ⊢ (𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) | |
| 6 | elrp 12997 | . . 3 ⊢ (𝐵 ∈ ℝ+ ↔ (𝐵 ∈ ℝ ∧ 0 < 𝐵)) | |
| 7 | addgt0 11675 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (0 < 𝐴 ∧ 0 < 𝐵)) → 0 < (𝐴 + 𝐵)) | |
| 8 | 7 | an4s 670 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 < 𝐵)) → 0 < (𝐴 + 𝐵)) |
| 9 | 5, 6, 8 | syl2anb 607 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → 0 < (𝐴 + 𝐵)) |
| 10 | elrp 12997 | . 2 ⊢ ((𝐴 + 𝐵) ∈ ℝ+ ↔ ((𝐴 + 𝐵) ∈ ℝ ∧ 0 < (𝐴 + 𝐵))) | |
| 11 | 4, 9, 10 | sylanbrc 592 | 1 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 + 𝐵) ∈ ℝ+) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2144 class class class wbr 5102 (class class class)co 7398 ℝcr 11074 0cc0 11075 + caddc 11078 < clt 11218 ℝ+crp 12995 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-po 5557 df-so 5558 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-ov 7401 df-er 8680 df-en 8930 df-dom 8931 df-sdom 8932 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-rp 12996 |
| This theorem is referenced by: rpaddcld 13054 fsumrpcl 15766 logcnlem2 26710 logcnlem3 26711 logcnlem4 26712 loglesqrt 26828 ang180lem2 26877 cxp2limlem 27042 logdifbnd 27060 emcllem4 27065 emcllem5 27066 emcllem6 27067 selberg2lem 27616 chpdifbndlem2 27620 pntpbnd1a 27651 pntpbnd1 27652 pntpbnd2 27653 pntpbnd 27654 pntibndlem1 27655 pntibndlem2 27657 pntibnd 27659 pntlemd 27660 pntlemq 27667 pntlemr 27668 pntlemj 27669 pntlemp 27676 pntleml 27677 smcnlem 30902 qdiff 37824 hoidmvlelem3 47176 amgmwlem 50428 |
| Copyright terms: Public domain | W3C validator |